The Analysis And Research About Tag Anti-collision Algorithm Of RFID System

Radio Frequency Identification (RFID) is an automatic identification technology with highspeed, real-time, accurate, non-contact feature,it can recognize the target automatically and getrelevant data by radio frequency signals,it is an important part of popular Internet of Things today.The efficiency and application of the RFID system depends on the anti-collision algorithms.This paper is mainly about ALOHA anti-collision algorithms. It has a study on the performance ofFSA and GDFSA with mathematical probabilistic model and MATLAB simulation software.Then,focuses on two improved algorithms based on the existing algorithms,including ID-FSAwhich uses the label’s ID modulo frame length to allocate self-slot that improves efficiency ofcontinuity ID tags by making full use of slots compared with traditional FSA algorithm andCD-GDFSA which makes it possible to recognize two tags within a slot time by introduced CDMAtechnology,as a result,the throughput has an great improvement comparing with GDFSA.Finally,this thesis builds a RFID reader-tag identification model with creating a networkscenario consists of a reader node and64tag nodes,including process model and node model basedon FSA and ID-FSA,by means of OPNET network simulation tool.The accuracy and feasibility ofID-FSA algorithm is verified through analysis and comparison of throughput,the number of slots.