改进的二进制搜索防冲突算法  

An Improved Binary Search Anti-collision Algorithm

作　　者：李宝山[1] 乔聪[1] 

机构地区：[1]内蒙古科技大学信息工程学院,内蒙古包头014010

出　　处：《微电子学与计算机》2014年第5期94-97,102,共5页Microelectronics & Computer

摘　　要：射频识别(Radio Frequency Identification,RFID)系统中的多标签冲突问题是不可避免的,防冲突算法是RFID系统中实现标签快速识别的关键.在一些相关的二进制搜索防冲突算法的基础上,提出了一种改进的二进制搜索防冲突算法.该算法利用冲突位构建四叉搜索树,使读写器的搜索次数和发送的信息量大大减少,提高了标签识别效率.实验结果表明该算法明显优于已有的二进制搜索防冲突算法.The problem of Multi-tag collision is inevitable in the RFID system so that anti-collision algorithm is the key to realize the tag identification rapidly .In this paper ,an improved binary search anti-collision algorithm is proposed based on some related anti-collision algorithm .This algorithm uses collision bits to construct quad tree , which reduces the search times and the amount of transmission information of readers to improve the system efficiency .The experimental results show that the proposed algorithm performs significantly better than the existing anti-collision algorithms .

关 键 词：RFID 防冲突算法 二进制搜索算法 冲突位 

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