Efficient memoryless protocol for tag identification (extended abstract)
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
Proceedings of the 2004 international symposium on Low power electronics and design
HiQ: A Hierarchical Q-Learning Algorithm to Solve the Reader Collision Problem
SAINT-W '06 Proceedings of the International Symposium on Applications on Internet Workshops
An anti-collision algorithm using two-functioned estimation for RFID tags
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
Hi-index | 0.00 |
The Reader Collision Problem (RCP) is a bottle-neck decreasing the reading efficiency in multiple-reader RFID systems. This paper proposed a novel anti-collision protocol - DRA (Distributed Reservation-based Anti-collision) protocol to solve the RCP in multiple-reader RFID systems. Temporal Cluster Headers (TCHs) are dynamically selected among the potentially interfered readers in DRA protocol. The selected TCHs coordinate the communication sequence of all the slave readers within their control range and enable a collision-free reading procedure among all the readers. Both analytical and simulation results show that DRA protocol dramatically out-performs the existing RCP protocols in both reading efficiency and power consumption. Moreover, DRA protocol can be easily extended and applied in general wireless sensor networks.