A Novel Query Tree Protocol with Bit Tracking in RFID Tag Identification

Citations Over TimeTop 10% of 2012 papers

Abstract

Tag anticollision has long been an important issue in RFID systems. To accelerate tag identification, some researchers have recently adopted bit tracking technology that allows the reader to detect the locations of collided bits in a collision slot. However, these methods still encounter the problem of too many collisions occurring at the beginning of identification. This paper proposes an optimal query tracking tree protocol (OQTT) that tries to separate all of the tags into smaller sets to reduce collisions at the beginning of identification. Using bit tracking technology, OQTT mainly adopts three proposed approaches, bit estimation, optimal partition, and query tracking tree. Bit estimation first estimates the number of tags based on the locations of collided bits. Optimal partition then determines the optimal number of the initial sets based on this estimation. Query tracking tree splits a set of collided tags into two subsets using the first collided bit in the tag IDs. This paper analyzes the efficiency of OQTT, which represents how many tags can be identified in a slot. Results show that its efficiency is close to 0.614, the highest efficiency published to date. The simulation results further show that OQTT outperforms other existing algorithms.

Related Papers

• → Multiple-particle tracking—an improvement for positron particle tracking(2006)57 cited
• → The role of radio frequency identification (RFID) technologies in improving distribution and retail operations in the fashion supply chain(2014)2 cited
• Radio frequency identification in logistics(2006)
• Radio Frequency Identification Concepts and Applications(2014)
• → Evaluating the Importance of Radio Frequency Identification (RFID) in Warehouse Operations for Army Supply Readiness(2024)