An Adaptive Anti-Collision Protocol for Large-Scale RFID Tag Identification

Tag collision presents a significant impact on RFID systems. In this letter, we propose an efficient tag anti-collision protocol termed the adaptive assigned tree slotted Aloha anti-collision (AdATSA) protocol. In this protocol, the binary grouping and adaptive recognition phases are employed to effectively estimate the tag number and promptly identify tags. Additionally, we further improve the system efficiency of AdATSA by investigating the influence factor between the frame length and the tag number. Through numerical results, we are able to obtain several values of the influence factor, which helps to achieve the optimal system efficiency for AdATSA. Both analytical and simulation results are presented to show that the highest system efficiency of AdATSA is 61.7%, outperforming the previous protocols.

[1]  Yuping Zhao,et al.  Performance evaluation of a multi-branch tree algorithm in RFID , 2010, IEEE Transactions on Communications.

[2]  Yu Zeng,et al.  Binary Tree Slotted ALOHA for Passive RFID Tag Anticollision , 2013, IEEE Transactions on Parallel and Distributed Systems.

[3]  Thomas F. La Porta,et al.  Anticollision Protocols for Single-Reader RFID Systems: Temporal Analysis and Optimization , 2011, IEEE Transactions on Mobile Computing.

[4]  Ivan Stojmenovic,et al.  RFID Systems: Research Trends and Challenges , 2011 .

[5]  Yuan-Cheng Lai,et al.  A Novel Query Tree Protocol with Bit Tracking in RFID Tag Identification , 2013, IEEE Transactions on Mobile Computing.

[6]  Harald Vogt,et al.  Multiple object identification with passive RFID tags , 2002, IEEE International Conference on Systems, Man and Cybernetics.

[7]  Jin Zhang,et al.  Assigned Tree Slotted Aloha RFID Tag Anti-Collision Protocols , 2013, IEEE Transactions on Wireless Communications.