当前位置: X-MOL 学术IEEE ACM Trans. Netw. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Efficient Anonymous Temporal-Spatial Joint Estimation at Category Level Over Multiple Tag Sets With Unreliable Channels
IEEE/ACM Transactions on Networking ( IF 3.7 ) Pub Date : 2020-07-31 , DOI: 10.1109/tnet.2020.3011347
Youlin Zhang , Shigang Chen , You Zhou , Olufemi O. Odegbile , Yuguang Fang

Radio-frequency identification (RFID) technologies have been widely used in inventory control, object tracking and supply chain management. One of the fundamental system functions is called cardinality estimation, which is to estimate the number of tags in a covered area. In this paper, we extend the research of this function in two directions. First, we perform joint cardinality estimation among tags that appear at different geographical locations and at different times. Moreover, we target at category-level information, which is more significant in practical scenarios where we need to monitor the tagged objects of many different categories. Second, we enforce anonymity in the process of information gathering in order to preserve the privacy of the tagged objects. These capabilities will enable new applications such as tracking how products of different categories are transferred in a large, distributed supply chain. We propose and implement a novel protocol to meet the requirements of anonymous category-level joint estimation over multiple tag sets. We formally analyze the performance of our estimator and determine the optimal system parameters. Moreover, we extend our protocol to unreliable channels and consider two channel error models. Extensive simulations show that the proposed protocol can efficiently and accurately estimate joint information over multiple tag sets at category level, while preserving tags’ anonymity.

中文翻译:

具有不可靠通道的多个标签集上类别级别的有效匿名时空联合估计

射频识别(RFID)技术已广泛用于库存控制,对象跟踪和供应链管理。系统的基本功能之一称为基数估计,即估计覆盖区域中标签的数量。在本文中,我们从两个方向扩展了对该功能的研究。首先,我们对出现在不同地理位置和不同时间的标签之间进行联合基数估计。此外,我们以类别级别的信息为目标,在需要监视许多不同类别的标记对象的实际情况下,这更为重要。其次,我们在信息收集过程中强制使用匿名性,以保护标记对象的隐私。这些功能将启用新的应用程序,例如跟踪如何在大型分布式供应链中转移不同类别的产品。我们提出并实现了一种新颖的协议,以满足对多个标签集进行匿名类别级联合估计的要求。我们正式分析估计器的性能并确定最佳系统参数。此外,我们将协议扩展到不可靠的通道,并考虑两个通道错误模型。大量的仿真表明,所提出的协议可以在类别级别上高效,准确地估计多个标签集上的联合信息,同时保留标签的匿名性。我们提出并实现了一种新颖的协议,以满足对多个标签集进行匿名类别级联合估计的要求。我们正式分析估计器的性能并确定最佳系统参数。此外,我们将协议扩展到不可靠的通道,并考虑两个通道错误模型。大量的仿真表明,所提出的协议可以在类别级别上高效,准确地估计多个标签集上的联合信息,同时保留标签的匿名性。我们提出并实现了一种新颖的协议,以满足对多个标签集进行匿名类别级联合估计的要求。我们正式分析估计器的性能并确定最佳系统参数。此外,我们将协议扩展到不可靠的通道,并考虑两个通道错误模型。大量的仿真表明,所提出的协议可以在类别级别上高效,准确地估计多个标签集上的联合信息,同时保留标签的匿名性。
更新日期:2020-07-31
down
wechat
bug