Research On Anti-collision Algorithm Of RFID Tag Based On Multi-tree

Radio Frequency Identification(RFID)has been widely used due to its convenience of automatic identification.With the rapid development of computers and communications,the use of RFID technology will become more popular in the future.The principle of RFID technology is that the reader and the recognized electronic tag communicate with each other in the same channel by radio waves.In the process of communication,if there are multiple tags in the channel and respond to the reader at the same time,then at this point,the reader will fail to read the electronic tag,which is called the collision of the tag.As the number of tags in RFID technology scenarios increases,so does the collision between tags.Therefore,solving the collision of labels and establishing an effective anti-collision mechanism has become a research hotspot at home and abroad.In the anti-collision algorithm of many tags,the anti-collision algorithm of deterministic tree structure can fully recognize the electronic tag.This paper is based on the tree structure multi-tree anti-collision algorithm as the research direction.It mainly introduces the current use and research status of RFID technology,the composition and working principle of RFID system,several typical anti-collision algorithms,and the following improvements on the basis of multi-tree anti-collision algorithm:(1)The encoding method using m-M enables the anti-collision algorithm to update multiple collision bits at a time.(2)Through the research of tag adaptive recognition algorithm,the improved tag adaptive recognition algorithm(IACT)using different m-trees is simulated to determine the optimal m-tree as a quadtree.(3)Using the array storage method instead of the stack storage method,it is verified by simulation experiments that the array storage method has nothing to do with the number of labels in the storage consumption,thereby reducing the amount of data stored by the reader.(4)The integrated quadtree anti-collision algorithm is proposed by the optimal m-tree.The performance of the algorithm is improved on the basis of the optimal m-tree by using array storage,m-M coding and timer.Finally,the performance of the CDQT algorithm is verified by the matlab simulation experiment on the time complexity,throughput and communication complexity compared with the CT algorithm,QT algorithm and IACT algorithm.The time complexity is lower than the CT algorithm about 25%,the space complexity is about 20%lower than the CT algorithm.