A novel approach for ID distribution problem in Tree-based tag anti-collision protocols of RFID systems

Tag collision is one of the most important issues in RFID systems and many tag anti-collision protocols were proposed in literature. But some kind of these protocols like Tree-based protocols (specifically Query tree) which its performance depends on tag ID length and construction, have some issues like ID distribution. In this paper we discuss about Query tree protocol which may influenced by ID distribution. Then we propose a novel type of this protocol called Informatics Query tree to solve it. Then we evaluate the performance of presented protocol to approve its benefits.

[1]  Kai-Yeung Siu,et al.  Efficient memoryless protocol for tag identification (extended abstract) , 2000, DIALM '00.

[2]  Chen Peng.  Design of Tag Anti-collision Algorithm , 2008 .

[3]  Wonjun Lee,et al.  Adaptive splitting protocols for RFID tag collision arbitration , 2006, MobiHoc '06.

[4]  Chae-Woo Lee,et al.  An enhanced dynamic framed slotted ALOHA algorithm for RFID tag identification , 2005, The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services.

[5]  A. Goldsmith.  Communication by Means of Reflected Power , 2022 .

[6]  Aylin Yener,et al.  ASAP : A MAC Protocol for Dense and Time Constrained RFID Systems , 2006, ICC.

[7]  Minos N. Garofalakis,et al.  An adaptive RFID middleware for supporting metaphysical data independence , 2008, The VLDB Journal.

[8]  George Roussos.  Networked RFID - Systems, Software and Services , 2008, Computer Communications and Networks.

[9]  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).

[10]  Jehn-Ruey Jiang,et al.  Adaptive k-Way Splitting and Pre-Signaling for RFID Tag Anti-Collision , 2007, IECON 2007 - 33rd Annual Conference of the IEEE Industrial Electronics Society.