The Height and Size of Random Hash Trees and Random Pebbled Hash Trees
SIAM Journal on Computing
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
Efficient Object Identification with Passive RFID Tags
Pervasive '02 Proceedings of the First International Conference on Pervasive Computing
RFID Handbook: Fundamentals and Applications in Contactless Smart Cards and Identification
RFID Handbook: Fundamentals and Applications in Contactless Smart Cards and Identification
Proceedings of the 2004 international symposium on Low power electronics and design
An Enhanced Dynamic Framed Slotted ALOHA Algorithm for RFID Tag Identification
MOBIQUITOUS '05 Proceedings of the The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services
Tree algorithms for packet broadcast channels
IEEE Transactions on Information Theory
Dynamic tag estimation for optimizing tree slotted aloha in RFID networks
Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
REACT: An RFID-based privacy-preserving children tracking scheme for large amusement parks
Computer Networks: The International Journal of Computer and Telecommunications Networking
An efficient anti-collision protocol for RFID tag identification
IEEE Communications Letters
Interference cancellation-based RFID tags identification
Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
RFID reader collision problem: performance analysis and medium access
Wireless Communications & Mobile Computing
Hi-index | 0.00 |
In this paper, we approach the problem of identifying a set of objects in an RFID network. We propose a modified version of Slotted Aloha protocol to reduce the number of transmission collisions. All tags select a slot to transmit their ID by generating a random number. If there is a collision in a slot, the reader broadcasts the next identification request only to tags which collided in that slot. Besides, we present an extensive comparative evaluation of collision resolution protocols for tag identification problem in RFID networks. After a quick survey of the best performing RFID tag identification protocols, both deterministic and probabilistic, we present the outcome of intensive simulation experiments set up to evaluate several metrics, such as the total delay of identification process and the bit complexity of reader and tags. The last metric is strictly related to energy constraints required by an RFID system. The experiments point out that our protocol outperform all the other protocols in most cases, and matches them in the others.