Abstract
A fast tag anti-collision algorithm is proposed based on the binary search algorithm. First, the reader sends a query to make sure of what prefixes all the tags have, and the prefixes were pushed into a stack. Then queries containing the prefix information are sent to identify the tags. During the query process, the bits of data transmitted between the reader and the tags were greatly reduced; the back track strategy was adopted to reduce the reader query times. Simulation results show that the proposed algorithm achieves better performance than other algorithms by reducing query times and identification delay and increasing throughput, and is more suitable for the identification of great amounts of data in Internet of Things environment.
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.
