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
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
Wireless Personal Communications: An International Journal
Hi-index | 0.00 |
RFID, Radio Frequency Identification, technology is a contactless automatic identification technology about which a lot of researches and developments are recently progressing. For this RFID technology to be widely spread, the problem of multiple tag identification, which a reader identifies a multiple number of tags in a very short time, has to be solved. So far, several anti-collision algorithms are developed. And those can be largely divided into ALOHA based algorithm and tree based algorithm. In this paper, two new anti-collision algorithms combining the characteristics of these two categories are presented. And the performances of the two algorithms are simulated.