一种改进的基于二叉树的防碰撞算法  

An Enhanced Binary Tree-based Anti-collision Algorithm

作　　者：王春华[1] 刘迟时[1] 徐浩[1] 涂羽翔[1] 

机构地区：[1]湖南大学信息科学与工程学院,湖南长沙410082

出　　处：《湖南大学学报（自然科学版）》2013年第8期97-101,共5页Journal of Hunan University:Natural Sciences

基　　金：国家自然科学基金资助项目(61274020);湖南省高校重点实验室开放基金资助项目(12K011)

摘　　要：针对RFID系统中基于二叉树的标签防碰撞算法存在识别时间长、通信数据量大的问题,提出了一种改进的算法.算法充分利用上一次查询的信息,标签根据碰撞位先后应答读写器以减少碰撞的发生.读写器检测到接收的数据中有2个碰撞位即停止接收后续数据,以减少冗余数据的传输.算法将识别范围内所有标签进行分组,并且整个识别过程采用后退策略.仿真结果表明,提出的算法具有较高的识别效率.To solve the problem of too much identifying times and data transmission in some binary tree-based algorithms,an enhanced binary tree-based anti-collision algorithm for Radio Frequency Identification（RFID）system was proposed.The algorithm makes full use of the information of last query,and tags respond to reader in succession according to the first collided bit.Therefore,the probability of collision can be decreased.Reader stops receiving remaining bits immediately while detecting two collision bits in the received data,which can reduce the transmission of redundant data.The algorithm divides all tags into many subsets and adopts backtracking strategy.The simulation results show that the algorithm significantly improves the identification efficiency.

关 键 词：射频识别 防碰撞 ALOHA 二叉树 

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