Influence of Managing the Number of Tag Bits Transmitted on the Query Tree RFID Collision Resolution Protocol

Radio Frequency Identification (RFID) technology is increasingly becoming popular, for its widespread use and more sophisticated applications. The coexistence of tags sharing the communication channel requires solutions to message collisions, which degrade bandwidth, and increase the number of transmitted bits. A new methodology called ‘window’ is presented to manage the number of bits transmitted by a tag. The aim is show how the query tree (QT) protocol is influenced by this feature, and how the performance of the novel protocol, query window tree (QwT), improves when the tag ID distribution is correlated. Therefore, we have performed a fair comparison of the Query Tree and the new proposed QwT protocol for various tag ID distributions. Simulations show that the QwT positively decreases the total number of bits that are transmitted by tags.

[1]  Francesca Lonetti,et al.  Exploiting id knowledge for tag identification in rfid networks , 2007, PE-WASUN '07.

[2]  Woon-Young Yeo,et al.  Efficient anti-collision algorithm using variable length ID in RFID systems , 2010, IEICE Electron. Express.

[3]  Samuel Fosso Wamba,et al.  RFID deployment and use in the dairy value chain: Applications, current issues and future research directions , 2010, 2010 IEEE International Symposium on Technology and Society.

[4]  Yu Zeng,et al.  Binary Tree Slotted ALOHA for Passive RFID Tag Anticollision , 2013, IEEE Transactions on Parallel and Distributed Systems.

[5]  Jintao Li,et al.  ID-Binary Tree Stack Anticollision Algorithm for RFID , 2006, 11th IEEE Symposium on Computers and Communications (ISCC'06).

[6]  Kwan-Wu Chin,et al.  A Survey and Tutorial of RFID Anti-Collision Protocols , 2010, IEEE Communications Surveys & Tutorials.

[7]  Shun Watanabe.  国際会議参加報告:IEEE International Symposium on Information Theory , 2012 .

[8]  Francesca Lonetti,et al.  Tree slotted aloha: a new protocol for tag identification in RFID networks , 2006, 2006 International Symposium on a World of Wireless, Mobile and Multimedia Networks(WoWMoM'06).

[9]  Chen Qian,et al.  ASAP: Scalable Collision Arbitration for Large RFID Systems , 2013, IEEE Transactions on Parallel and Distributed Systems.

[10]  Anirudha Sahoo,et al.  Intelligent Query Tree (IQT) Protocol to Improve RFID Tag Read Efficiency , 2006, 9th International Conference on Information Technology (ICIT'06).

[11]  Cunqing Hua,et al.  Prefix-Randomized Query-Tree Protocol for RFID Systems , 2006, 2006 IEEE International Conference on Communications.

[12]  Vincent M. Stanford,et al.  Pervasive Computing Goes the Last 100 Feet with RFID Systems , 2003, IEEE Pervasive Comput..

[13]  Kai-Yeung Siu,et al.  MIT-AUTOID-TR-003 Ecient Memoryless Protocol for Tag Identication , 2000 .

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

[15]  Klaus Finkenzeller,et al.  Book Reviews: RFID Handbook: Fundamentals and Applications in Contactless Smart Cards and Identification, 2nd ed. , 2004, ACM Queue.

[16]  Francisco Falcone,et al.  IVAN: Intelligent Van for the Distribution of Pharmaceutical Drugs , 2012, Sensors.

[17]  Sung Hyun Kim,et al.  An Efficient Tree-Based Tag Anti-Collision Protocol for RFID Systems , 2007, IEEE Communications Letters.