Abstract
In this paper, we propose an improved anti-collision technique based on the binary search algorithm. The improvement is achieved thanks to the manner of the requests’ building. This latter reduces considerably the responding tag's numbers and therefore, decreases the probability of bit's collision. Further, the algorithm provides a noticeable advantage for the length of transmitted binary data compared against basic binary search and dynamic binary search algorithms. Besides, it provides same performance in terms of average request's number making the identification process faster, and the expose time of information is then reduced.
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 callMore From: AEU - International Journal of Electronics and Communications
Disclaimer: 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.
