Parallel Response Query Tree Splitting for RFID Tag Anti-collision

Yeh, Ming-Kuei; Jiang, Jehn-Ruey; Huang, Shing-Tsaan

doi:10.1109/icppw.2011.62

Cited by 7 publications

(7 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Treebased algorithms [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], such as binary tree protocol (BT) and query tree protocol (QT), repeatedly separate collided tags into two subsets until each set has only one tag or no tag. QT uses tag IDs while BT adopts random binary numbers to split the tag set.…”

Section: Introductionmentioning

confidence: 99%

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

Lai

Hsiao

Chen

et al. 2013

IEEE Trans. on Mobile Comput.

View full text Add to dashboard Cite

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 at the beginning of identification. Using bit tracking technology, OQTT mainly adopts three proposed approaches, bit estimation, optimal partition, and query tracking tree. Bit estimation first estimates the number of tags based on the locations of collided bits. Optimal partition then determines the optimal number of the initial sets based on this estimation. Query tracking tree splits a set of collided tags into two subsets using the first collided bit in the tag IDs. This paper analyzes the efficiency of OQTT, which represents how many tags can be identified in a slot. Results show that its efficiency is close to 0.614, the highest efficiency published to date. The simulation results further show that OQTT outperforms other existing algorithms.

show abstract

Section: Introductionmentioning

confidence: 99%

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

Lai

Hsiao

Chen

et al. 2013

IEEE Trans. on Mobile Comput.

View full text Add to dashboard Cite

show abstract

“…Recently, Yeh et al [15] proposed a parallel response query tree scheme that combines the frequency shift keying (FSK) modulation and Manchester coding to provide two subcarriers for tags communicating with reader in parallel. In this paper we adopt the parallel subcarriers of Yeh's protocol and the optimal performance of TQT protocol to design a parallel response ternary query tree (PRTQT) protocol.…”

Section: Introductionmentioning

confidence: 99%

Parallel Response Ternary Query Tree for RFID Tag Anti-Collision

Yang

Cai²,

Sun³

2015

JCC

View full text Add to dashboard Cite

A tag-collision (or missed reads) in RFID system (Radio Frequency Identification) system degrades the identification efficiency. The so-called tag collision is that a reader cannot identify a tag when more than one tags respond to a reader at the same time. There are some major anti-collision protocols on resolving tag collision, e.g., ALOHA-based protocol, binary tree protocol, and Query Tree (QT) protocol. Up to date, most tag anti-collision protocols are QT protocols. QT protocols are categorized into M-ary query tree (QT). In the previous literature, choosing M = 3 (i.e., a ternary QT (TQT)) was proven to have the optimum performance for tag identification. Recently, Yeh et al. used parallel response approach to reduce the number of collisions. In this paper, we combine the partial response and TQT to propose an effective parallel response TQT (PRTQT) protocol. Simulation results reveal that our PRTQT outperforms Yeh et al.'s protocol and TQT protocol.

show abstract

“…One of the main features of tree-based protocols is that they are deterministic, since ideally, they are designed to identify the whole set of tags in the interrogation area [36][37][38][39][40]. These protocols have simple design tags and work very well with a uniform set of tags.…”

Section: Tree-based Protocolsmentioning

confidence: 99%

A Comparison of RFID Anti-Collision Protocols for Tag Identification

2018

View full text Add to dashboard Cite

Radio Frequency Identification (RFID) is a technology that uses radio frequency signals to identify objects. RFID is one of the key technologies used by the Internet of Things (IoT). This technology enables communication between the main devices used in RFID, the reader and the tags. The tags share a communication channel. Therefore, if several tags attempt to send information at the same time, the reader will be unable to distinguish these signals. This is called the tag collision problem. This results in an increased time necessary for system identification and energy consumption. To minimize tag collisions, RFID readers must use an anti-collision protocol. Different types of anti-collision protocols have been proposed in the literature in order to solve this problem. This paper provides an update including some of the most relevant anti-collision protocols.

show abstract

Parallel Response Query Tree Splitting for RFID Tag Anti-collision

Cited by 7 publications

References 10 publications

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

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

Parallel Response Ternary Query Tree for RFID Tag Anti-Collision

A Comparison of RFID Anti-Collision Protocols for Tag Identification

Contact Info

Product

Resources

About