一种优化的RFID标签碰撞二进制搜索算法  

An Optimized Search Algorithm Based on the Binary for RFID Tags Collision

作　　者：时军艳[1,2] 周漪[2] 葛洪央[2] 

机构地区：[1]许昌市耕新信息科学研究院,河南许昌461000 [2]许昌职业技术学院,河南许昌461000

出　　处：《内蒙古师范大学学报（自然科学汉文版）》2015年第2期249-253,259,共6页Journal of Inner Mongolia Normal University(Natural Science Edition)

基　　金：河南省软科学研究计划项目(142400410995)

摘　　要：针对RFID阅读过程中的标签碰撞问题,在二进制树型搜索算法的基础上提出了一种优化的反碰撞算法.该算法通过构建新的请求建立方式,采用两位数仲裁碰撞进行逐位的识别,大大减少了碰撞检测时相应标签的数量,从而减少了位的碰撞概率.仿真结果表明,与基本的二进制树型搜索算法和动态二进制树型搜索算法相比,该算法在传输二进制数据的长度方面有明显的优势,并且在平均请求数量方面,它提供了相同的性能,从而使识别过程更快,减少了信息的传播时间.An improved anti-collision algorithms is proposed based on binary tree search algorithm to the tag collision problem in the process of RFID reading.The algorithm greatly reduces the number of corresponding tag in collision detection and the probability of collision bits,which was established by constructing a new request method and a bit-by-bit identification is used to double-digit arbitration colli-sions.Compared with the basic binary tree search algorithm and dynamic binary tree search algorithm,the simulation results show that this algorithm has obvious advantages in the transmission of binary data.And it provides the same performance in the average number of requests,thus the recognition process faster, reducing the propagation time information.

关 键 词：射频识别(RFID) 碰撞算法 二进制搜索算法 

分 类 号：TP721.1[自动化与计算机技术—检测技术与自动化装置]