Research On RFID Anti-collison Algorithm

RFID which means “Radio Frequency Identification”is developed very fast in recent years because of the propose of the technology of IoT.AS one of the most important branches of the automatic identification technology,RFID technology has lots of advantages that other automatic identifications can not match.Although,the RFID technology has a lots of advantages in practical application,there were still many problems and disadvantages that should be focus on.And the collision of the tags has been a problem that influence the RFID technology recognition efficiency.When two or more then two tags send the ID information to the reader at the same time,there will be a signal collision and overlap.It will make the reader can not read the tags information successful,reduce the system productivity.First,this paper introduces the complete system and key components of the RFID system.Then,the two main kinds of RFID anti-collision algorithms are introduced in detail.Based on the study and understanding of binary anti-collision algorithm,an adaptive multi-bit collision detection tree algorithm(MCDT)is proposed.Based on the RFID binary collision detection,according to the distribution of the collision bits between the top 2 and 3 of the tag collision information detected by the reader,the algorithm uses the number of bits between the collision bits to decide the number of bits that the label needs to pass to the reader in the next round of query.Dynamically adjusts the valid ID information that the label transmits to the reader in a collision-intensive area.Resolve the problem of the new query code is formed by using only the highest number of collision bits in the query algorithm,which makes a lot of useless information in the process of tag communication,and causes a lot of waste of communication resources and reduces the efficiency of communication.The simulation results show that the MCDT algorithm can maintain a better recognition efficiency and time of recognition,at the same time,the traffic of the label to the reader is significantly lower than other similar algorithms.This algorithm effectively reduces the traffic in the query process.The amount of communication is only twenty percent of the CT algorithm,only fifty percent of the A4 PQT algorithm.The algorithm effectively reduces the amount of traffic in the query process.Through the analysis and comparison of the non deterministic algorithm.Propose a Dynamic frame reservation of multiple collision detection tree(DRCDT)anti-collision algorithm which combines the advantages of two kinds of algorithms.The algorithm uses the number estimation method and the slot reservation mechanism in the non deterministic algorithm,to estimate and grouping the identification tags.Eliminate the empty time slot and improve the recognition efficiency of the system.And MCDT algorithm is applied to solve the starvation phenomenon of labels in uncertain algorithm.Simulation results show that the recognition efficiency of DRCDT algorithm is ten percent higher than MCDT algorithm,and about thirty percent higher than the DFSA algorithm.The algorithm effectively improves the recognition efficiency of the system.