物联网中RFID位匹配防碰撞算法  

RFID bit match anti-collision algorithm in Internet of things

作　　者：江雨[1] 马满福[1] 

机构地区：[1]西北师范大学数学与信息科学学院,甘肃省物联网工程研究中心,兰州730070

出　　处：《计算机应用研究》2012年第1期88-91,共4页Application Research of Computers

基　　金：国家教育部科学技术研究重点资助项目(208148);甘肃省科技攻关项目(2GS064-A52-035-03)

摘　　要：在对现有的二进制搜索算法、4线树形查询算法及混合查询树算法进行理论分析的基础上,提出了一种基于碰撞位匹配的自适应混合树防碰撞算法。新算法是根据检测标签EPC编码最高碰撞位连续个数的匹配信息,在二叉树和四叉树中进行动态自适应地选择分叉数,引入堆栈和后退策略,使得搜索性能进一步改善。通过对算法的分析和仿真实验结果,新算法有效地减少了识别总次数,缩短了识别时间,大幅提高了搜索效率和吞吐率。This paper analyzed the existing binary query tree algorithm,4-ary query tree algorithm and hybrid query tree algorithm.Then it presented the adaptive hybrid collision-bit tree which was based on the matching of anti-collision algorithm.New algorithm was based on the highest collision detection code tag EPC number of consecutive matching information,then adaptively selected the bifurcation in the binary tree and the quadtree.The search performance of the algorithm was further improved by introducing the stack and back strategies.Through analysis of the algorithm,the simulation results show that the new algorithm effectively reduces the total number of identified,shortens the identification time,and significantly improves the search efficiency and throughput.

关 键 词：物联网 射频识别 位匹配 混合树 防碰撞 

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