Based on the adaptive multi-tree search anti-collision algorithm, we proposed an improved adaptive multi-tree search anti-collision algorithm (IAMS) by optimizing the prefix sent by readers.Our algorithm reduces idle time slots by choosing the number of search tree branches adaptively according to the collision factor and optimizing the query prefix of quadtree. By mathematical analysis, we accurately predict the total number of time slots required for the tag identification in IAMS algorithm. Simulation results show that the IAMS algorithm has faster identification speed and higher system throughput.%文章在自适应多叉树防碰撞算法的基础上,通过优化阅读器所发送前缀的方法,提出了一种改进型自适应多叉树(IAMS)防碰撞算法.该算法通过计算碰撞因子来动态地选择搜索树的叉数,并对四叉树的查询前缀进行优化,从而避免了大量的空闲时隙.文章通过数学分析,准确地描述了 IAMS算法识别标签所需的时隙数.仿真结果表明,改进型自适应多叉树防碰撞算法具有更快的识别速度和更高的系统吞吐率.
展开▼
