【24h】

A Progressive Population Estimation Based Binary Query Tree Protocol for Efficient RFID Tag Collision Resolution

机译:基于渐进人口估计的二进制查询树协议,可有效解决RFID标签冲突

获取原文
获取原文并翻译 | 示例

摘要

RFID technology enables the automatic identification of physical items and acts as a bridge between the physical world and the cyber space. But tag collision remains a key challenge that affects the universal deployment of the RFID system. For the efficient resolution of collisions caused by passive memory-less RFID tags, this paper proposes the progressive estimation of tag population and an enhanced binary query tree protocol. In this protocol, after an idle or a successful query, according to the number of tag already identified and the binary query string broadcasted by the reader, the overall population of tags near the reader is estimated, and the optimal binary string for the reader to broadcast in the next query will be calculated. This process is performed repeatedly until all collisions are resolved. Theoretical analysis and numeric simulation are performed, it is verified that this protocol performs better in terms of throughput, message complexity and time latency.
机译:RFID技术可以自动识别物理物品,并充当物理世界和网络空间之间的桥梁。但是标签碰撞仍然是影响RFID系统通用部署的主要挑战。为了有效解决由无源无记忆RFID标签引起的冲突,本文提出了标签数量的渐进估计和增强的二元查询树协议。在此协议中,在空闲或成功查询之后,根据已识别的标签数量和读取器广播的二进制查询字符串,估算读取器附近的标签总数,并为读取器提供最佳的二进制字符串。将在下一个查询中广播广播。重复执行此过程,直到解决所有冲突。进行了理论分析和数值模拟,验证了该协议在吞吐量,消息复杂度和时间延迟方面表现更好。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号