Interference cancellation-based RFID tags identification
Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
An extensive study of slotted Aloha-based RFID anti-collision protocols
Computer Communications
Continuous scanning with mobile reader in RFID systems: an experimental study
Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing
Informative counting: fine-grained batch authentication for large-scale RFID systems
Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing
Fast tag searching protocol for large-scale RFID systems
IEEE/ACM Transactions on Networking (TON)
An RFID anti-collision algorithm with dynamic condensation and ordering binary tree
Computer Communications
Hi-index | 0.00 |
One of the major challenges in the use of Radio Frequency-based Identification (RFID) on a large scale is the ability to read a large number of tags quickly. Central to solving this problem is resolving collisions that occur when multiple tags reply to the query of a reader. To this purpose, several MAC protocols for passive RFID systems have been proposed. These typically build on traditional MAC schemes, such as aloha and tree-based protocols. In this paper, we propose a new performance metric by which to judge these anticollision protocols: time system efficiency. This metric provides a direct measure of the time taken to read a group of tags. We then evaluate a set of well-known RFID MAC protocols in light of this metric. Based on the insights gained, we propose a new anticollision protocol, and show that it significantly outperforms previously proposed mechanisms.