一种基于混合树防碰撞算法的改进算法  

AN IMPROVED ANTI-COLLISION ALGORITHM BASED ON HYBRID QUERY TREE

作　　者：张秀艳[1] 吴丹[1] 顾婉莹 

机构地区：[1]东北石油大学电气信息工程学院,黑龙江大庆163318

出　　处：《计算机应用与软件》2017年第2期295-298,333,共5页Computer Applications and Software

摘　　要：由于无线射频识别技术RFID(Radio Frequency Identification)现广泛应用于各个领域中,标签的碰撞问题也成为一个待解决的重要问题。根据现有多叉树防碰撞算法提出一种动态自适应多叉树防碰撞算法(DIHQT)。该算法根据碰撞位最高三位的连续性自行调节算法的搜索叉数,在没有附加查询的条件下,动态自适应地选择二叉树、四叉树或八叉树来查询标签ID编码。通过对算法性能分析和仿真实验结果可以表明,DIHQT算法在时间复杂度上有约200次的减少,以及识别效率上较其他算法都有约5%提高。The Radio Frequency Identification system,which is widely used in various fields nowadays,leads that the tags collision problem an important problem to be solved. A new dynamic adaptive anti-collision algorithm（DIHQT） is proposed based on the existing multi-tree search anti-collision algorithm. According to the features of the highest three collision bit,this algorithm self-adjusts the search tree branches in the absence of additional query,and chooses binary tree,quad tree or octree to query the label codeautomatically. Experimental results of the performance analysis and simulation show that the DIHQT algorithm has 200 times decrease in complexity communication complexity and a 5% increase in recognition efficiency than those of other multi-tree algorithms.

关 键 词：防碰撞算法 混合树 射频识别技术 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]