一种新型的自适应多叉树抗冲突算法

摘要

针对无线射频识别(Radio Frequency Identification,RFID)系统在识别标签的过程中出现标签碰撞识别效率不高的问题,在传统的自适应多叉树的基础上,提出了一种新型的自适应多叉树(NAMS)的防碰撞算法,该算法在计算碰撞因子选择叉数之前先估算碰撞标签数目N和统计碰撞位数m,直接识别满足N=2m的关系的叶子节点,节省了部分叶子节点的搜索时间；同时引入自动休眠计数机制,平均节省了一半的执行命令数,从而缩短了通信时间.最后对NAMS算法所需总时隙进行理论分析并将该算法用于实验,结果表明,NAMS算法较AMS算法在识别速度和系统吞吐率方面有较大提高.%For the radio frequency identification (RFID) systems,the tag collision brings about low efficiency in the process of tag identification.On the basis of the traditional adaptive multi-tree,it raises a new improved adaptive multi-tree (NAMS) anti-collision algorithm.Before calculating the collision factor and selecting fork number,in the algorithm it first estimated collided tag number N and the statistical collision digit capacity m,directly identified leaf nodes which satisfied the N =2m to shorten the search time; simultaneously it introduced autosleep counting mechanism which decreased on average half of the number of executive commands,thereby shortening the communication time.Finally,the required total number of slots of the algorithm was analyzed and experiments were conducted.The results show that the improved multi-tree anti-collision algorithm has higher recognition speed and system throughput rate than the traditional anti-collision algorithm.