Research on RFID anti-collision algorithms based on binary tree

Tongxin Xuebao/Journal on Communications

Volumn 31, Issue 6, 2010, Pages 49-57

  Wang, Xue ^a   Qian, Zhi Hong ^a   Hu, Zheng Chao ^a   Li, Yi Nan ^a  

^a JILIN UNIVERSITY   (China)

Author keywords

Anti collision; Binary tree; Bit locking; RFID

Indexed keywords

ANTI-COLLISION; ANTI-COLLISION ALGORITHMS; ANTI-COLLISION PROTOCOLS; BACK-OFF; BINARY ALGORITHMS; BINARY TREE ALGORITHM; POWER CONSUMPTION; SIMULATION RESULT; TRANSMISSION DELAYS;

BINARY TREES;

ALGORITHMS;

EID: 77954802937     PISSN: 1000436X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (16)

1. FINKENZELLER K. RFID-Handbook Fundamentals and Applications in Contactless Smart Cards and Identification (2nd Edition)[M]. New York: Wiley and Sons, 2003.
2. MIT Auto-ID Center. Draft protocol specification for a 900 MHz class 0 radio frequency identification tag[EB/OL]. http://auto-id.mit.edu, 2003.
3. WANG B S, ZHANG Q S. Study of anti-collision performance in parallelizable identification UHF RFID system[J]. Journal on Communications, 2009, 30(6): 108-113.
4. KIM S S, KIM Y H, LEE S J, et al. An improved anti collision algorithm using parity bit in RFID system[A]. The 7th IEEE International Symposium on Network Computing and Applications[C]. 2008. 224-227.
5. BONUCCELLI M A, LONETTI F, MARTELLI F. Tree slotted aloha: a new protocol for tag identification in RFID networks[A]. Proc of IEEE Int Symposium on a World of Wireless, Mobile and Multimedia Networks[C]. 2006. 603-608.
6. CHA J R, KIM J H. Dynamic framed slotted ALOHA algorithms using fast tag estimation method for RFID system[A]. Consumer Communications and Networking Conference, CCNC 2006, 3rd IEEE[C]. 2006. 768-772.
7. PENG Q S, ZHANG M, WU W M. Variant enhanced dynamic framed slotted ALOHA algorithm for fast object identification in RFID system[A]. Anti-Counterfeiting, Security, Identification, 2007 IEEE International Workshop[C]. 2007. 88-91.
8. FINKENZELLER K. RFID Handbook: Fundamentals and Applications in Contactless Smart Cards and Identification, 2nd ed[M]. John Wiley and Sons Ltd, 2003.
9. YU S S, ZHAN Y J, WANG Z P, et al. Anti-collision algorithm based on jumping and dynamic searching and its analysis[J]. Computer Engineering, 2005, 31: 19-20.
10. WANG T P. Enhanced binary search with cut-through operation for anti-collision in RFID systems[J]. IEEE Communications Letters, 2006, 10(4): 236-238.
11. CAPETANAKIS J. Tree algorithm for packet broadcast channels[J]. IEEE Trans Inform Theory, 1979, 25: 505-515.
12. MEHLBORN K. Dynamic Binary Search[M]. Springer Berlin/Heideberg, 1977. 323-336.
13. WANG C C, DERRYBERRY J, SLEATOR D D. O(loglogn) competitive dynamic binary search trees[A]. Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm[C]. 2006. 374-383.
14. LAW C, LEE K, SIU K Y. Efficient memoryless protocol for tag identification[A]. Proceedings of the 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications[C]. Boston, Massachusetts, 2000. 75-84.
15. ZHOU F, CHEN C, JIN D, et al. Evaluating and optimizing power consumption of anti-collision protocols for applications in RFID systems[A]. Proceedings of the International Symposium on Low Power Electronics and Design[C]. 2004. 357-362.
16. COVER T M, THOMAS J A. Elements of Information Theory (2nd Edition)[M]. John Wiley and Sons, 2001.