一种双向混合查询树防碰撞算法

A Two-way Hybrid Query Tree Anti-Collision Algorithm

本算法在混合查询树算法的基础上,利用比较碰撞距离之和,正向用最高碰撞位和次高碰撞位的组合信息,对标签进行分组,并决定其推迟几个时隙进行响应;逆向利用基本二进制算法进行搜索。仿真结果表明,该算法优于基本QT算法和HQT算法,减少了查询次数和系统通信量,标签识别效率明显提高。

Based on the Hybrid Query tree algorithm, this new algorithm used the compared sum of the collision distances in for ward direction, the combined information of the highest and the second highest bit of collision and categorized the tags and de tided the gaps of delay to reduce collision. In reverse direction, the identification tree is constructed to identify the electronic la bels as the leaf nodes. The simulated experiment showed that this proposed algorithm is superior to QT and HQT by deerea sing the number of query and the frequency of system communication. Hence, the efficiency of tag identification is greatly en hanced.