Fast and reliable estimation schemes in RFID systems

  • Authors:
  • Murali Kodialam;Thyaga Nandagopal

  • Affiliations:
  • Lucent Technologies;Lucent Technologies

  • Venue:
  • Proceedings of the 12th annual international conference on Mobile computing and networking
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

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.