4.8 Article

Fast and Reliable Dynamic Tag Estimation in Large-Scale RFID Systems

Journal

IEEE INTERNET OF THINGS JOURNAL
Volume 8, Issue 3, Pages 1651-1661

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/JIOT.2020.3015943

Keywords

Estimation; Vehicle dynamics; Protocols; Radiofrequency identification; Heuristic algorithms; Reliability; Internet of Things; Cardinality estimation; radio-frequency identification (RFID) system; tags; time efficiency

Funding

  1. National Natural Science Foundation of China [61602167, 61772559, 61872310, 61972140]
  2. Hunan Provincial Natural Science Foundation of China [2020JJ3016]
  3. National Defense Basic Research Plan [JCKY2018110C145]
  4. National Defense Science and Technology Innovation Special Zone Project of China
  5. Hong Kong RGC Research Impact Fund (RIF) [R5034-18]
  6. General Research Fund of the Research Grants Council of Hong Kong [PolyU 152221/19E]

Ask authors/readers for more resources

This article presents effective solutions to the problem of estimating the number of dynamic tags in RFID systems, taking into account missing and unknown tags. By utilizing the time slot reuse method and SSR protocol, accuracy and time efficiency of estimation can be greatly improved. However, the performance of SSR degrades significantly when there is a notable disparity between the numbers of different tag types, leading to the proposal of an enhanced version, ESSR.
Radio-frequency identification (RFID) has been utilized in many applications, such as supply chain and stock management in supermarkets. RFID systems in such practical applications are inherently dynamic because tags may move in and out frequently. One important but challenging problem in such systems is how to estimate the number of dynamic tags fast and reliably. This article proposes effective solutions to this problem, which guarantee the accuracy of estimation and time efficiency. Especially, we want to simultaneously estimate the number of tags that moved out of the system (missing tags) and the number of tags that entered the system (unknown tags) in a specified time interval. We design a novel method called time slot reuse (TSR) that generates two logical frames corresponding to the two types of tags from only one physical frame. Based on TSR, we propose a protocol called SSR that can accurately estimate the number of dynamic tags by using the generated logic frames. However, the performance of SSR degrades significantly when the disparity between the number of the two types of tags is remarkable. We further propose an enhanced version of SSR (ESSR), which overcomes this drawback by partitioning the frame into ranges and mapping different types of tags into different ranges. Rigorous theoretical analysis is performed to tune parameters in SSR and ESSR to minimize the execution time. The simulation results demonstrate up to 80% improvement in time efficiency when compared with state-of-the-art solutions to the same problem.

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.8
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available