Abstract
Collision is a familiar problem in a RFID (radio frequency identification) system. How to solve this problem effectively is very important to the whole RFID system. A RFID system is always made up of two indispensable components: one is the tag, the other is the reader. Collisions occur when there are so many tags within the interrogation zone of a reader communicating with the reader synchronously. Binary search algorithm is an important anti-collision algorithm to solve the collision problems. But the main disadvantage of any existing algorithm based on binary search algorithm is the rate of identifying the identification codes (IDs) of tags is slow. In this paper, an improved anti-collision algorithm is proposed. Using this algorithm will recognize more tags in less time compared with other existing algorithms
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.
