首页> 外文会议>International Conference on Communications in Computing >A New Tree-based Tag Anti-collision Protocol for RFID Systems
【24h】

A New Tree-based Tag Anti-collision Protocol for RFID Systems

机译:用于RFID系统的新型基于树的标签防碰撞协议

获取原文

摘要

This paper proposes a tree-based anti-collision protocol for tags in the UHF (ultra high frequency, 300MHz-3GHz) band. To reduce the step for searching all tags in the interrogation zone, the depth-first search (DFS) is used as a basic search criterion like in query tree protocols. To prevent the redundant increase of the transmission bit length in process of implementing the DFS, the binary tree protocol is taken to restart the DFS at the height of binary tree, rather than the root, that was most recently marked when the tag collision happened. To substantiate theoretically that the proposed protocol achieves better performance than the previous protocols, the performance index in [8] consisting of both energy consumption and time delay is employed.
机译:本文提出了一种基于树的防碰撞协议,用于UHF(超高频,300MHz-3GHz)频带标签。为了减少搜索询问区域中的所有标记的步骤,深度第一搜索(DFS)用作查询树协议中的基本搜索条件。为了防止在实现DFS的过程中传输比特长度的冗余增加,将拍摄二进制树协议以在二叉树的高度处重新启动DFS,而不是根本最近标记的root。为了理论上,所提出的协议实现比以前的协议更好的性能,采用了能量消耗和时间延迟组成的[8]中的性能指标。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号