Research And Realization Of Anti-collision Algorithm In The Multiple Tags RFID System

With the development of the technology and application of the Internet ofThings, the application of RFID (Radio Frequency Identification) technology isbecoming border. In the practical application, when multiple tags in an independentspace response to a reader at the same time, or multiple readers request the samelabel to give the response at the same time, the collision can be formed..To solve thisproblem of collisions collectively refers to as anti-collision algorithm, this paperfocuses on multi-tag anti-collision algorithm.Among various multi-tag anti-collision algorithms,the determined binary treealgorithm and statistical ALOHA algorithm are most widely applied. A further studyand give out suggestion to improve it has some theoretical and practical significance.Field Programmable Gate Array (FPGA) as a field-programmable ASIC, has manyadvantages such as high-speed, programmable adapting algorithm processing,opening up a effective avenues for RFID anti-collision algorithm implemented.This paper studies the multi-tag anti-collision and algorithm solving it in RFIDsystem: First, giving a brief introduction of RFID system, the knowledges of theworking principle of the formation mechanism of the collision problem;then,summary existing commonly used anti-collision algorithm, focusing on thebasic binary tree algorithm, dynamic binary tree algorithm and Tarjan style binarytree algorithm,comparing the pros and cons of these three. Synthesizing the benefitsof dynamic binary tree algorithm and Tarjan binary tree algorithm, bring furth theproposed improved binary tree algorithm and its performance analysis; Comparingthe improved binary tree algorithm with dynamic binary tree algorithm, and Tarjanstyle algorithm;Finally, verifying the improved binary tree algorithm based FPGAmodule dividedly.The improved algorithm uses a dynamic change carry command parameters toachieve instruction information to carry less, fast transmission speed, but TarjanSearch ideas, so the number of improved algorithm traverses more basic binary tree algorithm significantly reduced, which also shorten the multi-tag identificationtime.The new improved algorithm, using the dichotomy from the highest impact astart group identification and reduces the search range,shorten the search path,greatly improving the recognition efficiency.