改进的二进制查询树的RFID标签防碰撞算法  

Improved binary query tree algorithm for anti-collision of RFID tags

作　　者：单承赣[1] 余春梅[1] 王聪聪[1] 

机构地区：[1]合肥工业大学计算机与信息学院,安徽合肥230009

出　　处：《合肥工业大学学报（自然科学版）》2008年第11期1801-1804,共4页Journal of Hefei University of Technology：Natural Science

摘　　要：在射频识别系统中,存在阅读器与多个标签同时通信的碰撞问题,标签的防碰撞算法是解决数据冲突的关键。文章详细阐述了已有的典型的二进制查询树的防碰撞算法,并在此基础上提出了一种新的防碰撞算法;该算法利用二时隙的方法,使阅读器的询问次数和标签识别所需的数据流大大减少,提高了标签的识别效率。从仿真实验中表明,该算法比已有的二进制查询树算法具有更明显的优势。In the RFID system, the anti-collision algorithm is used to avoid the data collision resulting from the data transaction between the reader and multiple tags at the same time. In this paper,the binary tree based algorithm is analyzed in detail, and a new anti-collision algorithm is put forward. The new algorithm adopts the binary slotted query tree algorithm, which largely reduces both query frequency and data iteration, and also improves identification efficiency. According to the simulation results, the new algorithm has more obvious advantages than the binary query tree algorithm.

关 键 词：射频识别 防碰撞算法 时分多址 二进制查询树算法 

分 类 号：TN015[电子电信—物理电子学]