计算机工程 ›› 2007, Vol. 33 ›› Issue (20): 67-69.doi: 10.3969/j.issn.1000-3428.2007.20.022

• 软件技术与数据库 • 上一篇    下一篇

Hash-tree反碰撞算法

张 虹,韩 磊,马海波   

  1. (中国矿业大学计算机学院,徐州 221008)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-10-20 发布日期:2007-10-20

Hash-tree Anti-collision Algorithm

ZHANG Hong, HAN Lei, MA Hai-bo   

  1. (School of Computer & Technology, China University of Mining and Technology, Xuzhou 221008)
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-10-20 Published:2007-10-20

摘要: 针对EDFSA算法标签识别效率低以及二叉树搜索需检测碰撞准确位置等问题,提出了Hash-tree反碰撞算法。分析了算法的关键问题,确定了算法策略,进行了算法设计,证明了Hash-tree反碰撞算法识别效率期望值在36.8%~100%之间,优于EDFSA算法。仿真验证表明,该算法在识别效率方面有新突破,特别是在识别大量标签时优势明显。

关键词: 标签碰撞, 反碰撞, 无线射频识别技术(RFID), Hash

Abstract: Against the low efficiency in identifying tags by EDFSA and a demand for testing the precise location of anti-collision by binary tree search, a novel anti-collision algorithm based on Hash-tree is presented. By analyzing key problems of the algorithm and making a strategic plan for it, rate of identifying tags with the algorithm is expected to reach between 36.8% and 1, which outperforms EDFSA. Simulation results show that the algorithm is outstanding in tag identification, especially when dealing with large amounts of tags.

Key words: tag-collision, anti-collision, radio frequency identification(RFID), Hash

中图分类号: