Fast and reliable estimation schemes in RFID systems
Authors:
Top Cited Papers
Open Access
- 29 September 2006
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 322-333
Abstract
RFID tags are being used in many diverse applications in increasingly large numbers. These capabilities of these tags span from very dumb passive tags to smart active tags, with the cost of these tags correspondingly ranging from a few pennies to many dollars. One of the common problems that arise in any RFID deployment is the problem of quick estimation of the number of tags in the field up to a desired level of accuracy. Prior work in this area has focused on the identification of tags, which needs more time, and is unsuitable for many situations, especially where the tag set is dense. We take a different, more practical approach, and provide very fast and reliable estimation mechanisms. In particular, we analyze our estimation schemes and show that the time needed to estimate the number of tags in the system for a given accuracy is much better than schemes presented in related work. We show that one can estimate the cardinality of tag-sets of any size in near-constant time, for a given accuracy of estimation.Keywords
This publication has 23 references indexed in Scilit:
- An Introduction to RFID TechnologyIEEE Pervasive Computing, 2006
- Sift: A MAC Protocol for Event-Driven Wireless Sensor Networks2006
- Collision-Minimizing CSMA and Its Applications to Wireless Sensor NetworksIEEE Journal on Selected Areas in Communications, 2004
- Dynamic tuning of the IEEE 802.11 protocol to achieve a theoretical throughput limitIEEE/ACM Transactions on Networking, 2000
- Energy-conserving access protocols for identification networksIEEE/ACM Transactions on Networking, 1999
- A linear-time probabilistic counting algorithm for database applicationsACM Transactions on Database Systems, 1990
- An exact analysis and performance evaluation of framed ALOHA with captureIEEE Transactions on Communications, 1989
- Conflict multiplicity estimation and batch resolution algorithmsIEEE Transactions on Information Theory, 1988
- Estimating the multiplicities of conflicts to speed their resolution in multiple access channelsJournal of the ACM, 1987
- Dynamic Frame Length ALOHAIEEE Transactions on Communications, 1983