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
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
Comptia Rfid+ Certification
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
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
| Hi-index | 0.00 |
Radio Frequency Identification (RFID) technology uses radio-frequency waves to automatically identify people or objects. A large volume of data, resulting from the fast capturing RFID readers and a huge number of tags, poses challenges for data management. This is particularly the case when a reader simultaneously reads multiple tags and Radio Frequency (RF) collisions occur, causing RF signals to interfere with each other and therefore preventing the reader from identifying all tags. This problem is known as Missed reads, which can be solved by using anti-collision techniques to prevent two or more tags from responding to a reader at the same time. The current probabilistic anti-collision methods are suffering from Tag starvation problems so not all tags can be identified, while the deterministic methods suffer from too long Identification delay. In this paper, a "Unified Q-ary Tree Protocols" based on Query tree is presented. In empirical study compared with the Query tree and 4-ary tree, we show that the proposed method performs better, it requires less number of queries per complete identification, which results in less total identification time.