An Enhanced Multiple-Feedback Algorithm for RFID MAC Protocols

This paper introduces two new tree-based anti-collision schemes using multiple feedback symbols for uplink tag random access of emerging radio frequency identification (RFID) networks. To this end a uplink(UL) time slot requires an extra time portion called voting field in addition to the packet payload to obtain a slot based estimate for the number of contending tags. As a function of the voting field length we examine MAC efficiency improvements in terms of UL throughput, and compare it with the conventional binary tree based RFID MAC in ISO 18000-6 Type B standard.

[1]  Toby Berger,et al.  Delay analysis of interval-searching contention resolution algorithms , 1985, IEEE Trans. Inf. Theory.

[2]  Christian Floerkemeier,et al.  Comparison of transmission schemes for framed ALOHA based RFID protocols , 2006, International Symposium on Applications and the Internet Workshops (SAINTW'06).

[3]  Hyong-Woo Lee,et al.  An Enhanced RFID Multiple Access Protocol for Fast Inventory , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[4]  John Capetanakis,et al.  Tree algorithms for packet broadcast channels , 1979, IEEE Trans. Inf. Theory.

[5]  Hyoung-Nam Kim,et al.  Improvement of Anti-Collision Performance for the ISO 18000-6 Type B RFID System , 2006, IEICE Trans. Commun..

[6]  Masashi Shimizu,et al.  Framed ALOHA for Multiple RFID Objects Identification , 2005, IEICE Trans. Commun..

[7]  Hyong-Woo Lee,et al.  RFID MAC Performance Evaluation Based on ISO/IEC 18000-6 Type C , 2008, IEEE Communications Letters.

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