Revisiting RFID Missing Tag Identification
Kanghuai Liu, Lin Chen, Jihong Yu, Junyi Huang, and Shiyuan Liu

TL;DR
This paper analyzes and improves RFID missing tag identification, providing theoretical bounds and a novel algorithm with significantly reduced execution time using a new data structure.
Contribution
It offers a comprehensive comparison of existing methods, establishes lower bounds, and introduces a new efficient algorithm with a collision-partition tree structure.
Findings
Best existing solution has expected time $ heta(N + ((1-eta)^2 (1- ho)^2)/ heta^2)$.
Theoretical lower bound on execution time is $ heta(N/ ext{log} N + ((1-eta)^2 (1- ho)^2)/( heta^2 ext{log} rac{(1-eta)(1- ho)}{ heta}))$.
Proposed algorithm reduces time complexity by up to $ ext{log} N$ compared to previous methods.
Abstract
We revisit the problem of missing tag identification in RFID networks by making three contributions. Firstly, we quantitatively compare and gauge the existing propositions spanning over a decade on missing tag identification. We show that the expected execution time of the best solution in the literature is , where and are parameters quantifying the required identification accuracy, denotes the number of tags in the system, among which tags are missing. Secondly, we analytically establish the expected execution time lower-bound for any missing tag identification algorithm as , thus giving the theoretical performance limit. Thirdly, we develop a novel missing tag…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
