Abstract
Abstract-Radio Frequency Identification (RFID) systems are used in a variety of applications to uniquely identify physical objects. However, the most popular problem that always faces RFID systems is the collision between several tags that are present in the interrogation zone of a single reader at the same time. So, the reader will receive data, which will be interpreted as error and this leads to retransmission of tag IDs and results in wasting band-width and an increase in the total delay. There are two anti-collision algorithms that resolve tag collision: Binary tree search and ALOHA algorithms. The Binary tree algorithm increases the efficiency of the tag identification but it also increases the number of reading cycles. The ALOHA algorithm reduces the number of reading cycles but it faces tag starvation problem. The new proposed algorithm is combining between two variants of the two anti-collision algorithms: Binary query tree algorithm and dynamic framed slotted ALOHA algorithm. The new proposed algorithm results in improving the efficiency of tag identification and also reducing the number of read cycles.
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.
