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
Intelligent Query Tree (IQT) Protocol to Improve RFID Tag Read Efficiency
ICIT '06 Proceedings of the 9th International Conference on Information Technology
An Adaptive Memoryless Protocol for RFID Tag Collision Arbitration
IEEE Transactions on Multimedia
Key issues of RFID reader network system
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
General binary tree protocol for coping with the capture effect in RFID tag identification
IEEE Communications Letters
| Hi-index | 0.00 |
The Query Tree Protocol (QT) in [1] is an efficient RFID tag singulation algorithm that is guaranteed to read all the tags in the broadcast range of a reader. However, QT ignores the capture effect. That is, after the reader broadcasts a bit string query prefix, it is assumed that it can distinguish one of three responses, namely {no response, one response, collision}. If the capture effect is modeled, QT would no longer be guaranteed to singulate all the tags in the reader's range, since "capturing" a tag ID in the midst of a collision would leave all the other tags in that collision unsingulated. In this paper, we introduce two modifications to QT that always singulate all the tags even when the capture effect is considered. We call these the Generalized Query Tree Protocols (GQT1, GQT2). We provide analytical bounds and simulation results of the singulation times of these new protocols in relation to QT.