Authors:
Chiu-Kuo Liang
and
Yuan-Cheng Chien
Affiliation:
Chung Hua University, Taiwan
Keyword(s):
Tag Anti-Collision, Hybrid Query Tree, Pre-Detection Query Tree.
Related
Ontology
Subjects/Areas/Topics:
Data Communication Networking
;
Enterprise Information Systems
;
Internet of Things
;
Sensor Networks
;
Software Agents and Internet Computing
;
Software and Architectures
;
Telecommunications
;
Ubiquitous Computing
;
Wireless Information Networks
Abstract:
One of the research areas in RFID systems is a tag anti-collision protocol; how to reduce identification time with a given number of tags in the field of an RFID reader. There are two types of tag anti-collision protocols for RFID systems: tree based algorithms and slotted aloha based algorithms. Many anti-collision algorithms have been proposed in recent years, especially in tree based protocols. However, there still have challenges on enhancing the system throughput and stability due to the underlying technologies had faced different limitation in system performance when network density is high. Particularly, the tree based protocols had faced the long identification delay. Recently, a Hybrid Hyper Query Tree (H2QT) protocol, which is a tree based approach, was proposed and aiming to speedup tag identification in large scale RFID systems. The main idea of H2QT is to track the tag response and try to predict the distribution of tag IDs in order to reduce collisions. In this paper, w
e propose a pre-detection tree based algorithm, called the Adaptive Pre-Detection Based Query Tree algorithm (APDBQT), to avoid those unnecessary queries. Our proposed APDBQT protocol can reduce not only the collisions but the idle cycles as well by using pre-detection mechanism. The simulation results show that our proposed technique provides superior performance in high density environments. It is shown that the APDBQT is effective in terms of increasing system throughput and minimizing identification delay.
(More)