DMCA
PET: Probabilistic Estimating Tree for Large-Scale RFID Estimation
Cached
Download Links
| Citations: | 22 - 9 self |
BibTeX
@MISC{Zheng_pet:probabilistic,
author = {Yuanqing Zheng and Mo Li and Chen Qian},
title = {PET: Probabilistic Estimating Tree for Large-Scale RFID Estimation},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract—Estimating the number of RFID tags in the region of interest is an important task in many RFID applications. In this paper we propose a novel approach for efficiently estimating the approximate number of RFID tags. Compared with existing approaches, the proposed Probabilistic Estimating Tree (PET) protocol achieves O(loglogn) estimation efficiency, which remarkably reduces the estimation time while meeting the accuracy requirement. PET also largely reduces the computation and memory overhead at RFID tags. As a result, we are able to apply PET with passive RFID tags and provide scalable and inexpensive solutions for large-scale RFID systems. We validate the efficacy and effectiveness of PET through theoretical analysis as well as extensive simulations. Our results suggest that PET outperforms existing approaches in terms of estimation accuracy, efficiency, and overhead. Keywords-Probabilistic estimating tree; Probabilistic algorithm; RFID counting system. I.
Keyphrases
probabilistic estimating tree rfid tag large-scale rfid estimation important task memory overhead protocol achieves accuracy requirement many rfid application large-scale rfid system approximate number novel approach estimation accuracy passive rfid tag estimation efficiency theoretical analysis rfid counting system probabilistic algorithm extensive simulation inexpensive solution estimation time
