A Hybrid Query Tree Protocol for Tag Collision Arbitration in RFID systems

Ryu, Ji Yoon; Lee, Ho-Jin; Seok, Yongho; Kwon, Taekyoung; Choi, Yanghee

doi:10.1109/icc.2007.991

Cited by 79 publications

(43 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The QT algorithm is simple in the sense that it does not demand the tags and the readers to have extra capabilities. In contrast, other protocols may require the tags to be able to detect collision [], or the readers to measure timing of the colliding responses from tags [7]. But the Sidewalk protocol does not require of the tags and the readers more than the QT algorithm does.…”

Section: Sidewalkmentioning

confidence: 99%

“…The strength of the aloha-based protocols is that it is fast when the number of tags to read is small. However, due to the probabilistic nature it can cause so called the tag starvation problem, and could experience significant performance degradation on large amount of tags [7]. In contrast, the tree-based protocols need to traverse the entire tree space of tag IDs, so can incur relatively long delay.…”

Section: Introductionmentioning

confidence: 99%

“…Ryu et al improves on both the initial read cycle and AQS [7]. Unlike the QT algorithm, when collision occurs this scheme splits the prefix using the 4-ary tree.…”

Section: Performance Evaluationmentioning

confidence: 99%

“…The RFID tag collision is an extensively studied problem [1]- [9]. The solution approaches can be classified into two types: tree-based protocols [1]- [7] and aloha-based protocols [8], [9]. The strength of the aloha-based protocols is that it is fast when the number of tags to read is small.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Sidewalk: A RFID Tag Anti-Collision Algorithm Exploiting Sequential Arrangements of Tags

Koh¹,

Yun²,

Kim³

2008

2008 IEEE International Conference on Communications

View full text Add to dashboard Cite

Abstract-Although predicting the RFID tag distribution before a read cycle begins would be generally difficult and even futile, a likely and interesting scenario is where the tags have a sequential arrangement. In large-scale applications such as supply chain management, for instance, hundreds or thousands of the same type of product made by the same manufacturer can be stacked together in the stock. In this paper, we propose a simple RFID tag anti-collision algorithm that exploits such sequential structure of the given tag space to achieve a higher read efficiency. The proposed algorithm is also designed to still achieve the level of performance comparable to that of existing algorithms if tags exhibit little sequential structure. Through exhaustive simulations over various tag distributions, we demonstrate that the proposed algorithm achieves at least 10% improvement even in the worst case (i.e., when tags are completely randomly distributed), but yields significantly higher improvement when the number of tags and/or the correlation increases.

show abstract

Section: Sidewalkmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

“…Ryu et al improves on both the initial read cycle and AQS [7]. Unlike the QT algorithm, when collision occurs this scheme splits the prefix using the 4-ary tree.…”

Section: Performance Evaluationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Sidewalk: A RFID Tag Anti-Collision Algorithm Exploiting Sequential Arrangements of Tags

Koh¹,

Yun²,

Kim³

2008

2008 IEEE International Conference on Communications

View full text Add to dashboard Cite

show abstract

“…The deterministic method operates by asking for the first EPC string of the tag until it gets matches for the tags, it will then continues to ask for additional characters until all tags within the region are found. There have been several methods proposed in literature in order to improved quality of the captured data such as: the Query Tree (Myung & Lee, 2006a); the Adaptive Splitting Tree (Myung & Lee, 2006b); the Hybrid Query Tree (Ryu et al, 2007); and the Joined Q-ary Tree (Pupunwiwat & Stantic, 2009), (Pupunwiwat & Stantic, 2010c). Tan, Sheng and Li have proposed in their research the utilisation of a threshold to identify an excessive amount of missing RFID readings .…”

Section: Middleware Approachesmentioning

confidence: 99%