Dynamic Disperse and Shrink Anti-collision Algorithm for Radio Frequency Identification

In radio frequency identification (RFID) systems, tag collision arbitration is a significant issue for fast tag identification. In this paper, the author proposed an improved anti-collision algorithm, namely Dynamic Disperse and Shrink algorithm, based on the analysis of binary tree anti-collision algorithm. In the algorithm, both 0-branch tags and 1-branch tags are hashed. Thus, when 0-branch tag identification completed, 1-branch tags will be right hashed, which can reduce the hash times, and improve the efficiency of the system. Performance analysis and simulation results show that the proposed algorithm improves the identification efficiency by about 6% compared to binary tree algorithm.