摘要： 针对目前二进制搜索防碰撞算法存在查询搜索次数多、数据传输量大、识别时间长等问题，提出一种基于计数机制的多状态二进制搜索防碰撞算法。经过预处理得到标签的冲突信息，在多状态二进制搜索中引入最高冲突位计数机制。仿真结果表明，与传统的二进制搜索防碰撞算法相比，该算法减少了读写器的查询搜索次数、读写器发送命令和标签每次响应命令的数据长度，以及识别读写器读写范围内标签的时间。

关键词: 无线射频识别技术, 防碰撞算法, 二进制搜索, 曼彻斯特编码, 多状态二进制搜索, 计数

Abstract: Focusing on the disadvantages of the binary search algorithm such as much query search times, large amount of data transfer and recognition for a long time, an multi-state binary anti-collision algorithm based on counting mechanism is developed. By utilizing the obtained collision information collected form preprocessing, the supreme conflict counting mechanism is introduced into the multi-state binary search algorithm. Experimental results show that the proposed algorithm can greatly reduce the query search times, the length of reader’s send command and tag’s response command as well as the identification time of recognition on tags in read range of the reader, combined with the traditional binary anti-collision algorithms.

Key words: Radio Frequency Identification(RFID) technology, anti-collision algorithm, binary search, Manchester coding, multi-state binary search, counting

中图分类号: 

• TP301.6