基于前缀分组的改进自适应多叉树防碰撞算法  

Improved Adaptive Multi-tree Anti-collision Algorithm Based on Prefix Group

作　　者：白乐强[1] 刘杰 曹科研 BAI Le-qiang;LIU Jie;CAO Ke-yan(Information&Control Engineering Faculty,Shenyang Jianzhu University,Shenyang Liaoning 110168,China)

机构地区：[1]沈阳建筑大学信息与控制工程学院,辽宁沈阳110168

出　　处：《计算机仿真》2022年第1期288-292,共5页Computer Simulation

基　　金：国家自然科学基金资助项目(61602323);辽宁省教育厅青年育苗项目(201913)。

摘　　要：针对自适应多叉树防碰撞算法在标签识别过程中存在空闲时隙过多、系统吞吐量较低的问题,提出一种基于前缀分组的改进自适应多叉树防碰撞算法。算法分为前缀分组与标签识别两个阶段,前缀分组阶段阅读器使用一个查询周期确定范围内标签的查询前缀,每个前缀代表一个分组。标签识别阶段采用一种改进自适应多叉树防碰撞算法,通过计算碰撞因子,动态选择分裂叉树,在标签数量较少的分支使用碰撞跟踪树算法,反之使用不产生空闲时隙动态四叉树防碰撞算法。理论分析和仿真表明,上述算法减少了系统总时隙,较大程度大提高了系统吞吐量。Aiming at the disadvantages of too many idle time slots and low system throughput in the process of tag identification in the adaptive multi-tree anti-collision algorithm, an improved adaptive multi-tree anti-collision algorithm based on prefix grouping is proposed. The algorithm can be divided into two prefix grouping and label identification two phases. In the prefix grouping phase, the reader uses a query period to determine the query prefix of the label in the range, and each prefix represents a group. In the tag identification phase, an improved adaptive multi-tree anti-collision algorithm is adopted. By calculating the collision factor, the split-fork tree is dynamically selected, and the collision tracking tree algorithm is used in the branch with a small number of tags, otherwise the dynamic quadtree anti-collision algorithm without idle slots is used. Theoretical analysis and simulation results show that the algorithm reduces the total time slot of the system and greatly improves system throughput.

关 键 词：防碰撞 自适应多叉树 前缀分组 碰撞跟踪树 动态四叉树 

分 类 号：TP391.9[自动化与计算机技术—计算机应用技术]