下载后可任意编辑自适应多叉树防碰撞算法讨论摘 要 该文提出了一种自适应多叉树防碰撞算法。新算法在动态二叉树和四叉树搜索算法的基础上, 利用曼彻斯特编码能够准确识别碰撞位的特性, 经过计算碰撞因子, 估量标签数量, 从而自适应地调整搜索叉数, 即在标签数较多的节点上选择动态四叉树搜索, 而在标签数较少时选择动态二叉树搜索。理论和仿真分析表明: 新算法克服了动态二叉树和四叉树搜索算法的缺点, 在减少碰撞时隙数的基础上, 又减少了空闲时隙数, 大幅度地提高了搜索效率和时隙的吞吐量, 具有一定的创新性和适用性。关键词 射频识别; 防碰撞算法; 多叉树搜索; 中图分类号 TP301.6 文章标识码 AAn Adaptive Anti-collision Algorithm Based on Multi-tree SearchAbstract A new adaptive anti-collision algorithm based on multi-tree search is proposed in this paper. Because Manchester code can identify the position of collision, the new algorithm can adjust the number of search tree adaptively by using the information of probability of collision. That is to say , when the number of tags is large, the new algorithm use four-tree search. Conversely, the new algorithm use binary-tree search. Theory and computer simulations show that the new anti-collision algorithm which overcomes the disadvantages of binary-tree and four-tree algorithms can decrease effectively collision timeslots and idle timeslots and improve the throughput of timeslots.Key words Radio Frequency Identification (RFID); Anti-collision algorithm; Multi-tree search; 下载后可任意编辑1 引言射频识别( RFID) 是20世纪90年代兴起并逐渐走向成熟的一种非接触式的自动识别技术, 在物流、 跟踪、 定位等领域已得到广泛应用。其中, 用于解决读写器作用范围内多标签识别问题的防碰撞算法已成为该领域讨论的热点之一。标签防碰撞算法主要解决在读写器有效通信范围内, 多个标签同时与读写器进行通信的问题。常见的防碰撞算法一般能够分为两类, 一种是基于时隙随机分配的ALOHA算法[1], 包括动态时隙ALOHA(DSA)算法[1], 分群时隙ALOHA算法(GSA)[2]和标签估量算法(...
