Tag-Splitting: Adaptive Collision Arbitration Protocols for RFID Tag Identification
IEEE Transactions on Parallel and Distributed Systems
IEEE/ACM Transactions on Networking (TON)
Adaptive splitting and pre-signaling for RFID tag anti-collision
Computer Communications
A capture-aware access control method for enhanced RFID anti-collision performance
IEEE Communications Letters
Multiple feedback algorithm for RFID MAC protocols
IEEE Communications Letters
Energy-Aware Tag Anticollision Protocols for RFID Systems
IEEE Transactions on Mobile Computing
General binary tree protocol for coping with the capture effect in RFID tag identification
IEEE Communications Letters
FTTP: A fast tree traversal protocol for efficient tag identification in RFID networks
IEEE Communications Letters
Anticollision Protocols for Single-Reader RFID Systems: Temporal Analysis and Optimization
IEEE Transactions on Mobile Computing
An Adaptive Memoryless Protocol for RFID Tag Collision Arbitration
IEEE Transactions on Multimedia
Two Couple-Resolution Blocking Protocols on Adaptive Query Splitting for RFID Tag Identification
IEEE Transactions on Mobile Computing
An extensive study of slotted Aloha-based RFID anti-collision protocols
Computer Communications
Hi-index | 0.24 |
In many RFID applications, the reader repeatedly identifies the same staying tags. Existing anti-collision protocols can rapidly identify the staying tags by remembering the order in which the tags were recognized in the previous identification process. This paper proposes a novel protocol, dynamic blocking adaptive binary splitting (DBA), based on the blocking mechanism, which prevents the newly-arriving tags from colliding with the staying tags. Moreover, DBA utilizes a dynamic condensation technique to reduce the number of idle slots produced when recognized tags leave. Following the condensation process, multiple staying tags may be required to share the same slot, and thus may cause collisions among them. Accordingly, an efficient ordering binary tree mechanism is proposed to split the collided tags deterministically according to the order in which they were recognized. The analytical and simulation results show that DBA consistently outperforms previous algorithms in all of the considered environments.