The Research On RFID Conlision Torlerance Algorithm In Storage Resource Management System

In recent years, with the rapid development of Io T(Internet of Things, IoT) industry and continuous construction of information collecting channel, Radio Frequency Identification technology(Radio Frequency Identification, RFID) with unique advantages, is more and more mature in the aspect of information perception, collection, data processing, and has been successfully applied in industrial automation, transportation management, business automation, logistics management, financial transactions, wild animal monitoring, military automation and many other fields. As a substitute for bar code technology, RFID is integrated waterproof antimagnetic, strong penetrability, large storage, fast and long distance identification and other advantages in one, and combined with the Internet to trigger a revolution of great significance of the IoT.In this paper, we mainly study the anti-collision algorithm in RFID system, then conduct the algorithm design and performance evaluation with the application background of storage resource management. In storage resource management system, the real-time inventory of goods at high speed can provide scientific theoretical basis for purchasing department and continuous supply of procurement, with the purpose of reducing financial and inventory accumulation space cost because of blind procurement. Depending on the unique advantages, RFID possesses monopoly position in resources management, but multiple tags may reply at the same time which causes collision seriously and affects the time efficiency of the whole system. The most existing algorithms are poor timeefficiency, higher energy consumption and too complexity to realize, which are much more difficult to specifically and efficiently solve the collision during inventory counting and replenishment progress in storage resource management system.In order to solve the low time-efficiency during the counting inventory progress, firstly, we introduce classical EPC algorithm, which can accurately identify the tags with the reader’s inquiry scope and avoid collision through ACK. Then, we propose AA algorithm which is based on multiple hash and the reuse of collision slots, AA identifies the catagories information, then each tag, but it is still confined to the traditional that single time slot only can identify one tag successfully. At last, we put forward UACP, the collision tolerance algorithm, which firstly uses the orthogonal code to compile tag category ID, and relies on the correlation to extract the collision signals, then borrows the similar principle quickly detecting each categories’ situation. UACP analyses the missing ratio, mis-judged ratio of received signals, and gives the dynamic frame length determination method, in the final chapter is verified the better performance by simulation. In the summarized and predicted chapter, we summarize the full text and analyze the shortcomings for further working.