Radio Frequency Identification (rfid) Collision Algorithm Research

In recent years, automatic identification method is quickly populaized and promoted in the sale of goods and enterprise production, materials circulation areas.The mission and purpose of automatic identification is to provide information on the subject identified as individuals, animals and goods.With the popular application of the radio technology and large scale integrated circuits during the last decade, Radio Frequency Identification (RFID) which is an advanced automatic recognition and data collection technology is developed. The RFID technology can take advantage of the radio waves to identify the high efficient automatic recognition of the people and animals or the goods. The basic principle of RFID is to use the electromagnetic coupling between reader and electronic tags to realize data communication, so as to achieve the electronic tag and the representatives of the object identification purposes.Firstly, this paper presents a simple introduction to the theory of the composition, classification, working principle, data integrity and security and technical standards for radio frequency identification system, and then focuses on the existing anti-collision algorithm in RFID, various existing the algorithm performance analysis and simulation and analyzes their advantages and disadvantages. Finally, it combines these two basic algorithms ALOHA algorithm and binary-tree searching algorithm and proposes the improved algorithm.The improved algorithm combines the advantages of two basic algorithms:probabilistic algorithms and deterministic algorithms.According to the deficiencies of the existing algorithm and utilization of grouping capabilities, it improves system efficiency of the query tree algorithm. The final chapter of the paper proposes the principle of new algorithm, through the platform of MATLAB simulation, the results show that the system efficiency of the new algorithm is superior to the existing algorithms.