刘培学, 高颖, 陈玉杰. 分组自适应多叉树RFID防碰撞算法研究[J]. 微电子学与计算机, 2014, 31(10): 156-159.
引用本文: 刘培学, 高颖, 陈玉杰. 分组自适应多叉树RFID防碰撞算法研究[J]. 微电子学与计算机, 2014, 31(10): 156-159.
LIU Pei-xue, GAO Ying, CHEN Yu-jie. A Grouping Adaptive Anti-Collision Algorithm Based on Multi-tree Search[J]. Microelectronics & Computer, 2014, 31(10): 156-159.
Citation: LIU Pei-xue, GAO Ying, CHEN Yu-jie. A Grouping Adaptive Anti-Collision Algorithm Based on Multi-tree Search[J]. Microelectronics & Computer, 2014, 31(10): 156-159.

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

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

  • 摘要: 提出了一种基于分组自适应多叉树的RFID防碰撞算法,该算法将标签分为多组并按分组处理标签,减少同一时刻同时响应的标签的数目,从而减少碰撞发生的概率,对同一分组的标签,按照碰撞因子自动选择动态二叉树或动态四叉树搜索,同时采用后退策略。仿真结果表明,该算法在平均查询次数及传输数据量上较其他算法都有较大提高.

     

    Abstract: 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.

     

/

返回文章
返回