并行识别RFID自适应多叉树防碰撞算法  

A Parallel Anti-Collision Algorithm Based on Adaptive Multi-Tree Search

作　　者：白乐强[1] 杨晰[1] 

机构地区：[1]沈阳建筑大学信息与控制工程学院,辽宁沈阳110168

出　　处：《微电子学与计算机》2015年第1期136-139,共4页Microelectronics & Computer

基　　金：国家自然科学基项目(60973022/F020202)

摘　　要：针对自适应多叉树防碰撞算法的吞吐量不稳定性和"误判"问题,提出一种并行识别的RFID标签防碰撞算法.该算法利用OVSF扩频码技术,在时隙内开拓码道,当碰撞发生时能够并行识别标签ID信息,减缓由标签数量增大而造成的碰撞累积.理论分析表明算法的吞吐量随OVSF扩频码码长增大而提高.仿真分析表明该算法有效地提高了RFID系统的防碰撞性能.In order to improve the unstable system throughput and reduce the " misjudgment" issues,this paper proposes a kind of parallel multi-tree search anti-collision algorithm.Using OVSF code spread spectrum technology,the algorithm can develop tracks in a time slot and when collision occurs,it can identify tags concurrently to reduce the accumulated collision.Theoretic analysis proves that the system throughput is improved with the increasing of code length.Simulation results show that the new algorithm has improved the anti-collision performance of RFID system effectively.

关 键 词：RFID 防碰撞 自适应 并行识别 

分 类 号：TP391.44[自动化与计算机技术—计算机应用技术]