基于映射分组的改进型碰撞跟踪树算法  

An Improved Collision Tracking Tree Algorithm Based on Mapping Grouping

作　　者：刘本超 杨恒新[1] 张昀[1] LIU Ben-chao;YANG Heng-xin;ZHANG Yun(School of Electronic Science and Engineering,Nanjing University of Posts and Telecommunications,Nanjing 210003,China)

机构地区：[1]南京邮电大学电子科学与工程学院,江苏南京210003

出　　处：《计算机技术与发展》2018年第7期78-82,共5页Computer Technology and Development

基　　金：国家自然科学基金青年科学基金项目(61302155)

摘　　要：随着物联网技术的发展,射频识别(RFID)技术已得到越来越广泛的应用,但标签碰撞问题严重制约了RFID系统的性能。因此,防碰撞算法成为解决该问题的关键。为了提高RFID系统的识别效率,减少识别时间,在碰撞跟踪树算法的基础上,对标签ID碰撞位进行跟踪,提出了基于映射分组的改进型防碰撞算法。该算法通过一个查询周期锁定标签碰撞位,将非碰撞位存入堆栈,作为标签的临时ID进行后续的查询操作,有效去除了非碰撞位的干扰,减少了查询深度;同时引入映射码,自适应地调整查询前缀,既消除了空闲时隙,又降低了系统通信量。仿真结果表明,该算法相比基本碰撞跟踪树算法,节约了30%的时隙数,识别效率提高了22%,通信量降低了约68%。尤其在标签碰撞位较少时,算法性能达到最优。With the development of Internet of Things technology,radio frequency identification（ RFID） technology has been more and more widely used.But the tag collision severely restricts the performance of RFID systems.Therefore,the anti-collision algorithm becomes the key to solve the problem.In order to improve recognition efficiency and reduce recognition time in RFID system,we propose an improved collision tracking tree algorithm based on mapping grouping. It locks the tag collision bit by a query cycle and stores it into the stack as the label of the temporary ID for follow-up query operation for removing of the interference of the non-collision bits and reduction of the query depth.At the same time,by introducing of mapping code,the algorithm adjusts the query prefix adaptively,which not only eliminates the idle time slot,but also reduces the system traffic. The simulation shows that compared with the basic collision tracking tree algorithm,the proposed algorithm saves the number of time slots by 30.7%,improves the efficiency by 22%,and reduces the traffic by about 68%.Especially when the collision bits are less,its performance is optimal.

关 键 词：射频识别 映射码 堆栈 查询前缀 碰撞位 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]