An Efficient and Reliable Tree-based Anti-collision Protocol for RFID Systems with Capture Effect

In radio frequency identification (RFID) systems, if tags transmit their IDs simultaneously, a reader cannot correctly identify the IDs due to collision and the performance of RFID systems degrades by the collision. So, anti-collision protocols to reduce the number of collisions are required. The binary tree anti-collision protocol branches randomly in a tree to reduce collisions in the next identification process when the IDs are not identified after sending the IDs of tags. The channel condition may change due to the distance between a reader and a tag, noise or interference from he IDs of tags in the binary tree protocol. When a tag is identified by the capture effect, the tags in the same slot may lose the opportunity for identification. Thus, we propose an efficient and reliable binary tree-based anti-collision protocol considering channel errors and the capture effect. We derive the total time slots of the proposed protocol analytically and show the performance of RFID systems for the proposed protocol through simulations. Keywords—Radio frequency identification (RFID), anticollision, channel error, capture effect

[1]  Bo Li,et al.  Efficient Anti-Collision Algorithm Utilizing the Capture Effect for ISO 18000-6C RFID Protocol , 2011, IEEE Communications Letters.

[2]  Jae-Hyun Kim,et al.  Novel Anti-collision Algorithms for Fast Object Identification in RFID System , 2005, 11th International Conference on Parallel and Distributed Systems (ICPADS'05).

[3]  Harald Vogt,et al.  Efficient Object Identification with Passive RFID Tags , 2002, Pervasive.

[4]  Mustapha Chérif-Eddine Yagoub,et al.  Performance analysis of basic tree protocols and ALOHA-based anti-collision algorithms used in RFID systems , 2011, 2011 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT).

[5]  Nancy Argüelles,et al.  Author ' s , 2008 .

[6]  Yuan-Cheng Lai,et al.  General binary tree protocol for coping with the capture effect in RFID tag identification , 2010, IEEE Communications Letters.

[7]  Augustus J. E. M. Janssen,et al.  Analysis of contention tree algorithms , 2000, IEEE Trans. Inf. Theory.

[8]  F. Schoute,et al.  Dynamic Frame Length ALOHA , 1983, IEEE Trans. Commun..

[9]  F. De Flaviis,et al.  RF Identification (RFID) Reader Front Ends With Active Blocker Rejection , 2009, IEEE Transactions on Microwave Theory and Techniques.

[10]  Jaideep Srivastava,et al.  Adaptive binary splitting for efficient RFID tag anti-collision , 2006, IEEE Communications Letters.

[11]  Jeong Geun Kim,et al.  A capture-aware access control method for enhanced RFID anti-collision performance , 2009, IEEE Communications Letters.

[12]  Chiara Petrioli,et al.  Performance Analysis of Anti-Collision Protocols for RFID Systems , 2009, VTC Spring 2009 - IEEE 69th Vehicular Technology Conference.

[13]  Tae-Jin Lee,et al.  Channel-Aware Line Code Decision in RFID , 2011, IEEE Communications Letters.

[14]  N. Karmakar,et al.  A performance evaluation and analysis of Capture Effect in RFID system , 2008, 2008 Asia-Pacific Microwave Conference.

[15]  Zoran Hadzi-Velkov,et al.  Capture effect with diversity in IEEE 802.11b DCF , 2003, Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003.

[16]  Yigang He,et al.  The Effects of Antenna Properties on Read Distance in Passive Backscatter RFID Systems , 2009, 2009 International Conference on Networks Security, Wireless Communications and Trusted Computing.