【摘要】 针对在标签数量较多、运动较快的场合,常存在识别效率低且标签漏读率高的问题,提出一种先分组再处理的防碰撞算法——PAJS。该算法按照到达顺序对标签进行分组,以减小漏读率;根据标签识别过程中时隙状况自适应调整帧长度,提高算法的搜索效率;采用跳跃式动态搜索算法处理冲突时隙,从而减少搜索次数和系统传输量。Matlab仿真结果表明,该算法通信复杂度明显小于其他常用算法,吞吐率可达0.59～0.6。在待识别标签较多的场合,该算法优越性更加明显。更多还原

【Abstract】 Concerning the problems of low recognition efficiency and high misreading rate on the occasions of many tags which move fast,an anti-collision algorithm based on packet-first then handling-second was proposed.The algorithm reduced the misreading rate by to grouping the tags according to the order of arriving,it could adaptively adjust frame length based on slot situation to improve the search efficiency,and use jumping dynamic searching algorithm to deal with conflict slots,which could reduce the number of search for readers and the transmission of system.Matlab simulation results show that the algorithm’s communication complexity is lower than other commonly used algorithms,and throughput can achieve 0.59~0.6.The larger the number of tags is the more obvious superiority of the algorithm is.更多还原