The Research Of Binary Tree Anti-Collision Algorithm Based On RFID System

Radio Frequency Identification (RFID) is a kind of auto-identify technique, which communicates through the non-contact RF signals, so as to achieve objective automatic identification. It is popular in theory and application research. It has many advantages, such as abundant data information, short recognizing time and low cost. RFID technology is widely used in logistics management, public transport, identity recognition, supply management, public safety, tracking and other fields.With the development of RFID technology, how to realize data exchange accurately among the multiple targets at the same time becomes the key problem of RFID technology. RFID anti-collision algorithm is the solution to the problem mentioned above. Among the various algorithms, binary tree algorithm as a deterministic one can effectively solve the collision problem and improve the speed of signal transmission. It can enhance the channel utilization and accuracy, reduce the time slot, and make the system more stable. Therefore, it is widely used in the RFID system, but it also has some shortcomings, such as numerous paging times, long cycle of the identification, large energy consumption, little system throughput.This thesis probes into the RFID system binary tree anti-collision algorithm from the perspectives of both theory and practice. It can be divided into three aspects: Firstly, it describes the idea of the basic binary tree algorithm, and gives an example to demonstrate the basic binary tree algorithm; Secondly, a newly improved binary tree anti-collision algorithm which is based on the existing binary tree anti-collision algorithm puts forward the conception of lock-bit, increases the lock-bit paging commands to lock the bits of a collision, uses binary tree anti-collision algorithm to deal with the locked position, describes the encoding and instructions of the improved binary tree algorithm, discusses the basic principle and workflow of the new algorithm, and gives an example to describe the algorithm. Finally, we do analysis and simulation in the paging number, transmission delay, power consumption and throughput of the new algorithm, simulation and analysis results show that the improved binary tree algorithm has smaller paging number, shorter transmission delay, less power consumption, and higher system throughput than other binary tree algorithm.