改进的二进制搜索防碰撞算法  

Improved binary search anti-collision algorithm in RFID system

作　　者：贾浩[1] 沈岳[1,2] 匡迎春[1] 王金[1] 

机构地区：[1]湖南农业大学信息科技学院,湖南长沙410128 [2]湖南省农村农业信息化工程技术研究中心,湖南长沙410128

出　　处：《微型机与应用》2017年第16期23-25,29,共4页Microcomputer & Its Applications

基　　金：国家科技支撑计划(2012BAD35B05)

摘　　要：针对射频识别(Radio Frequency Identification,RFID)系统中多个标签同时与阅读器交互所产出的碰撞以及二进制搜索算法中出现的信息冗余和搜索效率低的问题,提出了一种改进二进制搜索防碰撞算法。该算法动态地调整阅读器发送的指令,利用标签冲突位构建识别树,从而大幅降低了阅读器与标签的交互次数及传输的数据量,有效地提高了标签识别的效率。通过MATLAB对系统的吞吐率、搜索次数以及阅读器发送的信息量进行仿真,仿真结果表明该算法与已有的二进制搜索算法相比,具有一定优势。Aiming at the issues of the RFID （ Radio Frequency Identification） system such as reader inteact as well as the information redundancy and the lowsearch efficiency in the proccss of binary search algorithm,this essay carries out an improved binary search algorithm for avoiding collision. The algorithm reduccs the data quantity of interaction times and transmission of multiple tags and reader by adjusting the transferred instruction of reader and constructing recognition tree through using tag collision bit, there- fore, it improves the efficiency of label recognition. Through the use of MATLAB, the th ro u g h p u t ,search times of the system and the amount of information transmitted by the reader are simulaled. The result shows that compared to the existed binary seargoritjim has certain advantages.

关 键 词：RFID 二进制搜索 防碰撞算法 碰撞位 

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