# Revisiting RFID Missing Tag Identification

IEEE INFOCOM 2022 - IEEE Conference on Computer Communications（2022）

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 $\Theta \left( {N + \frac{{{{(1 - \alpha )}^2}{{(1 - \delta )}^2}}}{{{\varepsilon ^2}}}} \right)$, where δ and ϵ are parameters quantifying the required identification accuracy, N denotes the number of tags in the system, among which αN tags are missing. Secondly, we analytically establish the expected execution time lower-bound for any missing tag identification algorithm as $\Theta \left( {\frac{N}{{\log N}} + \frac{{{{(1 - \delta )}^2}{{(1 - \alpha )}^2}}}{{{\varepsilon ^2}\log \frac{{(1 - \delta )(1 - \alpha )}}{\varepsilon }}}} \right)$, thus giving the theoretical performance limit. Thirdly, we develop a novel missing tag identification algorithm by leveraging a tree structure with the expected execution time of $\Theta \left( {\frac{{\log \log N}}{{\log N}}N + \frac{{{{(1 - \alpha )}^2}{{(1 - \delta )}^2}}}{{{\varepsilon ^2}}}} \right)$, reducing the time overhead by a factor of up to log N over the best algorithm in the literature. The key technicality in our design is a novel data structure termed as collision-partition tree (CPT), built on a subset of bits in tag pseudo-IDs, leading to more balanced tree structure and reducing the time complexity in parsing the entire tree.

MoreTranslated text

Key words

RFID missing tag identification,RFID networks,expected execution time,N + \frac,required identification accuracy,αN tags,log\frac,tag pseudoIDs,time complexity,missing tag identification algorithm,tree structure,data structure,collision partition tree,CPT

AI Read Science

Must-Reading Tree

Example

Generate MRT to find the research sequence of this paper

Chat Paper

Summary is being generated by the instructions you defined