基于启发式函数多叉树防碰撞算法.docVIP

基于启发式函数多叉树防碰撞算法 　　摘要:为克服传统二叉树防碰撞算法搜索效率低的缺点,提出了一种基于启发式函数的自适应多叉树防碰撞算法。新算法通过定义和计算启发式函数,有效地利用碰撞比特信息来估计节点内待识别标签的数量。新算法根据节点内的标签数量,可在不同节点和深度,自适应地调整搜索叉数,从而有效地提高了算法的搜索效率。理论分析和仿真实验证明:新算法克服了传统防碰撞算法的缺点,尤其在待识别标签数量较多场合,可有效地减少搜索和识别时间,提高射频识别系统的吞吐率。 　　关键词:射频识别;防碰撞算法;启发式函数;多叉树;吞吐率 　　中图分类号: TP18;TP301.6;TN911.23文献标志码:A 　　Multi-tree anti-collision algorithm based on heuristic function 　　英文作者名DING Zhi-guo1*, ZHU Xue-yong1, LEI Ying-ke2, WANG Xin-ling1 　　英文地址(1.Management Center of Network and Information, Electronic Engineering Institute of Hefei, Hefei Anhui 230037, China; 　　2.Department of Information, Electronic Engineering Institute of Hefei, Hefei Anhui 230037, China) 　　Abstract: In order to overcome the low efficiency of traditional binary-tree anti-collision algorithms, an adaptive multi-tree anti-collision algorithm based on heuristic function was presented in the paper. By defining the heuristic function which was computed by the number of collision bits, the new algorithm can estimate the number of tags in the branch effectively. Because the new algorithm can adjust the number of searching fork in different branches and depths dynamically, it improves the searching efficiency. The theoretical analyses and simulation results show that the new algorithm overcomes the deficiency of traditional algorithms. For the large number of tags in particular, it can reduce the searching and recognition time and increase the throughput of Radio Frequency IDentification (RFID) system. 　　Key words: Radio Frequency IDentification (RFID); anti-collision algorithm; heuristic function; multi-tree; throughput 　　0引言 　　射频识别(Radio Frequency IDentification, RFID)作为新一代非接触式自动识别技术在物流、销售、跟踪和定位等领域已得到广泛应用。随着有源标签的出现和RFID技术在高速移动物体中的应用,迫切需要读写器在有限时间内快速地识别大量标签。标签防碰撞算法就是要解决多个标签与读写器同时进行通信的问题。 　　传统的防碰撞算法基于时分多路技术,一般可分为两类：一类是基于时隙随机分配的ALOHA算法[1-4],其特点是算法简单,便于实现,适用于低成本RFID系统。但由于该类算法存在“Tag starvation”问题,所以被称为可能性方法。另一类是基于二叉树的搜索算法[5-8],该类算法比较复杂,识别时间较长,但不存在“Tag starvation”问题,故被称为确定性方法。该类方法往往对标签的设计要求较高,如增加随机数产生器