Analysis and Simulation of RFID Anti-collision Algorithms

In the RFID systems, tag collision arbitration is a significant issue for fast tag identification. This paper presents the analysis and simulation of several RFID anti-collision algorithms. In the anti-collision algorithms, ALOHA and binary tree algorithms are most widely used. The simulation is achieved by using C#.NET. In the simulation, EPC Class1 and EPC Class Generation2 protocols are chosen to be the criterions of the two algorithms. Finally some results of the simulation are listed. According to the simulation results between the different algorithms, an advanced DFSA algorithm based on a grouping method is proposed.

[1]  Chae-Woo Lee,et al.  An enhanced dynamic framed slotted ALOHA algorithm for RFID tag identification , 2005, The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services.

[2]  Jae-Hyun Kim,et al.  Dynamic framed slotted ALOHA algorithms using fast tag estimation method for RFID system , 2006, CCNC 2006. 2006 3rd IEEE Consumer Communications and Networking Conference, 2006..

[3]  Christian Floerkemeier,et al.  Comparison of transmission schemes for framed ALOHA based RFID protocols , 2006, International Symposium on Applications and the Internet Workshops (SAINTW'06).

[4]  Zhenhua Xie,et al.  An improved anti-collision algorithm in RFID system , 2005, 2005 2nd Asia Pacific Conference on Mobile Technology, Applications and Systems.