• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Network Protocols >LocP: An efficient Localized Polling Protocol for large-scale RFID systems
【24h】

LocP: An efficient Localized Polling Protocol for large-scale RFID systems

机译：LOCP：用于大型RFID系统的有效本地化轮询协议

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

RFID systems nowadays are operated at large-scale in terms of both occupied space and tag quantity. One may have prior knowledge of the complete set of tags (denoted by N) and any set of wanted tags (denoted by M) within the complete set, i.e., M ? N. Then here comes an open problem: when one is particularly interested in a subarea of the system, how to collect information (not simply tagIDs) from a wanted subset (denoted by dM) of the interrogated tags (denoted by dN) in that subarea? This issue has great significance in many practical applications but appears to be challenging when there is a stringent time constraint. In this work, we first establish the lower-bound of this problem, and show a straightforward polling solution. Then, we propose a novel polling protocol called LocP, which consists of two phases: the Tags-Filtering phase and the Ordering-and-Reporting phase. LocP employs Bloom Filter twice to significantly reduce the scale of candidate tags in the Tags-Filtering phase. In the Ordering-and-Reporting phase, tags determine their own transmission time-slots according to the allocation vectors iteratively broadcasted by the reader. LocP thus achieves a delicate tradeoff between time and polling accuracy. We conduct extensive simulations to evaluate the performance of LocP. The results demonstrate that LocP is highly efficient in terms of information collection time, leading to convincing applicability and scalability of large-scale RFID systems.
机译：现在，RFID系统在占用空间和标签数量方面以大规模运行。可以在完整集合中有先验知识的完整标签（由n表示）和任何一组想要的标签（由m）内的任何一组想要的标签（由m表示），即，m？ N.然后这里出现一个突出问题：当一个人对系统的子区域特别感兴趣时，如何从询问的标签（由DN表示的DM表示）中收集信息（不仅仅是标记）的信息蛛丝？在许多实际应用中，这个问题具有重要意义，但是当存在严格的时间限制时似乎有挑战性。在这项工作中，我们首先建立这个问题的较低限制，并显示出直接的投票解决方案。然后，我们提出了一种名为LOCP的新型投票协议，其中包括两个阶段：标签过滤阶段和排序和报告阶段。 LOCP使用Bloom过滤器两次，以显着降低标签过滤阶段中的候选标签的比例。在订购和报告阶段，标签根据读者迭代地广播的分配矢量确定其自己的传输时隙。因此，Locp在时间和轮询精度之间实现了微妙的权衡。我们进行广泛的模拟，以评估LOCP的性能。结果表明，LOCP在信息收集时间方面具有高效，导致大规模RFID系统的适用性和可扩展性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号