arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2510.18285cs.NIcs.DS
收藏

重新审视 RFID 缺失标签识别

Revisiting RFID Missing Tag Identification

School of Computer Science and Engineering, Sun Yat-sen University(中山大学计算机科学与工程学院);Key Laboratory of Machine Intelligence and Advanced Computing, Ministry of Education, China(教育部机器智能与先进计算重点实验室);School of Information and Electronics, Beijing Institute of Technology(北京理工大学信息与电子学院)

Kanghuai Liu, Lin Chen, Jihong Yu, Junyi Huang, Shiyuan Liu

AI总结:

该研究重新审视 RFID 缺失标签识别,定量评估既有方案,证明任意算法的期望执行时间下界,并提出基于冲突分区树(CPT)的新算法,使时间开销最多降低 $\log N$ 倍。

摘要:

我们重新审视 RFID 网络中的缺失标签识别问题,并作出三项贡献。首先,我们对十余年来有关缺失标签识别的现有方案进行定量比较与评估。我们表明,文献中最佳解决方案的期望执行时间为 $Θ\left(N+\frac{(1-α)^2(1-δ)^2}{ ε^2}\right)$,其中 $δ$ 和 $ε$ 是量化所需识别精度的参数,$N$ 表示系统中的标签数量,其中有 $αN$ 个标签缺失。其次,我们通过分析确立了任意缺失标签识别算法的期望执行时间下界,即 $Θ\left(\frac{N}{\log N}+\frac{(1-δ)^2(1-α)^2}{ε^2 \log \frac{(1-δ)(1-α)}ε}\right)$,从而给出理论性能极限。第三,我们利用树结构开发了一种新颖的缺失标签识别算法,其期望执行时间为 $Θ\left(\frac{\log\log N}{\log N}N+\frac{(1-α)^2(1-δ)^2}{ ε^2}\right)$,与文献中最佳算法相比,时间开销最多降低 $\log N$ 倍。我们设计中的关键技术是一种称为冲突分区树(collision-partition tree,CPT)的新颖数据结构,它构建于标签伪 ID 中的一个比特子集之上,可带来更均衡的树结构,并降低解析整棵树的时间复杂度。

英文摘要:

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 $Θ\left(N+\frac{(1-α)^2(1-δ)^2}{ ε^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 $Θ\left(\frac{N}{\log N}+\frac{(1-δ)^2(1-α)^2}{ε^2 \log \frac{(1-δ)(1-α)}ε}\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 $Θ\left(\frac{\log\log N}{\log N}N+\frac{(1-α)^2(1-δ)^2}{ ε^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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑