4.5 Article

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

Journal

IEEE-ACM TRANSACTIONS ON NETWORKING
Volume 25, Issue 4, Pages 2528-2539

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TNET.2017.2699683

Keywords

RFID; large-scale systems; unknown tag detection; unreliable channels

Funding

  1. Industrial Canada Technology Demonstration Program
  2. NSERC Discovery Grant
  3. NSERC E.W.R. Steacie Memorial Fellowship
  4. Mitacs Accelerate Internship
  5. Project NSFC [61402372]

Ask authors/readers for more resources

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%.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available