Research On Anti-collision Algorithm In RFID System

RFID(Radio Frequency Identification)is a kind of auto-identify technology that has been developed since 1980s. It can be used to follow and identify almost all physical objects. It has been developed quickly in recent years. RFID has a lot of advantages. The development of RFID will bring huge effect to our life. Anti-collision algorithm is a crucial factor to the performance of RFID system, i.e. whether the reader can identify tags quickly and exactly when there are many tags.In this paper, we introduce the basic thery of RFID technology, including development status, working principle and composition parts. The main content of this study is the anti-collision algorithm. At present, the anti-collision algorithms almost use the time division multiple access protocols. It makes the tag occupy channel in some single slot, so that it can communicate with reader. The main anti-collision algorithm includes binary search algorithm, dynamic binary search algorithm, ALOHA algorithm, slot ALOHA algorithm, frame slot ALOHA algorithm etc. The identification accuracy of binary search algorithm is effective, but the hardware is not easy to realize. Although the ALOHA algorithm is easy to carry out, it has randomness. In a word, the anti-collision algorithm is not perfect. The system slot number and throughput need further improve. The study aim of this paper is to design an algorithm which has less slots and higher throughput.The innovation of this paper is that a new anti-collision algorithm is proposed after we analyse the former theory. This new algorithm is an improvement on the basis of fixed frame slot algorithm. It is proved to be effective by experiment.