The Research Of Multi-tag Anti-collision Technology In RFID System

Radio Frequency Identification (RFID) is an automatic identification technology which is rising and growing to maturity in recent years. The way of communicating in RFID system is RF non-contact form. In RFID system, when there are a number of tags who send their UIDs at the same time,collision would take place.There must be some anti-collision algorithms to solve this problem. In this paper the focus of the study is the RFID system's multi-tag anti-collision technology.Firstly,this paper introduces the history and developing status quo of RFID system and discusses the working principle of it. Subsequntly,this paper sets the ISO / IEC 18000-6 TypeB Protocol as an example to study the communicating flow as well as anti-collision algorithm in this protocol in detail.Then,this paper introduces the ALOHA algorithm, the binary tree algorithm and other algorighms that are based on the former two. By analyzing theoretically and simulating these algorithms,find the advantages and disadvantages and applicating occasion of each algorithm.Combining the advantages of the returned binary tree searching algorithm and the dynamic binary tree searching algorithm. This paper makes some improvement of the binary tree searching algorithm. By C language simulation and theoretical analysis, the algorithm can improve the efficiency of multi-tag identification in RFID system to a certain extent theoretically.Finally,summerizing this paper and proposing prospects for the future work.