基于B+树的RFID防碰撞算法分析与改进  

Analysis and Improvement of RFID Anti-collision Algorithm Based on B+ Tree

作　　者：孙建锋[1] 冯超[1] 张权[1] 

机构地区：[1]国防科学技术大学电子科学与工程学院,长沙410073

出　　处：《计算机工程》2013年第9期49-51,58,共4页Computer Engineering

基　　金：国家自然科学基金资助项目(61101073)

摘　　要：介绍基于B+树的无线射频识别防碰撞算法,分析不同分裂阶数对识别效率产生的影响。发现随着分裂阶数取值增大,标签分裂过程中产生的碰撞时隙减少但空闲时隙增多,导致算法整体识别效率下降。针对该问题,提出一种改进算法。利用阅读器动态控制标签的分裂过程,使碰撞时隙和空闲时隙共同减少。同时考虑到标签的资源限制,不改变标签原有的硬件配置。实验结果表明,改进算法可提高识别效率、减小通信处理开销,适用于标签数量较大的应用场合。This paper introduces Radio Frequency Identification（RFID） anti-collision algorithm based on B＋ tree, and analyses the influence of different splitting order to recognition efficiency. It finds that when the splitting order increased, the collision slot is reduced but the idle slot is increased, which in turn reduces the efficiency of the algorithm. Aimming at this problem, this paper proposes an improved algorithm. The improved algorithm reduces the collision slot and idle slot simultaneously by modifying the execution procedure and controlling the splitting dynamically. It considers the limitation of resources on the tag and does not increase the hardware configuration. Simulation result demonstrates that this improved algorithm can improve the efficiency of system recognition under the circumstances of a large number of tags, while keep the communication cost low.

关 键 词：无线射频识别 防碰撞算法 B+树 大规模标签 识别效率 分裂阶数 动态控制 

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