Abstract
To solve the RFID tag collision problem, a new anti-collision algorithm is proposed by improving the binary tree search algorithm. Through improving the requesting establishment, this algorithm reduces the probability of collision bits and the number of tags requiring collision detection time by using the even number bits for impact identification. The simulation results show that compared with the traditional binary tree search algorithm and dynamic binary tree search algorithm, this algorithm has obvious advantages in terms of the length of the transmission of binary data. In addition, in terms of the average number of requests, the proposed algorithm provides the same performance with the faster identification process, and reduces the time of the transmission of information
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.
