Prefix-maximized query-tree anti-collision algorithm with robust estimation for RFID system

In RFID systems, tag anti-collision algorithm is significantly important for fast tag identification. In this paper, we research a robust tag estimation method and the PRQT algorithm, and propose prefix-maximized query-tree (PMQT) tag anti-collision protocol. The simulation results show that the system efficiency of PMQT is higher than the previous protocol about 18%-30%. In addition, PMQT algorithm has tolerance to the inaccuracy of tag estimation.

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

[2]  Wen-Tzu Chen,et al.  A Feasible and Easy-to-Implement Anticollision Algorithm for the EPCglobal UHF Class-1 Generation-2 RFID Protocol , 2014, IEEE Transactions on Automation Science and Engineering.

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

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

[5]  GuYu,et al.  Binary Tree Slotted ALOHA for Passive RFID Tag Anticollision , 2013 .

[6]  Min Young Chung,et al.  Identification of RFID Tags in Framed-Slotted ALOHA with Robust Estimation and Binary Selection , 2007, IEEE Communications Letters.

[7]  Tae-Jin Lee,et al.  Error Resilient Estimation and Adaptive Binary Selection for Fast and Reliable Identification of RFID Tags in Error-Prone Channel , 2012, IEEE Transactions on Mobile Computing.

[8]  Alex X. Liu,et al.  Fast and Accurate Estimation of RFID Tags , 2015, IEEE/ACM Transactions on Networking.