Missing-Tag Detection with Presence of Unknown Tags
Missing-Tag Detection with Presence of Unknown Tags
复制标题
DOI：
10.1109/sahcn.2018.8397133
复制
发表时间：
2018-06
期刊：
影响因子：
--
通讯作者：
Youlin Zhang;Shigang Chen;You Zhou;Olufemi O. Odegbile
中科院分区：
文献类型：
--
作者：
Youlin Zhang;Shigang Chen;You Zhou;Olufemi O. Odegbile
近年来，射频识别（RFID）技术已经激增，尤其是在零售，仓库和供应链管理中的广泛使用。它最受欢迎的应用之一是在大型存储空间中自动检测缺少的产品（带有RFID标签）。但是，大多数现有协议都假定读者覆盖范围内所有标签的ID是已知的，同时忽略了某些标签的ID可能未知的实用场景。这些未知标签的存在将在这些协议中引入误报，从而降低其性能。一些先前的艺术研究这个问题，但是它们的时间效率很低，尤其是当未知标签数量较大时。在本文中，我们提出了基于压缩过滤器的缺少标签检测协议，该协议不仅降低了滤波器大小以提高时间效率，还有助于抑制未知标签的干扰，以获得高缺失标签检测精度。为了进一步提高性能，我们为标签报告其存在的新方法大大降低了碰撞，从而提高了检测概率。广泛的模拟表明，与最佳先前工作相比，在相同的缺失TAG检测概率下，我们的压缩过滤器和碰撞减少方法将协议执行时间减少到92 \％。
Radio Frequency Identification (RFID) technology has been proliferating in recent years, especially with its wide usage in retail, warehouse and supply chain management. One of its most popular applications is to automatically detect missing products (attached with RFID tags) in a large storage place. However, most existing protocols assume that the IDs of all tags within a reader's coverage are known, while ignoring practical scenarios where the IDs of some tags may be unknown. The existence of these unknown tags will introduce false positives in those protocols, degrading their performance. Some prior art studies this problem, but their time efficiency is low, especially when the number of unknown tags is large. In this paper, we propose a missing tag detection protocol based on compressed filters, which not only reduces the filter size for better time-efficiency but also helps dampen the interference of unknown tags for high missing-tag detection accuracy. To further improve the performance, we propose a new way for tags to report their presence, greatly reducing collisions and thus improving the detection probability. Extensive simulations demonstrate that our compressed filter and collision-reduction method reduce the protocol execution time by 83\% to 92\% under the same missing-tag detection probability, when comparing with the best prior work.