Abstract
The anti-collision algorithm is very important for the Radio-Frequency Identification (RFID) system. For the various possible algorithms, hybrid algorithm has the best performance because it combines the ideas of binary tree with frame-slotted ALOHA. Previous papers mainly focused on the tag population estimation and frame size. However, the time taken by different slots was not considered. In this paper, a fined-grained time model that specifies time requirements for reader and tags communications is derived. The model highlights that the duration of an idle slot is shorter than the time taken by an identification or collision slot. We use this model to deduce the optimal frame size. The optimal frame size for different RFID systems is derived numerically. The principle to select the optimal frame size is given, which is verified by simulations and a case study. Results show that we should compress the idle slot as much as possible to improve system efficiency.
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.
