摘要: 针对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
中图分类号:
张 虹;韩 磊;马海波. Hash-tree反碰撞算法[J]. 计算机工程, 2007, 33(20): 67-69.
ZHANG Hong; HAN Lei; MA Hai-bo. Hash-tree Anti-collision Algorithm[J]. Computer Engineering, 2007, 33(20): 67-69.