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
The blocker tag: selective blocking of RFID tags for consumer privacy
Proceedings of the 10th ACM conference on Computer and communications security
Joined Q-ary tree anti-collision for massive tag movement distribution
ACSC '10 Proceedings of the Thirty-Third Australasian Conferenc on Computer Science - Volume 102
Dynamic framed-slot ALOHA anti-collision using precise tag estimation scheme
ADC '10 Proceedings of the Twenty-First Australasian Conference on Database Technologies - Volume 104
Unified Q-ary tree for RFID tag anti-collision resolution
ADC '09 Proceedings of the Twentieth Australasian Conference on Australasian Database - Volume 92
Classifying RFID attacks and defenses
Information Systems Frontiers
Hi-index | 0.00 |
Lately, the ISO fixed on UHF Gen2 as one of the standard protocols for RFID, called ISO 18000-6 C, along with ISO 18000-6 A/B. It means that the RFID system should provide the multi-protocol support for tag identification and a proper protocol should be chosen depending on the situation. The tag anti-collision algorithm is one of the important research issues to be on top of the protocol’s performance. This paper introduces several anti-collision algorithms for tag identification in the literature and presents the performance comparison and evaluation of those algorithms based on the 96-bit EPCTM (Electronic Product CodeTM). The performance results show that the collision tracking tree algorithm is found to have the highest performance than any other anti-collision algorithm, identifying 749 tags per second.