基于查询树的防碰撞算法性能分析与研究

多标签碰撞问题严重影响射频识别系统的性能.基于查询树的防碰撞算法作为一种确定性算法被广泛的应用于各类射频识别场景中.本文分析了主流查询树防碰撞算法的性能与不足，并基于查询树方法提出了一种时间有效的防碰撞算法.该算法基于传统查询树识别模型，实施了一种双查询前缀匹配方法，可以消除传统查询树方法中的空闲时隙.此外，提出的算法可以充分利用碰撞时隙来提高识别效率.理论分析和仿真结果表明该算法优于现有的查询树防碰撞算法.

Performance Analysis and Research of Anti-collision Algorithms Based on Query Tree

Multiple tags collision problem severely impairs identification performance of RFID systems.Anti-collision algorithms based on query tree have been widely applied in various RFID scenarios.In this paper,we analyze the performance and deficiency of mainstream query tree based algorithms.And then,a time efficient anti-collision algorithm based on query tree is proposed to enhance the identification efficiency.Specifically,the dual prefixes matching method is implemented based on the conventional query tree identification model,which can significantly remove idle slots.Moreover,the proposed method can also make extensive use of collision slots to improve the identification efficiency.Both theoretical and simulation results indicate that the proposed algorithm outperforms the existing query tree based algorithms.