The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.06 - June (2013 vol.12)
pp: 1054-1064
Jung-Shian Li , National Cheng Kung University, Tainan
Yu-Min Huo , National Cheng Kung University, Tainan
ABSTRACT
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.
INDEX TERMS
Binary trees, Radiofrequency identification, Mobile computing, Handheld computers, Algorithm design and analysis, Robustness, Indexes, re-entering tag, Anticollision, RFID, blocking algorithm
CITATION
Jung-Shian Li, Yu-Min Huo, "An Efficient Time-Bound Collision Prevention Scheme for RFID Re-Entering Tags", IEEE Transactions on Mobile Computing, vol.12, no. 6, pp. 1054-1064, June 2013, doi:10.1109/TMC.2012.68
REFERENCES
[1] C. Floerkemeier and M. Wille, "Comparison of Transmission Schemes for Framed ALOHA Based RFID Protocols," Proc. Int'l Symp. Applications on Internet Workshops (SAINT), pp. 92-97, 2006.
[2] J. Park, M.Y. Chung, and T.J. Lee, "Identification of RFID Tags in Framed-Slotted ALOHA with Robust Estimation and Binary Selection," IEEE Comm. Letters, vol. 11, no. 5, pp. 452-454, May 2007.
[3] J.B. Eom, T.J. Lee, R. Rietman, and A. Yener, "An Efficient Framed-Slotted Aloha Algorithm with Pilot Frame and Binary Selection for Anti-Collision of RFID Tags," IEEE Comm. Letters, vol. 12, no. 11, pp. 861-863, Nov. 2008.
[4] Y.C. Ko, S. Roy, J.R. Smith, H.W. Lee, and C.H. Cho, "RFID MAC Performance Evaluation Based on ISO/IEC 18000-6 Type C," IEEE Comm. Letters, vol. 12, no. 6, pp. 426-428, June 2008.
[5] Y. Maguire and R. Pappu, "An Optimal Q-Algorithm for the ISO 18000-6C RFID Protocol," IEEE Trans. Automation Science and Eng., vol. 6, no. 1, pp. 16-24, Jan. 2009.
[6] W.T. Chen, "An Accurate Tag Estimate Method for Improving the Performance of an RFID Anticollision Algorithm Based on Dynamic Frame Length ALOHA," IEEE Trans. Automation Science and Eng., vol. 6, no. 1, pp. 9-15, Jan. 2009.
[7] J.G. Kim, "A Divide-and-Conquer Technique for Throughput Enhancement of RFID Anti-Collision Protocol," IEEE Comm. Letters, vol. 12, no. 6, pp. 474-476, June 2008.
[8] B. Li and J. Wang, "Efficient Anti-Collision Algorithm Utilizing the Capture Effect for ISO 18000-6C RFID Protocol," IEEE Comm. Letters, vol. 15, no. 3, pp. 352-354, Mar. 2011.
[9] Y.C. Lai and C.C. Lin, "A Pair-Resolution Blocking Algorithm on Adaptive Binary Splitting for RFID Tag Identification," IEEE Comm. Letters, vol. 12, no. 6, pp. 432-434, June 2008.
[10] Y.C. Lai and C.C. Lin, "Two Blocking Algorithms on Adaptive Binary Splitting: Single and Pair Resolutions for RFID Tag Identification," IEEE/ACM Trans. Networking, vol. 17, no. 3, pp. 962-975, June 2009.
[11] J.H. Choi, D. Lee, and H. Lee, "Query Tree-Based Reservation for Efficient RFID Tag Anti-Collision," IEEE Comm. Letters, vol. 11, no. 1, pp. 85-87, Jan. 2007.
[12] B. Feng, J.-T. Li, J.-B. Guo, and Z.-H. Ding, "ID-Binary Tree Stack Anticollision Algorithm for RFID," Proc. IEEE 11th Symp. Computers Comm. (ISCC '06), pp. 207-212, June 2006.
[13] Y.-H. Chen, S.-J. Horng, R.-S. Run, J.-L. Lai, R.-J. Chen, W.-C. Chen, Y. Pan, and T. Takao, "A Novel Anti-Collision Algorithm in RFID Systems for Identifying Passive Tags," IEEE Trans. Industrial Informatics, vol. 6, no. 1, pp. 105-120, Feb. 2010.
[14] C.N. Yang and J.Y. He, "An Effective 16-Bit Random Number Aided Query Tree Algorithm for RFID Tag Anti-Collision," IEEE Comm. Letters, vol. 15, no. 5, pp. 539-541, May 2011.
[15] M.K. Yeh and J.R. Jiang, "Adaptive K-Way Splitting and Pre- Signaling for RFID Tag Anti-Collision," Proc. IEEE 33rd Ann. Conf. Industrial Electronics Soc., pp. 40-45, Nov. 2007.
[16] M.K. Yeh, J.R. Jiang, and S.T. Huang, "Adaptive Splitting and Pre-Signaling for RFID Tag Anti-Collision," Computer Comm., vol. 32, no. 17, pp. 1862-1870, Nov. 2009.
[17] Y.C. Lai and L.Y. Hsiao, "General Binary Tree Protocol for Coping with the Capture Effect in RFID Tag Identification," IEEE Comm. Letters, vol. 14, no. 3, pp. 208-210, Mar. 2010,
[18] J. Myung, W. Lee, and J. Srivastava, "Adaptive Binary Splitting for Efficient RFID Tag Anti-Collision," IEEE Comm. Letters, vol. 10, no. 3, pp. 144-146, Mar. 2006.
[19] J. Myung, W. Lee, J. Srivastava, and T.K. Shih, "Tag-Splitting: Adaptive Collision Arbitration Protocols for RFID Tag Identification," IEEE Trans. Parallel Distributed Systems, vol. 18, no. 6, pp. 763-775, June 2007.
[20] M. Aigner, A Course in Enumeration (Graduate Texts in Mathematics). Springer, 2007.
47 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool