改进的RFID标签识别防冲突算法  

Improved anti-collision algorithm for tag identification in RFID systems

作　　者：王春华[1] 许静[1] 彭关超[1] 李湛[1] 

机构地区：[1]湖南大学计算机与通信学院,长沙410082

出　　处：《计算机工程与应用》2011年第31期104-107,219,共5页Computer Engineering and Applications

基　　金：湖南省长沙市科技计划重点项目(No.K0902012-11);湖南省科技计划项目(No.2010GK3052)

摘　　要：针对射频识别(RFID)系统中多个标签同时与读写器进行数据交换时引起的冲突问题,提出了一种改进型的基于堆栈的RFID二进制树防冲突算法(IBSTS)。该算法利用位冲突检测机制,有效地降低了冲突的概率;并采用堆栈方法避免了识别过程中每次从树根部进行请求的不足,进一步降低了请求次数,提高了识别效率;利用该算法可以准确地判断出每位冲突位,故而在标签响应时仅需要发送冲突位上的数据,从而降低了标签传输的数据量。仿真结果表明,相对于传统的二进制树防冲突算法而言,提出的算法在读写器请求次数和标签传输数据量方面均有很大降低,尤其在标签数量较多时,其降低的程度更为显著。In order to avoid the problem of the tag collision in a Radio Frequency Identification（RFID） system,this paper proposes an Improved Binary Search Tree anti-collision algorithm based on Stack（IBSTS）.The bit collision detection is adopted in this algorithm,which effectively reduces the probabilities of collision.And the stack is also used,therefore the total times of identification are further reduced and the efficiency is improved.It can accurately determine where a collision arises,and only the data from collision bit is needed,then the transferred data is reduced.The simulation result shows that the proposed algorithm can significantly reduce the times of identification and the transferred,and the effect of performance improvement is more obvious when the system has a large amount of tags.

关 键 词：射频识别 防冲突 二进制搜索树 堆栈 

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