2013
DOI: 10.1109/tmc.2012.176
|View full text |Cite
|
Sign up to set email alerts
|

A Novel Query Tree Protocol with Bit Tracking in RFID Tag Identification

Abstract: Tag anticollision has long been an important issue in RFID systems. To accelerate tag identification, some researchers have recently adopted bit tracking technology that allows the reader to detect the locations of collided bits in a collision slot. However, these methods still encounter the problem of too many collisions occurring at the beginning of identification. This paper proposes an optimal query tracking tree protocol (OQTT) that tries to separate all of the tags into smaller sets to reduce collisions … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
50
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
5
2
2

Relationship

0
9

Authors

Journals

citations
Cited by 70 publications
(50 citation statements)
references
References 28 publications
(33 reference statements)
0
50
0
Order By: Relevance
“…The Optimal Query Tracking Tree protocol (OQTT) divides all of the tags in the interrogation area into small tag sets in order to reduce the number of collisions at the beginning of the identification process [58]. This protocol uses three main approaches: bit estimation, an optimal partition, and a query tracking tree.…”
Section: Optimal Query Tracking Tree Protocolmentioning
confidence: 99%
See 1 more Smart Citation
“…The Optimal Query Tracking Tree protocol (OQTT) divides all of the tags in the interrogation area into small tag sets in order to reduce the number of collisions at the beginning of the identification process [58]. This protocol uses three main approaches: bit estimation, an optimal partition, and a query tracking tree.…”
Section: Optimal Query Tracking Tree Protocolmentioning
confidence: 99%
“…The estimation error however is negligible, only producing an imperceptible difference in the final result of the number of queries. According to the literature, e.g., [58], this protocol provides an efficiency of approximately 0.614 and is one of the most efficient anti-collision protocols for tag identification. Although the slot efficiency obtained by OQTT is very high, the preprocessing increases the energy consumption of the protocol, especially in dense tag environments [58].…”
Section: Optimal Query Tracking Tree Protocolmentioning
confidence: 99%
“…The tag anti-collision algorithms in the literature are mainly based on the Time-Division-Multiple-Access (TDMA) technology, which can be divided into two categories: tree-based algorithms [2,3,14,24,25] and ALOHA-based algorithms [4][5][6][7][8].…”
Section: Related Workmentioning
confidence: 99%
“…An approach to avoid collision is by using tree-based anti-collision approach [12]. Among the popular approach are Binary Tree (BT) protocol [13] and Query Tree (QT) [14]. The approach works by matching the tag ID bitwise where the tag can be read one by one.…”
Section: Introductionmentioning
confidence: 99%