Issue No. 06 - June (2013 vol. 12)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TMC.2012.68
Jung-Shian Li , National Cheng Kung University, Tainan
Yu-Min Huo , National Cheng Kung University, Tainan
The efficiency of RFID applications is severely degraded when multiple tags transmit their IDs simultaneously. As a result, many anticollision algorithms have been proposed for reducing collisions at the reader. However, these algorithms focus only on the tags within communication range of the reader in the previous or current frames. That is, they ignore tags which move out of range of the reader in one frame, but then move back within range several frames later. As a result, the identification performance of the reader is seriously degraded. The present study analyzes the effect of re-entering tags on the performance of three common anticollision algorithms and proposes a new reblocking algorithm (RBA) to alleviate the problem. The lower and upper bounds of the collision probability for re-entering tags are derived using a multinomial coefficients approach. The performance evaluation results show that the proposed algorithm consumes fewer cycles and provides a more robust identification performance than existing blocking algorithms in real-world RFID systems characterized by re-entering tags.
Binary trees, Radiofrequency identification, Mobile computing, Handheld computers, Algorithm design and analysis, Robustness, Indexes, re-entering tag, Anticollision, RFID, blocking algorithm
Y. Huo and J. Li, "An Efficient Time-Bound Collision Prevention Scheme for RFID Re-Entering Tags," in IEEE Transactions on Mobile Computing, vol. 12, no. , pp. 1054-1064, 2013.