基于先验知识的自适应多叉树防碰撞算法  

Adaptive Multi-way tree Anti-collision Algorithm Based on Prior Knowledge

作　　者：丁治国[1] 朱学永[1] 

机构地区：[1]解放军电子工程学院信息管理中心,合肥230037

出　　处：《计算机工程》2014年第2期303-307,共5页Computer Engineering

基　　金：中国博士后科学基金资助项目(2012M512079)

摘　　要：为提高无线射频识别(RFID)系统快速识别大量标签的能力,提出一种基于先验知识的自适应多叉树防碰撞算法。利用标签访问的规律性和标签分布的随机性,在不同的搜索深度,根据已有的先验知识和碰撞比特信息估计待识别的标签数量,从而动态地自适应选择搜索叉树。通过有效减少碰撞和空闲时隙数,大幅提高读写器搜索和识别标签的能力。理论分析与仿真实验结果表明,该算法能克服传统自适应多叉树防碰撞算法的缺点,合理选择初始搜索叉树,尤其在待识别标签数量较多的场合,可有效提高RFID系统的吞吐率。In order to enhance the ability of Radio Frequency Identification（RFID） systems to identify a large number of tags, an adaptive multi-way tree anti-collision algorithm based on prior knowledge is proposed. The new algorithm can estimate the number of tags and adjust the number of search fork in different branches and depths dynamically according to the regularity and random distribution of tags. According to the prior knowledge, the new algorithm can enhance the search efficiency. Theoretical analysis and simulation results show that the new algorithm overcomes the shortcomings of the traditional multi-way tree anti-collision algorithm, it can effectively improve throughput of RFID systems especially when the number of tags is large.

关 键 词：无线射频识别 防碰撞算法 多叉树 先验知识 搜索叉数 吞吐率 

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