Research On RFID Multi-tag Anti-collision Algorithm Based On Four Adaptive Xor Query Tree

With the advent of the Internet of Things,the realization of "the connection between things and things,people and things" has become the theme of future development.Radio frequency identification(Radio Frequency Identification,RFID)technology is one of the core technologies of the Internet of Things.It is a non-contact automatic identification technology.It automatically recognizes the label attached to the object through the radio frequency signal,so that the information between each object is truly realized "Communication".RFID technology is constantly being applied in the fields of smart communities,smart transportation and smart cities,and has huge potential for development in the future.When RFID recognizes a large number of tags,when multiple tags respond at the same time,it will cause aliasing of data reception,which seriously reduces the recognition efficiency.This process is called "collision".The collision severely hindered the development of RFID technology to high-precision and high-speed identification.In this regard,this paper takes collision resolution,improved recognition efficiency and cost-effectiveness as the starting point for the design of anti-collision algorithms,and innovatively proposes a four-prong adaptive XOR query tree algorithm and FPGA(Field Program Gate Array)based performance indicators.The text's Quadratic Adaptive Xor Query Tree Anti-collision Algorithm Based on 4-ary Tree(FAXT)is based on the past algorithm to query a single deficiency,and draws on the advantages of the latest XOR query,innovatively Point to improve the combination,propose XOR command value,automatic identification and initial alternate query strategy.The algorithm uses different query methods according to whether the collision bit is continuous: if it is not continuous,it uses the prefix query;if it is continuous,it uses the combination of prefix and XOR command value to query;if there is only 1 bit or 2 consecutive bits can be directly identified.The Matlab software was used to test and compare the total query time slot number,throughput rate and communication complexity of the algorithm.The results show that the total query time slot number of the algorithm in this paper is significantly reduced,the communication complexity is reduced,and the throughput rate is significantly improved,maintained at 0.693 Compared with the latest EAPT(Muilt-tag Anti-collision Algorithm Based on 8-ary Adaptive Pruning Query Tree)algorithm,it is improved by about 10.88%,and compared with CT(Collision Tree),QT(Query Tree)and other classic algorithms,it is improved by about 40% to 95%.Therefore,the algorithm proposed in this paper has more excellent performance than other algorithms,can better solve the collision problem,and has higher recognition efficiency.Based on the advantages of flexible FPGA design and fast execution speed,the algorithm of this paper is designed and implemented.Firstly,the Verilog HDL is used to realize the design and simulation of the Manchester codec module,LIFO stack module,algorithm control module,etc.on the Modelsim software,and then connect each module to realize the algorithm function of this article.At the same time,based on the innovative design of Quartus? software,this paper puts forward two performance indicators of hardware design complexity and power consumption,and conducts comparative experiments.The results show that the complexity of the hardware design of the algorithm tag in this paper is only 86 logic units,and the power consumption is only 546.58?W.The latest EAPT algorithm reduces the number of logical units by 44.87% and the power consumption by 20.44%.Therefore,the algorithm proposed in this paper is more cost-effective in terms of hardware design complexity and power consumption.It provides exploration significance for the promotion of low-cost and low-power design of RFID anti-collision algorithm.