Research On Anti-collision Algorithm Of RFID Tag

Radio Frequency Identification also known as RFID is a technology that uses radio signals to identify specific targets and collect relevant data.it can work in a complex environment and identify target object fast and accurately in a long distance.Also,this technology has many other advantages,such as high security,short identification time,good confidentiality,large data storage and so on.So far,RFID is one of the core technology of Internet of things and it becomes one of the most popular and mature applications of Internet of things.The application of RFID technology becomes more and more widely.It is widely used in many fields,such as communications transmission,commercial automation,traffic transportation control management,industrial automation and identity authentication.However,it has a large development space in the storage and logistics management,intelligent transportation,production process manufacturing management,network appliance control and so on.Nowadays,more and more tag intensive RFID applications are used,which often lead to tag collision because of the excessive tag.This problem seriously affects the tag recognition rate of RFID readers,thus reducing the overall efficiency of RFID systems.The anti-collision algorithm has been a hot and difficult problem in the research of key RFID technology.The performance of the tag anti-collision algorithm directly affects the efficiency of the RFID system.This paper has done a lot of research on this issue,and the innovative work contains the following aspects:(1)Based on the adaptive multi-tree anti-collision algorithm,this paper proposes a dynamic trimming tree algorithm by removing idle time slot,By using the method of optimizing the prefixes of the collision tag,the problem of waste in the idle time slot in the adaptive multi-tree algorithm is solved.and this paper does some mathematical analysis and experimental simulation to this algorithm.(2)This paper analyzes the bit-slot recognition algorithm and found that with the increase of the number of tags,the efficiency of algorithm recognition is drastically decreased,the number of tags is kept within a certain range to keep the system stable.(3)This paper proposes to use the EDFSA algorithm to group the tags first,which can make the number of tags in each group is kept within the best of the throughput rate of the bit-slot algorithm.Then,the tags in the group are identified by the bit-slot algorithm,followed by random identification of each group of tags.The remaining tags to participate in the next round of identification.(4)In this paper,the improved algorithm is analyzed from the aspects of algorithm principle,algorithm flow,algorithm performance and algorithm simulation.The results show that the algorithm is superior to the traditional algorithms.