Research And Design Of RFID Binary Tree Anti-collision Algorithm

In recent years, because of its broad application prospects and huge market potential, the Internet of things has to be known as arriving in thirdly wave of the information industry, information industry is expected to become an important engine. As one of the key technologies of the "Internet of Things" RFID (Radio Frequency Identification),radio frequency identification technology has been rapidly developed, however, there are some technical problems restricting the development of RFID technology, such as cost, collision, standards, middleware, security protocols. Collision problem is divided into reader collision and tag collision, the corresponding solutions collision is called anti-collision algorithm. The reader function is very powerful, and is able to communicate with each other, the reader collision problem is easily solved. In contrast, due to the pins structure, size and function are relatively simple, the problem of collisions between them has became the technical problems the RFID system needs to solve.The topic of this article is to focus on the anti-collision multi-tag RFID systems issues. The research work includes:1. Knowledge of the Internet of Things and its key technologies-RFID radio frequency identification technology overview, including RFID basic composition and working principle, classification, characteristics and uses, work and standard division.2. The focus of this article introduces multi-tag anti-collision of RFID system, the principle and process of the RFID multi-tag anti-collision algorithm principles, models and common multi-tag anti-collision algorithm is also described and analyzed.3. In the existing knowledge on the basis of further binary tree search algorithm improvements, a new algorithm this article described is improved on the basis of the improvement of the backoff binary tree search, the main direction of improvement is the amount of data transmitted per query and query tree path selection. Shorten the length of the query command each time you send and the collision bit adaptive to selecting binary tree or quadtree search to improve the efficiency of the algorithm and system throughput.4. The end of the paper by the mathematical theory analysis and simulation of Matlab software algorithm improved verification and analysis. By analyzing the new algorithm in the amount of data transmission, the number of queries and system throughput, it can be concluded that the new algorithm is significantly better than several common anti-collision algorithm. The innovation of the paper includes:1) The paper uses Manchester encoding to determine the location of the collision, then accrording to the continuous dynamic selection collision bit, we can use either binary tree search or the quad-tree search, thus reducing the total number of queries. Especially when the number of tags is relatively large, it is better to reflect its superiority.2) Reader sends a query command using binary information, without sending the label to indicate the collision bit ID code.This approach reduces the amount of data for each query, thus improves the query rate and the throughput of the entire RFID system.