一种基于查询树的RFID防碰撞优化算法  

An Optimize Anti-Collision Algorithm for Rfid System Based on Query Tree

作　　者：何少佳[1] 高韵沣[2] 邓子信[2] 石旅光[2] 

机构地区：[1]桂林电子科技大学广西制造系统与先进制造技术重点实验室,广西桂林541004 [2]桂林电子科技大学机电工程学院,广西桂林541004

出　　处：《装备制造技术》2015年第5期53-56,共4页Equipment Manufacturing Technology

基　　金：桂林电子科技大学研究生教育创新计划资助项目(XJYC2012007)

摘　　要：为了提高RFID系统多标签情况下的标签识别效率,分析了现有的二进制树机制算法,提出了一种基于查询树的RFID防碰撞优化算法,旨在减少算法搜索次数和传输数据量。该算法通过引入查询栈以实现带记忆的动态查询来较少搜索次数;通过引用数组和寄存器来存储非碰撞位和碰撞位置并优化查询命令和标签回传信息来减少传输数据量。分析与仿真结果表明,该算法在搜索次数上和在数据传输量上比之经典二进制防碰撞算法有了较大地减少,算法的平均识别效率达到了0.65左右,达到了较高水平。In order to improve the efficiency of tags identification in RFID system with a mass of tags, with analysis over e the existing algorithm with mechanism of the binary tree, this paper proposes an optimized RFID anti-collision algorithm based on query tree, aiming to reduce algorithm＇s search-number and transmission of data. The algorithm introduces query stack to dynamic query with memory in order to achieve fewer search-number, references array and register to store the data of non-collision slot and the number of collision slot, and optimizes query command and tags respond-information to reduce the transmission of data. Analysis and simulation results show that the number of search and the amount of data transmission of the proposed algorithm is significantly reduced compared with the elementary binary anti-collision algorithm, the average identify efficiency is close to 0.71. The performance reaches a higher level.

关 键 词：查询树 RFID系统 防碰撞 标签识别 

分 类 号：TP312[自动化与计算机技术—计算机软件与理论]