RFID防碰撞算法的研究

Studies on anti-collision algorithm in RFID

随着物联网技术的高速发展,作为其关键技术之一的RFID显得愈为重要。标签碰撞的应用在RFID系统中是不可避免的,因此RFID防碰撞算法是RFID系统中一个重要问题,直接决定了RFID系统可以识别多个标签的能力。目前防碰撞算法在时域上主要可以分为非确定性算法(ALOHA算法)和确定性算法(树形算法)两大类。本文分析了现存的两大类算法中主流的防碰撞算法,总结出两大类算法的优点以及存在的问题。通过MATLAB仿真进一步证明此结论,并总结未来研究中需要继续关注的问题与方向。

With the rapid development of Internet of Things, the RFID, as one of the key technologies, seem very important. Tag collision is inevitable applied in the RFID system, RFID anti-collision algorithm in RFID system is an important issue, directly determine the ability of the RFID system to identify multiple tags. Currently, anti-collision algorithm can be divided into the uncertain algorithm （ALOHA algorithm） and certainty algorithm （tree algorithm） in the time domain. This paper analyzes the main anti-collision algorithm in the existing two-class algorithm obtained the advantages and disadvantages of the two major categories of algorithms and the problems. This conclusion is further evidence of the MATLAB simulation, and summarizes the issues and directions for future research needs to continue to focus on.