Research On Anti-Collision Algorithm For RRID Tags Based On Collision Tree

As an important part of the core technology of Internet of Things,Radio Frequency Identification(RFID)technology is an automatic identification technology that uses radio frequency signals for data transmission.RFID technology has many advantages,such as non-contact identification,strong anti-interference ability,large amount of storage data and high security.It has been widely applied in many fields,such as retail,logistics,manufacturing and so on,which brings huge market value and economic value.However,there are still many problems such as collision of reading,and the performance of the anti-collision algorithm will directly affect the accuracy and efficiency of the system to identify the object.Solving these problems is of great significance for the large-scale application of RFID.First,the thesis introduces the research status of tag anti-collision algorithm at home and abroad,the components and working principle of the RFID system.Then,several classic anti-collision algorithms are analyzed and compared.Finally,a Multi-Bit Identification Collision Tree(MICT)algorithm is proposed based on Collision Tree(CT)algorithm.MICT algorithm uses two fixed-length arrays to hold the newly generated query prefixes in collision cycle.One array records the collision information for each identification cycle,and the other array gets the query prefixes generated by the current collision cycle.With the increase in the number of tags and the length of the tag ID,this scheme is significantly improved in reducing the amount of stored data compared with the method of storing query prefixes for the stack.The proposed algorithm uses the "multi-bit coding" scheme to encode the tag ID according to a certain rule,which achieves the goal of "one-shot collision and multiple bits identification",and significantly reduces the number of queries.The simulation results verify the correctness of the proposed algorithm and give the parameters of the new algorithm when it reaches the optimal performance.The Experimental results show that MICT algorithm reduces the time complexity by about 38% and the communication complexity by 27% compared with the collision tree algorithm.Compared with the multiple collision bits resolution algorithm,it reduces the time complexity by more than12% and the communication complexity by about 8%.The new algorithm not only inherits the advantage of collision tree algorithm to eliminate idle time slots,but also successfully solves the limitation of query prefix update of traditional tree algorithm and improves the recognition efficiency.And the more tags that need to be identified,the more the advantages of the new algorithm in the total number of queries and the amount of data transmitted.