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

RFID系统中的近优类别信息采样

A Near-Optimal Category Information Sampling in RFID Systems

Xiujun Wang, Zhi Liu, Xiaokang Zhou, Yong Liao, Han Hu, Xiao Zheng, Jie Li

AI总结:

针对RFID系统类别信息采样中执行时间最小化与缺失标签导致收集失败的问题,本文提出执行时间接近理论下界的近优协议OPT-C,并通过仿真与真实实验验证其优势和实用性。

摘要:

在许多支持RFID的应用中,物体被划分为不同类别,并且与每个物体类别相关联的信息(称为类别信息)会被写入所附着的标签中,使读取器随后能够访问该信息。此类RFID系统中的类别信息采样,即从每个类别中随机选择(采样)少量标签并收集其类别信息,是在RFID中提供实时监控和分析的基础。然而,据我们所知,该问题仍有两个技术挑战尚未解决,即如何保证最小化执行时间,以及减少因标签缺失而导致的收集失败。本文中,我们通过考虑如何利用尽可能短的时间,从每个类别中采样不同数量的随机标签,并以小批次顺序收集其类别信息,来解决这两个局限。具体而言,我们首先得到了任何能够解决该问题的协议在执行时间上的下界。随后,我们提出了一种近优类别信息采样协议(OPT-C),其执行时间接近该下界,从而解决该问题。最后,大量仿真结果证明了OPT-C相较于现有协议的优越性,同时真实世界实验验证了OPT-C的实用性。

英文摘要:

In many RFID-enabled applications, objects are classified into different categories, and the information associated with each object's category (called category information) is written into the attached tag, allowing the reader to access it later. The category information sampling in such RFID systems, which is to randomly choose (sample) a few tags from each category and collect their category information, is fundamental for providing real-time monitoring and analysis in RFID. However, to the best of our knowledge, two technical challenges, i.e., how to guarantee a minimized execution time and reduce collection failure caused by missing tags, remain unsolved for this problem. In this paper, we address these two limitations by considering how to use the shortest possible time to sample a different number of random tags from each category and collect their category information sequentially in small batches. In particular, we first obtain a lower bound on the execution time of any protocol that can solve this problem. Then, we present a near-OPTimal Category information sampling protocol (OPT-C) that solves the problem with an execution time close to the lower bound. Finally, extensive simulation results demonstrate the superiority of OPT-C over existing protocols, while real-world experiments validate the practicality of OPT-C.

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

↑