一种自调整多叉树RFID多标签防碰撞算法

Anti-Collision Algorithm based on Self-adjusting Multi-tree For RFID Multi-Tag

随着RFID技术应用领域的拓宽,有效地解决多标签碰撞问题是提高RFID系统性能的关键。在树型搜索防碰撞算法分析的基础上,提出一种自调整多叉树防碰撞算法。该算法利用曼彻斯特编码提取标签碰撞位,组合成新的标签序列号,然后阅读器选取两位序列号进行异或运算,并根据运算结果自调整搜索树的叉数搜索标签。该算法增加检测命令,可以减少空时隙的数目,仿真实验表明,自调整多叉树算法在阅读器查询次数、系统吞吐率和传输比特数上比QT算法和改进的四叉树算法都有所提升,在多标签识别中更有竞争力。

With the expansion of RFID technology applications, effectively solve the multi-label collision problem is to improve the performance of RFID system key. Based on the analysis of anti-collision algorithm of tree search, a self-adjusting multi-tree anti-collision algorithm is proposed. The algorithm uses the Manchester code to extract the label collision bits, and then combines the new tag serial number, and then the reader selects the two-bit serial number to XOR and transfers the data according to the result of the operation. By increasing the detection command, the system can achieve the effect of reducing the number of empty slots. The simulation results show that the self-adjusting multi-tree algorithm has improved the number of times of reader query, system throughput and transmission bits than QT algorithm and improved quadtree algorithm, and it is more competitive in multi-tag recognition.