An Efficient Identification Scheme based on m Collision Bits for RFID Tags

This paper proposes a new memoryless RFID tag identification protocol CQT-m, compressed query tree protocol using at most m collision bits at a time. The CQT-m is a deterministic tree-based anti-collision protocol. The novelty of the CQT-m scheme is that it uses up to m collision bits at a time to generate new queries. According to our experimental results, the proposed identification method CQT-m is superior to the collision tree method by up to 50 percent in the number of transactions and by up to 85 percent in the number of bits transmitted between the reader and RFID tags where m is equal to 2.