Probabilistic counting algorithms for data base applications
Journal of Computer and System Sciences
Efficient Object Identification with Passive RFID Tags
Pervasive '02 Proceedings of the First International Conference on Pervasive Computing
LANDMARC: indoor location sensing using active RFID
Wireless Networks - Special issue: Pervasive computing and communications
Novel Anti-collision Algorithms for Fast Object Identification in RFID System
ICPADS '05 Proceedings of the 11th International Conference on Parallel and Distributed Systems - Workshops - Volume 02
RFID Technology and Applications
IEEE Pervasive Computing
Fast and reliable estimation schemes in RFID systems
Proceedings of the 12th annual international conference on Mobile computing and networking
Cardinality Estimation for Large-scale RFID Systems
PERCOM '08 Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications
Performance of random medium access control, an asymptotic approach
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Efficient storage scheme and query processing for supply chain management using RFID
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Sherlock: automatically locating objects for humans
Proceedings of the 6th international conference on Mobile systems, applications, and services
Anonymous cardinality estimation in RFID systems with multiple readers
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Energy efficient algorithms for the RFID estimation problem
INFOCOM'10 Proceedings of the 29th conference on Information communications
Counting RFID tags efficiently and anonymously
INFOCOM'10 Proceedings of the 29th conference on Information communications
Informative counting: fine-grained batch authentication for large-scale RFID systems
Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing
Understanding RFID counting protocols
Proceedings of the 19th annual international conference on Mobile computing & networking
| Hi-index | 0.00 |
Radio Frequency Identification (RFID) systems have been widely deployed for various applications such as object tracking, 3D positioning, supply chain management, inventory control, and access control. This paper concerns the fundamental problem of estimating RFID tag population size, which is needed in many applications such as tag identification, warehouse monitoring, and privacy sensitive RFID systems. In this paper, we propose a new scheme for estimating tag population size called Average Run based Tag estimation (ART). The technique is based on the average run-length of ones in the bit string received using the standardized framed slotted Aloha protocol. ART is significantly faster than prior schemes because its estimator has smaller variance compared to the variances of estimators of prior schemes. For example, given a required confidence interval of 0.1% and a required reliability of 99.9%, ART is consistently 7 times faster than the fastest existing schemes (UPE and EZB) for any tag population size. Furthermore, ART's estimation time is observably independent of the tag population sizes. ART is easy to deploy because it neither requires modification to tags nor to the communication protocol between tags and readers. ART only needs to be implemented on readers as a software module. ART works with multiple readers with overlapping regions.