Research On Anti-collision Algorithm And Security Authentication Protocol Of RFID System

Radio frequency identification(RFID)technology is a non-contact automatic identification technology.With unique information collection methods,RFID technology has become an indispensable part of the perception layer technology in the Internet of things.RFID technology relies on radio frequency signals to conduct information interaction between readers and tags in the way of wireless communication.It is featured by strong anti-interference,fast recognition speed and nice reliability,and has become one of the key technologies in data collection and product identification.With the application of RFID technology in the fields of supply chain,medical care,logistics,public safety management and anti-counterfeiting identification,a variety of problems it faces are gradually highlighted.Tags collision and security in wireless communication have become two important research directions of this technology.This paper conducts detailed research and exploration on these two issues,and proposes improvement and innovation on the basis of existing tag anti-collision algorithm and security certification protocol.It is summarized as follows:1.Based on the analysis of the existing binary search tree algorithm,this paper proposes an improved algorithm — N-BDBS algorithm.This algorithm abandons the existing algorithm in which the query instruction of the reader is in the form of all or part of the ID of the tag,and only reflects the location of the highest bit collision and the data information at the top of the stack,so the length of the query instruction is significantly shortened.The information returned by the tag after receiving the query instruction only includes the string after the highest collision bit,and all redundant information in the identification process is simplified.In addition,the algorithm executes the backward strategy of the backward binary search tree algorithm.After successfully identifying a label,the algorithm goes back to the parent node of the binary tree to continue the recognition process,instead of returning to the root node of the binary tree,thus reducing a large number of repeated query steps and optimizing the query process.Another innovation of the algorithm is the handling of the case that there is only one collision bit in the collision information.In this case,the improved algorithm can recognize two tags at the same time,thus reducing the recognition task of the system.In this paper,Matlab simulation software is used to simulate the throughput and traffic of the improved algorithm.The results show that compared with several classical anti-collision algorithms,the performance of the improved algorithm in both aspects is obviously improved.2.This paper proposes a hybrid collision avoidance algorithm based on the advantages of ALOHA class algorithm and binary search tree algorithm.In order to make the algorithm suitable for the RFID system application scenarios of large-scale tags,the hybrid algorithm executes the grouping strategy,so that the algorithm will not have a sharp decline in the identification efficiency when the number of tags is large.Before the recognition,the hybrid algorithm first estimates the number of tags,and then divides the time slots or groups according to the number.Then,DFSA algorithm was used for the first round of identification,and the tags in the successful time slot were read directly,and the tags in the collision time slot were accurately identified in the second round by using the improved N-BDBS algorithm.The hybrid algorithm combines the advantages of the two algorithms and the idea of dividing the time slot by ALOHA algorithm,so as to reduce the number of tags in the collision time slot and simplify the recognition task of binary tree algorithm,thus improving the comprehensive performance of anti-collision algorithm.Simulation results show that the hybrid algorithm can maintain the optimal recognition efficiency compared with the existing algorithm.3.This paper presents a RFID authentication protocol based on elliptic curve function.In view of the problem that the existing RFID security protocols lack the key establishment process,this paper firstly establishes a key negotiation mechanism and analyzes its correctness and rationality.On this basis,an elliptic curve security authentication protocol for mobile RFID systems is proposed.The protocol authentication process is given and its security is analyzed.Compared with other protocols,it is proved that the improved protocol has more efficient performance and can resist multiple attacks Finally,the process of the protocol is simulated under the Visual Studio development environment to prove the correctness and feasibility of the protocol.