Efficient Unknown Tag Detection in Large-Scale RFID Systems With Unreliable Channels

被引:34
作者
Gong, Wei [1 ]
Liu, Jiangchuan [1 ]
Yang, Zhe [1 ,2 ]
机构
[1] Simon Fraser Univ, Sch Comp Sci, Burnaby, BC V5A 1S6, Canada
[2] Northwestern Polytech Univ, Sch Comp Sci, Xian 710072, Shaanxi, Peoples R China
基金
加拿大自然科学与工程研究理事会;
关键词
RFID; large-scale systems; unknown tag detection; unreliable channels; IDENTIFICATION; PROTOCOLS;
D O I
10.1109/TNET.2017.2699683
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
One of the most important applications of radio frequency identification (RFID) technology is to detect unknown tags brought by new tagged items, misplacement, or counterfeit tags. While unknown tag identification is able to pinpoint all the unknown tags, probabilistic unknown tag detection is preferred in large-scale RFID systems that need to be frequently checked up, e.g., real-time inventory monitoring. Nevertheless, most of the previous solutions are neither efficient nor reliable. The communication efficiency of former schemes is not well optimized due to the transmission of unhelpful data. Furthermore, they do not consider characteristics of unreliable wireless channels in RFID systems. In this paper, we propose a fast and reliable method for probabilistic unknown tag detection, white paper (WP) protocol. The key novelty of WP is to build a new data structure of composite message that consists of all the informative data from several independent detection synopses; thus it excludes useless data from communication. Furthermore, we employ packet loss differentiation and adaptive channel hopping techniques to combat unreliable backscatter channels. We implement a prototype system using USRP software-defined radio and WISP tags to show the feasibility of this design. We also conduct extensive simulations and comparisons to show that WP outperforms previous methods. Compared with the state-of-the-art protocols, WP achieves more than 2x performance gain in terms of time-efficiency when all the channels are assumed free of errors and the number of tags is 10000, and achieves up to 12x success probability gain when the burstiness is more than 80%.
引用
收藏
页码:2528 / 2539
页数:12
相关论文
共 27 条
[1]   Link-level measurements from an 802.11b mesh network [J].
Aguayo, D ;
Bicket, J ;
Biswas, S ;
Judd, G ;
Morris, R .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2004, 34 (04) :121-131
[2]  
[Anonymous], 2008, EPCGLOBAL GEN2 STAND
[3]   Revisiting an RFID Identification-Free Batch Authentication Approach [J].
Bianchi, Giuseppe .
IEEE COMMUNICATIONS LETTERS, 2011, 15 (06) :632-634
[4]   An Efficient Tag Search Protocol in Large-Scale RFID Systems With Noisy Channel [J].
Chen, Min ;
Luo, Wen ;
Mo, Zhen ;
Chen, Shigang ;
Fang, Yuguang .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2016, 24 (02) :703-716
[5]  
Chunlin S., 2010, CONT INT REL, V5
[6]   Toward More Rigorous and Practical Cardinality Estimation for Large-Scale RFID Systems [J].
Gong, Wei ;
Liu, Jiangchuan ;
Liu, Kebin ;
Liu, Yunhao .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2017, 25 (03) :1347-1358
[7]   Fast Composite Counting in RFID Systems [J].
Gong, Wei ;
Liu, Haoxiang ;
Chen, Lei ;
Liu, Kebin ;
Liu, Yunhao .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2016, 24 (05) :2788-2799
[8]   Fast and Scalable Counterfeits Estimation for Large-Scale RFID Systems [J].
Gong, Wei ;
Stojmenovic, Ivan ;
Nayak, Amiya ;
Liu, Kebin ;
Liu, Haoxiang .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2016, 24 (02) :1052-1064
[9]   GenePrint: Generic and Accurate Physical-Layer Identification for UHF RFID Tags [J].
Han, Jinsong ;
Qian, Chen ;
Yang, Panlong ;
Ma, Dan ;
Jiang, Zhiping ;
Xi, Wei ;
Zhao, Jizhong .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2016, 24 (02) :846-858
[10]  
Joshi K., 2015, P 12 USENIX S NETW S, P189