Probabilistic optimal tree hopping for RFID identification

Radio Frequency Identification (RFID) systems are widely used in various applications such as supply chain management, inventory control, and object tracking. Identifying RFID tags in a given tag population is the most fundamental operation in RFID systems. While the Tree Walking (TW) protocol has become the industrial standard for identifying RFID tags, little is known about the mathematical nature of this protocol and only some ad-hoc heuristics exist for optimizing it. In this paper, first, we analytically model the TW protocol, and then using that model, propose the Tree Hopping (TH) protocol that optimizes TW both theoretically and practically. The key novelty of TH is to formulate tag identification as an optimization problem and find the optimal solution that ensures the minimal average number of queries. With this solid theoretical underpinning, for different tag population sizes ranging from 100 to 100K tags, TH significantly outperforms the best prior tag identification protocols on the metrics of the total number of queries per tag, the total identification time per tag, and the average number of responses per tag by an average of 50%, 10%, and 30%, respectively, when tag IDs are uniformly distributed in the ID space, and of 26%, 37%, and 26%, respectively, when tag IDs are non-uniformly distributed.

[1]  Klaus Finkenzeller,et al.  Rfid Handbook: Fundamentals and Applications in Contactless Smart Cards and Identification , 2003 .

[2]  Daniel W. Engels,et al.  Colorwave: a MAC for RFID reader networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[3]  Shaojie Tang,et al.  RASPberry: A stable reader activation scheduling protocol in multi-reader RFID systems , 2009, 2009 17th IEEE International Conference on Network Protocols.

[4]  Chen Qian,et al.  ASAP: Scalable Identification and Counting for Contactless RFID Systems , 2010, 2010 IEEE 30th International Conference on Distributed Computing Systems.

[5]  Bo Sheng,et al.  Counting RFID Tags Efficiently and Anonymously , 2010, 2010 Proceedings IEEE INFOCOM.

[6]  Hongyi Wu,et al.  Smart Trend-Traversal: A Low Delay and Energy Tag Arbitration Protocol for Large RFID Systems , 2009, IEEE INFOCOM 2009.

[7]  Prashant J. Shenoy,et al.  Sherlock: automatically locating objects for humans , 2008, MobiSys '08.

[8]  Philippe Flajolet,et al.  Probabilistic Counting Algorithms for Data Base Applications , 1985, J. Comput. Syst. Sci..

[9]  Himanshu Gupta,et al.  Slotted Scheduled Tag Access in Multi-Reader RFID Systems , 2007, 2007 IEEE International Conference on Network Protocols.

[10]  John Capetanakis,et al.  Tree algorithms for packet broadcast channels , 1979, IEEE Trans. Inf. Theory.

[11]  Chong Wang,et al.  RFID-Based 3-D Positioning Schemes , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[12]  R. Dorfman.  The Detection of Defective Members of Large Populations , 1943 .

[13]  Chun-Hee Lee,et al.  Efficient storage scheme and query processing for supply chain management using RFID , 2008, SIGMOD Conference.

[14]  Yunhao Liu,et al.  Cardinality Estimation for Large-Scale RFID Systems , 2008, IEEE Transactions on Parallel and Distributed Systems.

[15]  Ananth Grama,et al.  Redundant reader elimination in RFID systems , 2005, 2005 Second Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2005. IEEE SECON 2005..

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

[17]  Torben Larsen,et al.  Fast Capture—Recapture Approach for Mitigating the Problem of Missing RFID Tags , 2012, IEEE Transactions on Mobile Computing.

[18]  Klaus Finkenzeller,et al.  Book Reviews: RFID Handbook: Fundamentals and Applications in Contactless Smart Cards and Identification, 2nd ed. , 2004, ACM Queue.

[19]  D. Towsley,et al.  On the instability of slotted ALOHA multiaccess algorithm , 1983 .

[20]  Roy Want,et al.  RFID Technology and Applications , 2006, IEEE Pervasive Computing.

[21]  Lixin Gao,et al.  Energy-Aware Tag Anti-Collision Protocols for RFID Systems , 2007, PerCom.

[22]  Yunhao Liu,et al.  LANDMARC: Indoor Location Sensing Using Active RFID , 2004, Proceedings of the First IEEE International Conference on Pervasive Computing and Communications, 2003. (PerCom 2003)..

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

[24]  Torben Larsen,et al.  Reliable identification of RFID tags using multiple independent reader sessions , 2009, 2009 IEEE International Conference on RFID.

[25]  Wonjun Lee,et al.  Adaptive splitting protocols for RFID tag collision arbitration , 2006, MobiHoc '06.

[26]  Raj Jain,et al.  A Quantitative Measure Of Fairness And Discrimination For Resource Allocation In Shared Computer Systems , 1998, ArXiv.