Research On Rfid-Based Anti-Collision Algorithms And Sercurity Protocol

In recent years, along with the advance of information technology and the continuous development of social economy, the concept of Internet of things began to widely circulate. Radio frequency identification (RFID) as the original data collection tool is regarded as the foundation of the Internet of things, and gradually become a hot topic in the academia and industry.Compared with the bar code which is traditional data acquisition tool, RFID does not require line of sight communication, able to withstand the harsh physical environment, and has the ability to identify multiple tags simultaneously, which making RFID is being widely applied. While followed by the problem of the data integrity in the process of transmission and security vulnerabilities and other issues.In this thesis, the above two issues to do the following research:RFID-based system model, introduced the implementation process of related collision algorithm and security protocols, in-depth study of existing anti-collision algorithms and security protocols, analyzes the advantages and disadvantages of these algorithms and security protocols.In order to solve the problem of system data integrity in the process of data transmission, this thesis proposes a new anti-collision algorithm--Adaptive Slots Collision Tracking Tree (ASCTT) algorithm, flowchart of the algorithm is proposed, detailed description of the general algorithm execution steps, through a concrete example compares ASCTT algorithm and BSCTT algorithm how to identification tags, detailed explanation the steps of two algorithms to identify at the same time. Finally, ASCTT algorithm through the experimental validation, proved ASCTT algorithm compared with other several collision algorithms in the process of actual label recognition, the number of communications and traffic between reader and tag are decreased significantly, and has high recognition efficiency. In order to solve the system privacy and security vulnerabilities, this thesis proposes a new security protocol that is based on double random number to query--response protocol. The protocol uses three mutual authentication protocol modes, in ensuring the premise of low-cost tags, this protocol use hash function and random numbers to ensure the safe and efficient control access between the tags and readers, and from the perspective of quantitative estimates the cost of label. After setting up the idealized protocol model, a process of formal analysis of this protocol is presented and the security is proved theoretically by using the BAN logic.