RFID Identification Protocol with Optimal Frame Size for Varying Slot Time
Keywords:
RFID, anti-collision, binary tree, DFSAAbstract
In an RFID system, an efficient anti-collision
algorithm is essential to quickly identify a number of tags. Most
of RFID anti-collision algorithms are designed by assuming that
the time durations of all slots are the same. In this paper, we
propose a new anti-collision algorithm based on the binary tree
algorithm and the framed slotted ALOHA algorithm with an
optimal frame size determination method. The durations of an
idle slot and a collision slot can differ from the duration of a
success slot by the QueryRep (QR) command. The proposed
algorithm can estimate the number of tags even when the zero
estimation is not applicable. And an appropriate frame size is
determined considering the time duration of adaptive slot size.
We show that the identification time is reduced using our
proposed Hybrid Framed Slotted ALOHA with Adaptive Slot
(HFSA-AS) through analysis and simulations
Downloads
Published
Issue
Section
License
You are free to:
- Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
- Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.
