高效无线射频识别自适应型跟踪树防碰撞算法  

Highly efficient RFID adaptive tracking tree anti-collision algorithm

作　　者：王鑫[1] 贾庆轩[1] 高欣[1] 赵兵 崔宝江[3] 

机构地区：[1]北京邮电大学自动化学院,北京100876 [2]国家电网计量中心,北京100192 [3]北京邮电大学计算机学院,北京100876

出　　处：《吉林大学学报（工学版）》2015年第4期1225-1233,共9页Journal of Jilin University:Engineering and Technology Edition

基　　金：'973'国家重大基础研究发展规划项目(2012CB724400);国际科技合作重点项目(2013DFG72850)

摘　　要：针对实际应用环境下某些标签一直滞留在读写器识别范围内的情况,在自适应型查询仲裁协议(AQS)算法基础上,提出一种高效无线射频识别自适应型跟踪树防碰撞算法(HACT)。首先,利用分而治之的方法对滞留标签和新到标签分别进行识别;其次,设计了三叉树碰撞位跟踪算法对新到标签进行识别;最后,提出了合并质询串构建分支树法自适应调整质询队列对滞留标签进行识别,实现了单个质询串对多个标签的识别。理论分析和仿真实验表明HACT算法性能明显优于AQS算法。Under the environment of practical applications, some tags still stay in the identification range of the reader. Based on the AQS algorithm, a highly efficient Radio Frequency Identification （RFID） adaptive tracking tree anti--collision algorithm is put forward. First, arriving tags and stay tags are identified in the way to divide and conquer. Then, a ternary tree collision tracking algorithm is designed for the arriving tag identification. Finally, a method of merging inquiry string and building branch tree for adaptive adjusting inquiry queue is proposed to identify stay tags, which implements a single inquiry string can identify multiple stay tags. Theoretical analysis and simulation experiments show that the performance of the proposed algorithm is better than that of existing AQS algorithm.

关 键 词：自动控制技术 防碰撞 无线射频识别 标签识别 自适应 

分 类 号：TP212.9[自动化与计算机技术—检测技术与自动化装置]