A fast RFID identification protocol with low tag complexity


In this letter, a novel Query window Tree (QwT) protocol is proposed and presented. Based on the Query Tree (QT), a fast anti-collision protocol with low tag complexity (which preserves the memoryless feature of the QT) is achieved. The QwT effectively controls the number of responded bits from tags by adopting a dynamic-size 'window'. As a result, the tags of the proposed QwT deliver exclusively the bits that are required by the window controlled at the reader, rather than sending their full ID. Simulations show that the QwT positively decreases the total number of bits that are transmitted by a tag and as a result mitigates latency. © 1997-2012 IEEE.