Abstract— 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.
Index Terms— RFID, anti-collision, binary tree, DFSA.
The authors are with the College of Information and Communication Engr., Sungkyunkwan University, Suwon 440-746, Korea (e-mail: tjlee@skku.edu).
[PDF]
Cite: Chul Wan Park, Ji Hyoung Ahn, and Tae-Jin Lee, " RFID Identification Protocol with Optimal Frame Size for Varying Slot Time," International Journal of Information and Electronics Engineering vol. 4, no. 2, pp. 87-91, 2014.
