Abstract
Passive UHF RFID systems using Dynamic Frame-Slotted ALOHA (DFSA) adjust the frame size according to the number of tags, but frame size N is equals to 2 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Q</sup> and cannot be adjusted exactly to the number of tags to be identified. In this paper, we propose an optimal Aloha algorithm (ODFSA), which uses probabilistic approach for tags to access the frame. The Query or Query Adjust packet contains both the parameter Q and P called frame access probability, which represents the ratio of number of active tags in the current frame to the estimated total number of tags which remain to be identified in the system. Estimation of number of unread tags is updated after end of each frame; parameters Q and P are calculated and informed at the beginning of each frame. Mathematical analysis and computer simulations show that the proposed Aloha achieves maximum system efficiency, utilizes less number of slots compared with other algorithms and also takes less identification time.
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.
