基于搜索树的增强型RFID防碰撞算法  

AN ENHANCED RFID ANTI-COLLISION ALGORITHM BASED ON SEARCH TREE

作　　者：韦冬雪[1] 郑嘉利[1] 黄庆欢[1] 邓林[1] 

机构地区：[1]广西大学计算机与电子信息学院,广西南宁530004

出　　处：《计算机应用与软件》2015年第11期226-231,共6页Computer Applications and Software

基　　金：国家自然科学基金项目(61261023);广西自然科学基金面上项目(2011GXNSFA018169);广西自然科学基金青年项目(2012GXNSFBA053160);广西科学研究与技术开发计划课题(12118017-9A)

摘　　要：针对RFID系统中采用多叉树搜索时存在空闲时隙、对碰撞节点处理缓慢等不足,提出一种基于搜索树的增强型RFID防碰撞算法。新算法利用读写器检测相邻碰撞位的个数,在搜索过程中不断自适应调整子二叉树的分配个数,综合选择无空时隙八叉树或四叉树或二叉树搜索方式。为消除多叉树搜索中产生的空闲时隙,阅读器先发送一个获取前缀命令确定标签前缀。理论分析和仿真结果表明,新算法的性能优于其他常用的标签防碰撞算法,大幅度减少了搜索总时隙数,降低了标签功耗,提高了系统搜索效率。In view of the problems existed in RFID system when using multi-tree search such as idle slot and slow processing on collision nodes, we proposed a search tree-based enhanced RFID anti-collision algorithm. The new algorithm uses the reader to detect the number of adjacent collision bits, and constantly adjusts the number of sub binary tree distribution adaptively in search process, as well as comprehensively chooses the non-void slot octree or quadtree or binary tree search mode. To eliminate idle slot generated in multi-tree search, the reader will send a Get prefix command in advance to determine the label prefix. Theoretical analysis and simulation results show that the performance of new algorithm is superior to other commonly used tag anti-collision algorithms. It significantly reduces the total number of search slots, diminishes the power consumption of tags, and increases the search efficiency of the system.

关 键 词：RFID 防碰撞 多叉树 

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