Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
