Design of Hash-Tree Anti-collision Algorithm

In RFID system, the problem of the collision between tags is a focus topic. The Hash-tree anti-collision algorithm was proposed in the paper, which adopted hash operation to allocate slots for tags and used tree searching method to identify collision tags in the queue of collision slots. The proposed algorithm doesn't require readers to test the precise location of collision bits, and its performance beyond 36.8% is better than ALOHA- based algorithms.

[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]  Peter Hawkes.  Anti-collision and Transponder Selection Methods for Grouped "Vicinity" Cards and PFID tags , 1999 .

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

[4]  Tang Zhongping,et al.  Anti-collision Algorithm Based on Jumping and Dynamic Searching and Its Analysis , 2005 .

[5]  Jae-Hyun Kim,et al.  Novel Anti-collision Algorithms for Fast Object Identification in RFID System , 2005, 11th International Conference on Parallel and Distributed Systems (ICPADS'05).