基于帧分组与二进制搜索树识别的RFID防碰撞算法的研究

RFID Anti-collision Algorithm Based on Frame Grouping and Binary Search Tree

针对射频识别(RFID)系统中,多个标签同时响应同一阅读器时产生的信息碰撞问题,提出基于帧分组与二进制搜索树识别的RFID防碰撞算法.该算法首先基于帧时隙ALOHA算法对标签进行识别,并依据碰撞时隙将未识别标签分成若干组,然后运用二进制搜索树算法依次对各组进行确定性识别,最后通过对算法进行性能分析及仿真比较,该算法在吞吐率和识别效率2方面较传统算法都有很大程度的优化,在L=N/2,且当N=100时,该算法的吞吐率较帧时隙ALOHA算法和二进制搜索树算法分别提高10%和34%;在L=N,且当N=100时,该算法的识别效率较帧时隙ALOHA算法和二进制搜索树算法分别提高12%和37%.

In radio frequency identification（RFID） system,when multiple tags respond to the same reader at the same time,the tag collision occurs.In the study,the anti-collision algorithm based on frame grouping and binary search tree was proposed.Firstly,the algorithm identified tags by frame slotted ALOHA algorithm and divided tags which not be identified into several groups based on colliding slots.Secondly,binary search tree algorithm was used to certainly identify each group one by one.Lastly,the three algorithms were compared.The results indicated that the throughput and identified efficiency were superior to that of traditional algorithms,when the L =N /2,and N = 100,compared with frame slotted ALOHA algorithm and binary search tree algorithm,the throughput of the algorithm was scaled up by 10 percent and 34 percent,respectively;when L = N,and N = 100,the identified efficiency of the algorithm was scaled up by 12 percent and 37 percent,respectively.