Smart Trend-Traversal: A Low Delay and Energy Tag Arbitration Protocol for Large RFID Systems

Pan, Lei; Wu, Hongyi

doi:10.1109/infcom.2009.5062189

Cited by 59 publications

(29 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The key limitation of TW based protocols is that they visit a large number of collision nodes in the binary tree. Although several heuristics have been proposed to reduce the number of visits to collision nodes [15,19], all these heuristics based methods are not guaranteed to minimize such futile visits. Prior Aloha-TW hybrid protocols also have this limitation.…”

Section: Summary and Limitations Of Prior Artmentioning

confidence: 99%

See 1 more Smart Citation

Probabilistic optimal tree hopping for RFID identification

Shahzad

Liu

2013

Proceedings of the ACM SIGMETRICS/international Conference on Measurement and Modeling of Computer Systems

View full text Add to dashboard Cite

Radio Frequency Identification (RFID) systems are widely used in various applications such as supply chain management, inventory control, and object tracking. Identifying RFID tags in a given tag population is the most fundamental operation in RFID systems. While the Tree Walking (TW) protocol has become the industrial standard for identifying RFID tags, little is known about the mathematical nature of this protocol and only some ad-hoc heuristics exist for optimizing it. In this paper, first, we analytically model the TW protocol, and then using that model, propose the Tree Hopping (TH) protocol that optimizes TW both theoretically and practically. The key novelty of TH is to formulate tag identification as an optimization problem and find the optimal solution that ensures the minimal average number of queries. With this solid theoretical underpinning, for different tag population sizes ranging from 100 to 100K tags, TH significantly outperforms the best prior tag identification protocols on the metrics of the total number of queries per tag, the total identification time per tag, and the average number of responses per tag by an average of 50%, 10%, and 30%, respectively, when tag IDs are uniformly distributed in the ID space, and of 26%, 37%, and 26%, respectively, when tag IDs are non-uniformly distributed.

show abstract

Section: Summary and Limitations Of Prior Artmentioning

confidence: 99%

“…There are 3 such protocols: (1) the basic TW protocol [12], (2) the Adaptive Tree Walking (ATW) protocol [24], and (3) the TW-based Smart Trend Traversal (STT) protocol [19]. ATW is an optimized version of TW that always starts DFTs from the level of log z, where z is the size of tag population.…”

Section: Deterministic Identification Protocolsmentioning

confidence: 99%

Probabilistic optimal tree hopping for RFID identification

Shahzad

Liu

2013

Proceedings of the ACM SIGMETRICS/international Conference on Measurement and Modeling of Computer Systems

View full text Add to dashboard Cite

show abstract

“…The QT splits a tag set by tag IDs [9][10][11][12][13][14]. The reader owns a queue Q, which stores bit strings of the queries and is initialized with two 1-bit strings, 0 and 1, at the beginning of each frame.…”

Section: Qtmentioning

confidence: 99%

“…Tree-based protocols, which continuously split a set of tags into two subsets until all tags are identified, can be classified as query tree (QT) protocols [9][10][11][12][13][14] and binary tree (BT) protocols [15][16][17][18]. The former uses tag IDs while the latter adopts random binary numbers to split the set of collided tags.…”

Section: Introductionmentioning

confidence: 99%

A semi-blocking algorithm on adaptive query splitting for RFID tag identification

Lai

Lin

Lee

2013

J Wireless Com Network

View full text Add to dashboard Cite

Radio frequency identification (RFID) is a promising wireless technology for using tiny, remotely powered chips as identifiers. The number of RFID applications is rapidly increasing because RFID technology is convenient, fast, and contactless. However, collisions occur when multiple tags simultaneously transmit their IDs. Therefore, an efficient anti-collision algorithm is needed to accelerate tag identification. In some applications, the reader may repeatedly identify staying tags, which constantly exist in the reader's range. The adaptive query splitting algorithm (AQS) was proposed for reserving information obtained from the last identification process to enable rapid re-identification of staying tags. However, since AQS is a non-blocking algorithm that allows newly arriving tags to use the slots reserved for staying tags, collisions among them are problematic. Thus, semi-blocking AQS (SBA) proposed in this study is designed to reduce the collisions between arriving tags and staying tags by applying a semi-blocking technique in which only a minority of arriving tags use the slots reserved for staying tags. By counting the number of minor arriving tags, SBA estimates the number of unrecognized arriving tags and generates proper queries to minimize their collisions. The identification delay of SBA is analyzed, and simulation results show that SBA significantly outperforms AQS.

show abstract

“…Tree-based protocols resolve collisions by muting subsets of tags that are involved in a collision [7]. Pan et al propose a Smart Trend-Traversal protocol [8], a Query Tree-based scheme, to conduct RFID tag arbitration. The ALOHA protocol was first developed for random access in packet radio networks.…”

Section: Related Workmentioning

confidence: 99%

Efficient Tag Identification in Mobile RFID Systems

Xie

Sheng

Tan

et al. 2010

2010 Proceedings IEEE INFOCOM

View full text Add to dashboard Cite

Abstract-In this paper we consider how to efficiently identify tags on the moving conveyor. Considering conditions like the path loss and multi-path effect in realistic settings, we first propose a probabilistic model for RFID tag identification. Based on this model, we propose efficient solutions to identify moving RFID tags, according to the fixed-path mobility on the conveyor. A dynamic program based solution and an adaptive solution are proposed to select optimized frame sizes during the query cycles. Simulation results indicate that by leveraging the probabilistic model our solutions can achieve much better performance than using parameters for the ideal propagation situations.

show abstract

Smart Trend-Traversal: A Low Delay and Energy Tag Arbitration Protocol for Large RFID Systems

Cited by 59 publications

References 9 publications

Probabilistic optimal tree hopping for RFID identification

Probabilistic optimal tree hopping for RFID identification

A semi-blocking algorithm on adaptive query splitting for RFID tag identification

Efficient Tag Identification in Mobile RFID Systems

Contact Info

Product

Resources

About