基于标签信息分组的射频识别防碰撞算法  

Anti-Collision Algorithm for RFID Systems Based on Tag Information Grouping

作　　者：李波[1] 

机构地区：[1]华南理工大学电子与信息学院,广东广州510640

出　　处：《华南理工大学学报（自然科学版）》2011年第7期32-37,共6页Journal of South China University of Technology(Natural Science Edition)

基　　金：教育部高等学校博士学科点专项科研基金资助项目(20090172120040);广东省自然科学基金资助项目(8451064101000313)

摘　　要：射频识别系统在读取标签时,会因碰撞问题而严重影响识别率,导致系统工作效率降低.为此,文中提出一种基于标签信息分组的射频识别防碰撞算法.该算法根据标签信息将标签划分成若干组,按分组顺序依次识别,通过减少同时响应阅读器命令的标签数量来达到降低标签碰撞概率的目的.文中还对算法中的分组效率和时隙选择问题进行了分析、证明和仿真.结果表明,文中算法能够降低碰撞概率,提高系统的识别效率,其性能优于目前最常用的二叉树算法和ALOHA算法.When there is more than one tag to simultaneously transmit their data to the reader of radio frequency identification（RFID） systems,the mixing signals may collide and the reader can not identify what is received,which may significantly reduce the identification rate and the working efficiency of RFID systems.In order to solve this problem,an anti-collision algorithm for RFID systems based on the tag information grouping is proposed,in which the tags are divided into several groups according to the information stored in them,the groups are orderly identified according to the grouping sequence,and the colliding probability is reduced by decreasing the number of tags responding to the reader＇s order.Moreover,the grouping efficiency and the timeslot selection of the proposed algorithm are analyzed,verified and simulated.The results show that the proposed algorithm is superior to the common binary tree algorithm and the ALOHA algorithm because it reduces the collision probability and improves the group identification efficiency.

关 键 词：射频识别 防碰撞算法 标签信息 伪随机数发生器 

分 类 号：TN92[电子电信—通信与信息系统]