Fast and reliable estimation schemes in RFID systems

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.

[1]  신형철,et al.  고속 무선 근거리 통신망 채널접근제어 프로토콜 성능분석 ( Performance Analysis of HIPERLAN Channel Access Control Protocol ) , 1999 .

[2]  Klaus Finkenzeller,et al.  RFID Handbook: Radio-Frequency Identification Fundamentals and Applications , 2000 .

[3]  Jae-Hyun Kim,et al.  Fast wireless anti-collision algorithm in ubiquitous ID system , 2004, IEEE 60th Vehicular Technology Conference, 2004. VTC2004-Fall. 2004.

[4]  Y. C. Tay,et al.  Sift: A MAC Protocol for Event-Driven Wireless Sensor Networks , 2006, EWSN.

[5]  Calyampudi Radhakrishna Rao,et al.  Linear Statistical Inference and its Applications , 1967 .

[6]  Daniel W. Engels,et al.  The reader collision problem , 2002, IEEE International Conference on Systems, Man and Cybernetics.

[7]  Wonjun Lee,et al.  An Adaptive Memoryless Tag Anti-Collision Protocol for RFID Networks * , 2005 .

[8]  Valerie M. Thomas,et al.  Optimization of inductive RFID technology , 2001, Proceedings of the 2001 IEEE International Symposium on Electronics and the Environment. 2001 IEEE ISEE (Cat. No.01CH37190).

[9]  Masashi Shimizu,et al.  To read transmitter-only RFID tags with confidence , 2004, 2004 IEEE 15th International Symposium on Personal, Indoor and Mobile Radio Communications (IEEE Cat. No.04TH8754).

[10]  Masashi Shimizu,et al.  Framed ALOHA for Multiple RFID Objects Identification , 2005, IEICE Trans. Commun..

[11]  W. Feller,et al.  An Introduction to Probability Theory and Its Applications, Vol. 1 , 1967 .

[12]  Harald Vogt,et al.  Efficient Object Identification with Passive RFID Tags , 2002, Pervasive.

[13]  Frank H. P. Fitzek,et al.  Batch conflict resolution algorithm with progressively accurate multiplicity estimation , 2004, DIALM-POMC '04.

[14]  Samir Chatterjee,et al.  A Taxonomy for RFID , 2006, Proceedings of the 39th Annual Hawaii International Conference on System Sciences (HICSS'06).

[15]  Kai-Yeung Siu,et al.  Efficient memoryless protocol for tag identification (extended abstract) , 2000, DIALM '00.

[16]  Jong-Kyu Lee,et al.  Performance Analysis of the HIPERLAN Channel Access Control Protocol , 1999 .

[17]  Chae-Woo Lee,et al.  An enhanced dynamic framed slotted ALOHA algorithm for RFID tag identification , 2005, The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services.

[18]  Luc André Burdet.  RFID Multiple Access Methods , 2004 .

[19]  Kyu-Young Whang,et al.  A linear-time probabilistic counting algorithm for database applications , 1990, TODS.

[20]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

[21]  Wonjun Lee,et al.  An Adaptive Memoryless Protocol for RFID Tag Collision Arbitration , 2006, IEEE Transactions on Multimedia.

[22]  Anthony Ephremides,et al.  An exact analysis and performance evaluation of framed ALOHA with capture , 1989, IEEE Trans. Commun..

[23]  Marco Conti,et al.  Dynamic tuning of the IEEE 802.11 protocol to achieve a theoretical throughput limit , 2000, TNET.

[24]  Leonid Bolotnyy,et al.  Randomized pseudo-random function tree walking algorithm for secure radio-frequency identification , 2005, Fourth IEEE Workshop on Automatic Identification Advanced Technologies (AutoID'05).

[25]  Y. C. Tay,et al.  Collision-minimizing CSMA and its applications to wireless sensor networks , 2004, IEEE Journal on Selected Areas in Communications.

[26]  Feng Zhou,et al.  Evaluating and optimizing power consumption of anti-collision protocols for applications in RFID systems , 2004, Proceedings of the 2004 International Symposium on Low Power Electronics and Design (IEEE Cat. No.04TH8758).

[27]  Ivan Stojmenovic,et al.  A hybrid randomized protocol for RFID tag identification , 2006 .

[28]  Peter H. Cole,et al.  Synchronization of RFID readers for dense RFID reader environments , 2006, International Symposium on Applications and the Internet Workshops (SAINTW'06).

[29]  Imrich Chlamtac,et al.  Energy-conserving access protocols for identification networks , 1999, TNET.

[30]  F. Schoute,et al.  Dynamic Frame Length ALOHA , 1983, IEEE Trans. Commun..

[31]  D. R. Hush,et al.  Analysis of tree algorithms for RFID arbitration , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[32]  Joongheon Kim,et al.  Effect of localized optimal clustering for reader anti-collision in RFID networks: fairness aspects to the readers , 2005, Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005..

[33]  Michael Beigl,et al.  SDJS: efficient statistics in wireless networks , 2004, Proceedings of the 12th IEEE International Conference on Network Protocols, 2004. ICNP 2004..

[34]  Daniel W. Engels,et al.  Colorwave: an anticollision algorithm for the reader collision problem , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[35]  C. Floerkemeier.  Transmission control scheme for fast RFID object identification , 2006, Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06).

[36]  Philippe Flajolet,et al.  Estimating the multiplicities of conflicts to speed their resolution in multiple access channels , 1987, JACM.

[37]  Israel Cidon,et al.  Conflict multiplicity estimation and batch resolution algorithms , 1988, IEEE Trans. Inf. Theory.

[38]  Jae-Hyun Kim,et al.  Novel Anti-collision Algorithms for Fast Object Identification in RFID System , 2005, 11th International Conference on Parallel and Distributed Systems (ICPADS'05).

[39]  Christian Floerkemeier,et al.  Comparison of transmission schemes for framed ALOHA based RFID protocols , 2006, International Symposium on Applications and the Internet Workshops (SAINTW'06).

[40]  Vipin Chaudhary,et al.  Improvement to the anticollision protocol specification for 900MHz Class 0 radio frequency identification tag , 2005, 19th International Conference on Advanced Information Networking and Applications (AINA'05) Volume 1 (AINA papers).

[41]  N. L. Johnson,et al.  Linear Statistical Inference and Its Applications , 1966 .

[42]  Roy Want,et al.  An introduction to RFID technology , 2006, IEEE Pervasive Computing.