自调整混合树 RFID 多标签防碰撞算法

摘要

在 RFID 系统中，阅读器读取标签的效率与解决标签发生碰撞的方法密切相关。目前采用多叉树查询是一种较好的多标签防碰撞方法。它能减少碰撞时隙，再通过额外的查询来减少空闲时隙。但额外的查询也增加了新的开销。本文提出了一个自调整混合树 RFID 多标签防碰撞算法，该算法根据最高两个碰撞位的特征，在不增加额外查询的条件下，自调整搜索树的叉数，从而避免了一些碰撞时隙和空闲时隙。通过对算法的性能分析和仿真结果可以看到，自调整混合树 RFID 多标签防碰撞算法具有较少的时间复杂度和通信复杂度，识别效率也明显高于其他多叉树算法。%In a radio frequency identification (RFID) system ,the efficiency that the reader reads tags is closely related to the method that solves the tags collision .A reasonable solution is to use Multi-tree query to reduce collision timeslots and then decrease idle timeslots by an additional query .However ,this additional query also adds additional cost to the reader and tags .An adjustive hybrid tree (AHT) anti-collision algorithm for RFID multi-tag identification is presented .The AHT algorithm is based on the fea-tures of the highest two collision bit ,and it self-adjusts the search tree branches in the absence of additional query ,thus it avoids some collision timeslots and idle timeslots .The performance analysis and simulation results show that the AHT algorithm has better time complexity ,communication complexity and recognition efficiency than those of other multi-tree algorithms .