Skip Navigation

IEICE Transactions on Communications 2008 E91-B(4):1168-1171; doi:10.1093/ietcom/e91-b.4.1168
This Article
Right arrow Abstract Freely available
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Request Permissions
Google Scholar
Right arrow Articles by CHEN, W.-T.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Copyright © 2008 The Institute of Electronics, Information and Communication Engineers

Regular Section -- Letters -- Network

Performance Comparison of Binary Search Tree and Framed ALOHA Algorithms for RFID Anti-Collision

Wen-Tzu CHEN1

1 The author is with the Institute of Telecommunications Management, National Cheng Kung University, Taiwan. E-mail: wtchen{at}mail.ncku.edu.tw

Binary search tree and framed ALOHA algorithms are commonly adopted to solve the anti-collision problem in RFID systems. In this letter, the read efficiency of these two anti-collision algorithms is compared through computer simulations. Simulation results indicate the framed ALOHA algorithm requires less total read time than the binary search tree algorithm. The initial frame length strongly affects the uplink throughput for the framed ALOHA algorithm.

Key Words: anti-collision, RFID, binary search tree, framed ALOHA


Manuscript received August 28, 2007. Manuscript revised December 11, 2007.

Reference

[1] K. Finkenzeller, RFID handbook, 2nd ed., John Wiley & Sons, 2003.

[2] ISO/IEC 18000-6: Information technology — Radio frequency identification for item management, Part 6, Parameters for air interface communications at 860 MHz to 960 MHz, 2004/Amd 1: 2006.

[3] D.R. Hush and C. Wood, "Analysis of tree algorithm for RFID arbitration," Proc. IEEE International Symposium on Information Theory, p.107, 1998.

[4] J. Myung, W. Lee, and J. Srivastava, "Adaptive binary splitting for efficient RFID tag anti-collision," IEEE Commun. Lett., vol.10, no.3, pp.144–146, March 2006.

[5] ISO/IEC 14443-3: Identification cards — Contactless integrated circuit cards — Proximity cards, Part 3, Initialization and anticollision, 2000.

[6] EPCglobal, Class 1 Generation 2 UHF Air Interface Protocol Standard, 2005.

[7] B. Zhen, M. Kobayashi, and M. Shimizu, "Framed ALOHA for multiple RFID objects identification," IEICE Trans. Commun., vol.E88-B, no.3, pp.991–999, March 2005.

[8] W.-T. Chen and G.-H. Lin, "An efficient anti-collision method for tag identification in a RFID system," IEICE Trans. Commun., vol.E89-B, no.12, pp.3386–3392, Dec. 2006.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?



This Article
Right arrow Abstract Freely available
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Request Permissions
Google Scholar
Right arrow Articles by CHEN, W.-T.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?