基于后退式索引二进制树形搜索的RFID防碰撞算法  

Anti-Collision Algorithm for RFID Based on Regressive Index Binary-Tree Searching

作　　者：韩宪明[1] 南敬昌[1] 

机构地区：[1]辽宁工程技术大学电子与信息工程学院,辽宁葫芦岛125105

出　　处：《微电子学》2013年第5期708-712,共5页Microelectronics

基　　金：国家自然科学基金资助项目(60971048);辽宁省博士科研启动基金资助项目(20091033)

摘　　要：在分析目前针对标签防碰撞问题采用的防碰撞算法优缺点的基础上,利用后退式索引二进制树形搜索算法的基本原理,设计了一种RFID标签防碰撞算法。该算法充分利用碰撞节点的信息,采取调整策略,能有效减少数据的传送量,快速高效地识别RFID标签。对该算法进行了仿真分析,结果表明,该算法的执行效率达到50%以上。The advantages and disadvantages of the existing anti-collision algorithm for tag anti-collision was analyzed, and an anti-collision algorithm for RFID tag was designed based on the basic principle of regressive index binary-tree searching algorithm. The algorithm made full use of information about collision nodes and adopted adjustment strategy to effectively reduce the amount of transferred data, and identify RFID tags quickly and efficiently. Simulation results showed that the algorithm achieved an implementation efficiency above 50%.

关 键 词：防碰撞算法 后退式索引 二进制树 射频识别 

分 类 号：TN92[电子电信—通信与信息系统]