PET: Probabilistic Estimating Tree for Large-Scale RFID Estimation

Zheng, Yuanqing; Li, Zhenjiang

doi:10.1109/tmc.2011.238

Cited by 64 publications

(38 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Consistent with the existing approaches [11,16,27], the accuracy requirement is presented by (ε,δ)-approximation. We denote byn the estimated number of the tag cardinality while the actual number is n. Given the accuracy requirement of (ε,δ)-approximation, we expect an estimation resultn, which satisfies Pr{|n − n| ≤ εn} ≥ 1 − δ.…”

Section: B Problem Descriptionmentioning

confidence: 85%

“…Both approaches require the tags to cooperate with the reader by generating large volume of random numbers and respond accordingly. One most recent protocol, Probabilistic Estimating Tree (PET) based estimator [27], advances the estimation efficiency and achieves O(log log n) processing time efficiency to the tag cardinality n. Such approaches only consider an ideal wireless channel which is free of transmission error.…”

Section: Related Workmentioning

confidence: 99%

“…Most recent approaches only need to distinguish an idle slot from a busy slot [11,16,27]. The smaller number of time slots means the shorter processing time and thus the higher time efficiency, and vice versa.…”

Section: B Problem Descriptionmentioning

confidence: 99%

“…The RFID reader normally needs to examine the state of each time slot in the frame. Figure 1(a) presents illustrative examples of most recent protocols, e.g., FNEB [11], LoF [16], and PET [27]. In FNEB, each tag randomly selects a slot from O(n) slots with uniform distribution functions to send a response in each estimation round.…”

Section: A Principlementioning

confidence: 99%

“…Some recent approaches achieve O(log n) estimation efficiency to the number of RFID tags n [11,16]. One most recent protocol, Probabilistic Estimation Tree (PET), achieves O(log log n) time efficiency for each estimation round [27]. Nevertheless, existing protocols require many independent estimation rounds so as to achieve high accuracy on the estimation results.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

ZOE: Fast cardinality estimation for large-scale RFID systems

Zheng

2013

2013 Proceedings IEEE INFOCOM

Self Cite

View full text Add to dashboard Cite

Abstract-Estimating the RFID cardinality with accuracy guarantee is an important task in large-scale RFID systems. This paper proposes a fast RFID cardinality estimation scheme. The proposed Zero-One Estimator (ZOE) protocol rapidly converges to optimal parameter settings and achieves high estimation efficiency. ZOE significantly improves the cardinality estimation efficiency, achieving 3x performance gain compared with existing protocols. Meanwhile, ZOE guarantees arbitrary accuracy requirement without imposing computation and memory overhead at RFID tags. Due to the simplicity and robustness, the ZOE protocol provides reliable cardinality estimation even over noisy channel. We implement a prototype system using the USRP software defined radio and Intel WISP RFID tags. We also evaluate the performance of ZOE with extensive simulations. The evaluation of ZOE shows encouraging results in terms of estimation accuracy, time efficiency, as well as robustness.

show abstract

Section: B Problem Descriptionmentioning

confidence: 85%

Section: Related Workmentioning

confidence: 99%

Section: B Problem Descriptionmentioning

confidence: 99%

Section: A Principlementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

ZOE: Fast cardinality estimation for large-scale RFID systems

Zheng

2013

2013 Proceedings IEEE INFOCOM

Self Cite

View full text Add to dashboard Cite

show abstract

A scale‐independent way for differential estimation in dynamic radio frequency identification systems

Yang

Huang

et al. 2015

Int J Communication

View full text Add to dashboard Cite

Cardinality estimation in radio frequency identification systems has been applied to estimate the population of tags in many applications. However, it is more meaningful to estimate the number of tags moved in and out in a dynamic radio frequency identification system, which is called differential estimation problem. Zero differential estimator is a newly proposed algorithm to solve this problem. However, the time slots consumed by zero differential estimator are relevant to the system scale under the accuracy constraint. This will result in low time efficiency when the system scale is very large. In this paper, we thus propose a scaleindependent algorithm for differential estimation called zero-one differential estimator. The numbers of tags moved in and out are estimated from the idle slots in two consecutive frames. We can prove that the time slots consumed in our proposed algorithm are not relevant to the system scale under the accuracy constraint. Moreover, we conduct abundant simulations to evaluate the performance of the proposed approach. The simulation results show that the estimation error grows little as the system scale grows. It indicates that our proposed algorithm is indeed scale-independent.

show abstract

Focus and Shoot: Efficient Identification Over RFID Tags in the Specified Area

Yin

Xie

et al. 2014

Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

View full text Add to dashboard Cite

Abstract. In RFID systems, the reader usually identifies all the RFID tags in the interrogation region with the maximum power. However, some applications may only need to identify the tags in a specified area, which is usually smaller than the reader's default interrogation region. In this paper, we respectively present two solutions to identify the tags in the specified area. The principle of the solutions can be compared to the picture-taking process of a camera. It first focuses on the specified area and then shoots the tags. The design of the two solutions is based on the extensive empirical study on RFID tags. Realistic experiment results show that our solutions can reduce the execution time by 46% compared to the baseline solution.

show abstract

PET: Probabilistic Estimating Tree for Large-Scale RFID Estimation

Cited by 64 publications

References 34 publications

ZOE: Fast cardinality estimation for large-scale RFID systems

ZOE: Fast cardinality estimation for large-scale RFID systems

A scale‐independent way for differential estimation in dynamic radio frequency identification systems

Focus and Shoot: Efficient Identification Over RFID Tags in the Specified Area

Contact Info

Product

Resources

About