Abstract
RFID systems have been extensively applied in many fields for the past few years. Along with RFID technique changing our life, there still exist some issues that can't be ignored. Anti-collision ability is one of the most important standards to measure the performance of the system. We use the anti-collision algorithms to make sure that our information is read correctly and completely. It is urgent to find efficient ways to solve the collision problem and enhance the rate of identifying the tags. In this paper, we present a dynamic slotted binary search method (DSBS) that connects the classical Dynamic Framed Slotted ALOHA (DSFA) method with binary tree search (BS) method. Compared with other existing algorithms, we make several new progresses. First, we cut the execution time effectively. Second, we decrease the collision probability to a great extent. The analytic results show that the proposed scheme achieves faster identifying rate and fewer collisions, especially when the tag amount is large.
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.
