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

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.

[1]  Ravikanth Pappu,et al.  An Optimal Q-Algorithm for the ISO 18000-6C RFID Protocol , 2009, IEEE Transactions on Automation Science and Engineering.

[2]  Pingzhi Fan,et al.  An Enhanced Anti-collision Algorithm in RFID Based on Counter and Stack , 2007, 2007 Second International Conference on Systems and Networks Communications (ICSNC 2007).

[3]  Hyuckjae Lee,et al.  Query tree-based reservation for efficient RFID tag anti-collision , 2007, IEEE Communications Letters.

[4]  Sung Kwon Kim,et al.  RFID Tag Anti-Collision Protocol: Query Tree with Reversed IDs , 2008, 2008 10th International Conference on Advanced Communication Technology.

[5]  Younghwan Yoo,et al.  A Bit collision detection based Query Tree protocol for anti-collision in RFID system , 2010, 2010 IEEE 6th International Conference on Wireless and Mobile Computing, Networking and Communications.

[6]  Wonjun Lee,et al.  An Adaptive Memoryless Protocol for RFID Tag Collision Arbitration , 2006, IEEE Transactions on Multimedia.

[7]  M. Victoria Bueno-Delgado,et al.  Multiframe Maximum-Likelihood Tag Estimation for RFID Anticollision Protocols , 2011, IEEE Transactions on Industrial Informatics.

[8]  Frank Yeong-Sung Lin,et al.  Efficient Estimation and Collision-Group-Based Anticollision Algorithms for Dynamic Frame-Slotted ALOHA in RFID Networks , 2010, IEEE Transactions on Automation Science and Engineering.

[9]  A.M. Madni,et al.  Models for Cost-Benefit Analysis of RFID Implementations in Retail Stores , 2007, IEEE Systems Journal.

[10]  Cunqing Hua,et al.  Prefix-Randomized Query-Tree Protocol for RFID Systems , 2006, 2006 IEEE International Conference on Communications.

[11]  Lei Zhu,et al.  The Optimal Reading Strategy for EPC Gen-2 RFID Anti-Collision Systems , 2010, IEEE Transactions on Communications.

[12]  Harald Vogt,et al.  Efficient Object Identification with Passive RFID Tags , 2002, Pervasive.

[13]  Shing-Tsaan Huang,et al.  Parallel Response Query Tree Splitting for RFID Tag Anti-collision , 2011, 2011 40th International Conference on Parallel Processing Workshops.

[14]  Lei Zhu,et al.  Optimal Framed Aloha Based Anti-Collision Algorithms for RFID Systems , 2010, IEEE Transactions on Communications.

[15]  Lei Zhu,et al.  A critical survey and analysis of RFID anti-collision mechanisms , 2011, IEEE Communications Magazine.

[16]  Chih-Chung Lin,et al.  Two Blocking Algorithms on Adaptive Binary Splitting: Single and Pair Resolutions for RFID Tag Identification , 2009, IEEE/ACM Transactions on Networking.

[17]  Eman Shaaban,et al.  An enhanced binary tree anti-collision technique for dynamically added tags in RFID systems , 2010, 2010 2nd International Conference on Computer Engineering and Technology.

[18]  Klaus Dohmen,et al.  An improvement of the inclusion-exclusion principle , 1999 .

[19]  Chih-Chung Lin,et al.  Two Couple-Resolution Blocking Protocols on Adaptive Query Splitting for RFID Tag Identification , 2012, IEEE Transactions on Mobile Computing.

[20]  Feng Zhou,et al.  Optimize the power consumption of passive electronic tags for anti-collision schemes , 2003, ASICON 2003.

[21]  Ching-Nung Yang,et al.  An Effective 16-bit Random Number Aided Query Tree Algorithm for RFID Tag Anti-Collision , 2011, IEEE Communications Letters.

[22]  Yi Pan,et al.  A Novel Anti-Collision Algorithm in RFID Systems for Identifying Passive Tags , 2010, IEEE Transactions on Industrial Informatics.

[23]  Bo Li,et al.  Efficient Anti-Collision Algorithm Utilizing the Capture Effect for ISO 18000-6C RFID Protocol , 2011, IEEE Communications Letters.

[24]  Tae-Jin Lee,et al.  An efficient framed-slotted ALOHA algorithm with pilot frame and binary selection for anti-collision of RFID tags , 2008, IEEE Communications Letters.

[25]  Klaus Finkenzeller,et al.  RFID Handbook: Radio-Frequency Identification Fundamentals and Applications , 2000 .

[26]  Yuan-Cheng Lai,et al.  General binary tree protocol for coping with the capture effect in RFID tag identification , 2010, IEEE Communications Letters.

[27]  Lixin Gao,et al.  Energy-Aware Tag Anticollision Protocols for RFID Systems , 2007, IEEE Transactions on Mobile Computing.

[28]  Wen-Tzu Chen,et al.  An Accurate Tag Estimate Method for Improving the Performance of an RFID Anticollision Algorithm Based on Dynamic Frame Length ALOHA , 2009, IEEE Transactions on Automation Science and Engineering.

[29]  M. Azambuja,et al.  Survey of Standardized ISO 18000-6 RFID Anti-collision Protocols , 2008, 2008 Second International Conference on Sensor Technologies and Applications (sensorcomm 2008).