改进型自适应多叉树防碰撞算法研究  

One Anti-Collision Algorithm Based on Improved Adaptive Multi-Tree Search

作　　者：张学军[1] 蔡文琦[1] 王锁萍[1] 

机构地区：[1]南京邮电大学电子科学与工程学院,江苏南京210003

出　　处：《电子学报》2012年第1期193-198,共6页Acta Electronica Sinica

基　　金：国家自然科学基金(No.60806027;No.61001077);江苏省高校自然科学基金(No.08KJB510015);南京邮电大学引进人才项目(No.NY208048)

摘　　要：文章在自适应多叉树防碰撞算法的基础上,通过优化阅读器所发送前缀的方法,提出了一种改进型自适应多叉树(IAMS)防碰撞算法.该算法通过计算碰撞因子来动态地选择搜索树的叉数,并对四叉树的查询前缀进行优化,从而避免了大量的空闲时隙.文章通过数学分析,准确地描述了IAMS算法识别标签所需的时隙数.仿真结果表明,改进型自适应多叉树防碰撞算法具有更快的识别速度和更高的系统吞吐率.Based on the adaptive multi-tree search anti-collision algorithm, we proposed an improved adaptive multi-tree search anti-collision algorithm （IAMS） by optimizing the prefix sent by readers. Our ＂algorithm reduces idle time slots by choosing the number of search tree branches adaptively according to the collision factor and optimizing the query prefix of quadtree. By math- ematical analysis, we accurately predict the total number of time slots required for the tag identification in IAMS algorithm. Simula- tion results show that the IAMS algorithm has faster identification speed and higher system throughput.

关 键 词：射频识别 防碰撞算法 多叉树 自适应 

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