Improved RFID Anti-Collision Algorithm Based on Quad-Tree

Radio Frequency Identification (RFID) technology is a contactless automatic identification technology. With the wide application of this technology in many fields, anti-collision algorithm to solve the problem of multi-tag identification becomes more and more important. The current RFID anti-collision algorithm is mainly divided into two categories: ALOHA based algorithm and tree based algorithm. The traditional tree based anti-collision algorithm has a long time and low efficiency. Based on this, this paper proposed an improved RFID anti-collision algorithm based on quad-tree. It can eliminate idle timeslots of the identification process by grouping and re-encoding the original ID code of electronic tag. The mathematical analysis and simulation results show that the identification performance of the proposed algorithm is greatly improved compared with other traditional tree based algorithms.

[1]  D. R. Hush,et al.  Analysis of tree algorithms for RFID arbitration , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[2]  Jaideep Srivastava,et al.  Adaptive binary splitting for efficient RFID tag anti-collision , 2006, IEEE Communications Letters.

[3]  Wonjun Lee,et al.  Adaptive Binary Splitting: A RFID Tag Collision Arbitration Protocol for Tag Identification , 2005, 2nd International Conference on Broadband Networks, 2005..

[4]  Nai-Wei Lo,et al.  An Efficient Tree-Based Tag Identification Protocol for RFID Systems , 2008, 22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008).

[5]  Yvonne Schuhmacher,et al.  Rfid Handbook Fundamentals And Applications In Contactless Smart Cards And Identification , 2016 .