• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Parallel and Distributed Processing Techniques and Applications(PDPTA'04) v.2; 20040621-20040624; Las Vegas,NV; US >An Efficient Stochastic Anti-collision Algorithm using Bit-Slot Mechanism
【24h】

An Efficient Stochastic Anti-collision Algorithm using Bit-Slot Mechanism

机译：基于位槽机制的高效随机防冲突算法

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

RFID systems have emerged as an affordable solution for identifying physical objects. However several problems still remain unresolved, especially avoidance of collision (anti-collision algorithm) when identifying multiple tags simultaneously. This paper presents an efficient anti-collision algorithm based on stochastic method. The algorithm we propose uses bit-slot mechanism. Bit-slot mechanism means the way that regards one bit of each tag as one time slot. Compared to other stochastic algorithms such as I-Code protocol, the proposed algorithm does not need any timing circuit with tags while I-Code protocol needs one. Moreover, it decreases the number of message transmissions between tags and tag readers. Anti-collision algorithms based on tree structures show reasonable accuracy and cost, but the performance of them can be degraded because the number of message transmissions between tags and readers exponentially increases depending on the size of ID. The proposed algorithm resolves this problem. Accordingly, the performance of proposed algorithm is improved as the length of tag ID is increased.
机译：RFID系统已经成为一种可负担得起的用于识别物理对象的解决方案。但是，仍然存在一些问题尚未解决，尤其是在同时识别多个标签时避免冲突（防冲突算法）。提出了一种基于随机方法的高效防撞算法。我们提出的算法使用位时隙机制。位时隙机制是指将每个标签的一位视为一个时隙的方式。与其他随机算法（例如I-Code协议）相比，该算法不需要带有标签的任何定时电路，而I-Code协议则需要一个。此外，它减少了标签和标签阅读器之间的消息传输数量。基于树结构的防冲突算法显示了合理的准确性和成本，但是由于ID和大小之间的标记和读取器之间的消息传输数量呈指数增长，因此它们的性能可能会降低。所提出的算法解决了这个问题。因此，随着标签ID长度的增加，所提出算法的性能得以提高。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号