Abstract
In this study, we propose a bit slotted ALOHA algorithm based on a polling mechanism (PBSA) to address the tag collision problem of dynamic radio frequency identification (RFID) systems. This algorithm is based on a combination of the dynamic framed slotted ALOHA (DFSA) algorithm and the free framed slotted ALOHA (FSA) algorithm. The polling mechanism is introduced to change the tag removal protocol. While removing the idle slots, the collision slot is converted into a single slot, which improves the tag recognition efficiency per unit frame. Simulation analysis shows that compared with the dynamic framed slotted ALOHA (DFSA) algorithm, the grouped dynamic framed slotted ALOHA (GDFSA) algorithm, and the cancel idle framed slotted ALOHA (CIFSA) algorithm, the PBSA algorithm exhibits lower slot overhead, higher tag throughput, and lower lag loss rate, which improves the efficiency of tag identification in dynamic RFID systems.
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.
