分组自适应多叉树RFID防碰撞算法研究  

A Grouping Adaptive Anti-Collision Algorithm Based on Multi-tree Search

作　　者：刘培学[1] 高颖[2] 陈玉杰[1] 

机构地区：[1]青岛黄海学院,山东青岛266427 [2]烟台大学,山东烟台264005

出　　处：《微电子学与计算机》2014年第10期156-159,共4页Microelectronics & Computer

基　　金：国家自然科学基金项目(61201457);山东省高等学校科技计划项目(J12LN83)

摘　　要：提出了一种基于分组自适应多叉树的RFID防碰撞算法,该算法将标签分为多组并按分组处理标签,减少同一时刻同时响应的标签的数目,从而减少碰撞发生的概率,对同一分组的标签,按照碰撞因子自动选择动态二叉树或动态四叉树搜索,同时采用后退策略。仿真结果表明,该算法在平均查询次数及传输数据量上较其他算法都有较大提高.The paper proposed a grouping adaptive multi-tree RFID anti-collision algorithm which divide the tags into many group based on the comprehensive analysis of variety tree-based algorithm ,the tags is handled as group ,the number of responding tags is reduced in the one time ,thereby the probability of collision is reduced ,in the same group ,dynamic or dynamic quad-tree search is selected automatically according to the collision factor with using back strategy ,simulation results show that the algorithm has improved greatly on the average number of queries and the amount of data transmission compared to other algorithms .

关 键 词：射频识别 多叉树 分组 防碰撞 

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