Efficient Object Identification with Passive RFID Tags
Pervasive '02 Proceedings of the First International Conference on Pervasive Computing
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
Warehousing and Analyzing Massive RFID Data Sets
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Adaptive splitting protocols for RFID tag collision arbitration
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Adaptive binary splitting: a RFID tag collision arbitration protocol for tag identification
Mobile Networks and Applications
Collision avoidance in a dense RFID network
WiNTECH '06 Proceedings of the 1st international workshop on Wireless network testbeds, experimental evaluation & characterization
Adaptive cleaning for RFID data streams
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Mining compressed commodity workflows from massive RFID data sets
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Hybrid Tag Anti-collision Algorithms in RFID Systems
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007
THE ALOHA SYSTEM: another alternative for computer communications
AFIPS '70 (Fall) Proceedings of the November 17-19, 1970, fall joint computer conference
GPC'07 Proceedings of the 2nd international conference on Advances in grid and pervasive computing
Unified Q-ary tree for RFID tag anti-collision resolution
ADC '09 Proceedings of the Twentieth Australasian Conference on Australasian Database - Volume 92
Declarative support for sensor data cleaning
PERVASIVE'06 Proceedings of the 4th international conference on Pervasive Computing
Performance analysis of tag anti-collision algorithms for RFID systems
EUC'06 Proceedings of the 2006 international conference on Emerging Directions in Embedded and Ubiquitous Computing
| Hi-index | 0.00 |
Radio-Frequency Identification (RFID) systems consist of tags and networked electromagnetic readers. Despite the emergence of RFID technology, the problem of identifying multiple tags, due to the Collisions is still a major problem. The problem can be solved by using anti-collision methods such as ALOHA-based approaches and Tree-based approaches. ALOHA-based approaches suffer from tag starvation, which causes that not all tags can be identified. The tree-based approaches suffer from too long identification delay caused by lengthy queries during identification process. In this paper, we propose a tree-based anti-collision method called "Joined Q-ary Tree", which adaptively adjusts tree branches according to tag movement behavior and number of tags within an interrogation zone. In this empirical study, we demonstrate that the proposed method is suitable for numerous scenarios. It requires less queries issued per complete identification than existing approaches while ensuring identification of all tags within the interrogation zone.