一种新的自调整多叉树防碰撞算法  

A New Anti—collision Algorithm Based on Adjustive Multi—tree

作　　者：任少杰 郝永生[1] 许博浩 彭博[1] 

机构地区：[1]军械工程学院,石家庄050000 [2]电子信息系统复杂电磁环境效应国家重点实验室,河南洛阳471003

出　　处：《计算机测量与控制》2015年第12期4180-4183,共4页Computer Measurement &Control

摘　　要：针对标签碰撞问题进行了研究,提出了一种新的自调整多叉树防碰撞算法;新算法采用曼彻斯特编码准确判断碰撞位置,根据碰撞位类型的不同自动调整搜索树的叉数;引入异或运算优化查询请求,避免了标签识别过程中不必要空闲时隙的产生;利用二进制数替代标签EPC码,很大程度上减少了通信量;通过理论分析,准确计算出新算法的性能参数;利用Matlab平台对新算法和其他4种常见算法进行了对比仿真实验,仿真结果表明:新算法在总时隙、吞吐率以及通信复杂度等方面都表现出良好的性能。A new anti--collision algorithm based on adjustive multi--tree is proposed for the problem of tag collision. The new algorithm adjusts the type of tree automatically by judging the location of collision accurately based on Manchester encoding, pulls in exclusive or opera- tion to optimize the query request so that lots of unnecessary idle timeslots will be reduced and reduces the complexity of communication through using binary numbers to replace the tag ID code. Through theoretical analysis, we calculated the performance parameters of the new algorithm accurately. Finally, the new algorithm and other four kinds of common algorithms were compared on Matlab, The simulation ex- periments show that the new algorithm has good performance in several aspects, such as total timeslots, throughput and communication com- plexity.

关 键 词：射频识别 防碰撞算法 二叉树 四叉树 自调整 

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