Research And Realization On Anti-collision Algorithm Of RFID System

When the traditional RFID collision algorithms in dealing with collisions, the totalnumber of times of the transmission and the total number of bits transmitted are more. Inorder to better solve the upload data collision problems in the situation of more tags in thereader range, the previous collision algorithms are optimized in this paper.This paper first designed the Dynamic Reback binary algorithm based on GroupIdentification,the algorithm combined with the advantages of back-binary algorithm, backto search by recording the collision bits to reduce the total number of transmission data;Combining the advantages of dynamic binary algorithm,sending a portion of the length ofID to replace the entire length of the ID to reduce the total number of bits of datatransmitted;By way of transmitting the data with groups to reduce sending the front IDsegments which have been identified,and decreased the total transmission digits.In theanalysis of the transmission of the total number of digits of the algorithm, it found that thetransmission of the total number of digits of the algorithm can also be optimized.Thenpresents Backtracking Binary anti-collision algorithm based on Stack,by reducing the lengthof the packet ID decrease the total digits of bits of the transmission data of the reader.Finally, the paper realize RFID collision algorithms simulation software.The softwarecan automatically generate fixed-length tag IDs, by these tag IDs to the implement processof the simulation analysis of various algorithms. Through collision simulation softwaresimulations show that the proposed two algorithms transmission efficiency is the basicbinary algorithm and dynamic binary number more than three times of the algorithm. In theefficiency of the total number of bits transmitted, DRGI algorithm is more than three timesof the backward binary algorithm, and the BBS algorithm is close to five times of backwardbinary algorithm. By analyzing the simulation datas, found that the two algorithms proposedin this paper are better than the algorithm in the past on the total number of times of thetransmission and the total number of bits transmitted, especially BBS algorithm, itsefficiency is obvious under the condition of long ID tags.