Research On Multi Tag Anti Collision Algorithm Based On RFID

Radio frequency identification usually includes a reader and a plurality of electronic tags,and each electronic tag has a globally unique ID tag number,the reader through wireless signals to read all the tags send query requests,and then identify all tags.In the RFID system working state if at the same time several tags send their own ID information to the reader will occur tag collision,electronic tag must be after the reader sends a new query command again transmits its own ID information to the reader until the tag was to complete the identification,lead to tag recognition time is too long,low recognition efficiency,seriously affecting to popularize the use of radio frequency identification system.Firstly the radio frequency identification system were simple overview,focuses on the analysis of radio frequency identification system of internal basic work principle and tag collision the main reason,based on the classical multi tag anti collision algorithm performance analysis and thorough research,put forward two kinds of improved multi tag anti-collision algorithm,the first is according to the number of reader queries over and put forward a new anti-collision algorithm based on parity packet multi cycle RFID tags.All the electronic tag reader readable range bits bits and parity two groups respectively,all electronic tags according to the parity group,and use of the electronic label with belongs to the odd group or is belonging to the group and the response bits for the reader queries the first 0 or 1,divided into two sub cycles to respond to the reader of a single query.Full use of binary non 0or 1 of the characteristics and parity characteristics,the reader through the logic to determine the collision bit data,a one-time identification of two bit collision bit.The other is to put forward the RFID tag anti collision algorithm based on sub slot to send data too large.All electronic tag reader readable range of bit conversion,tags converted bits of different time slots in response to reader queries request according to the,using Manchester encoding logic judge the tag to send bits of information,thus simply realize the reader just to all tab sends a query request can identify all tags.This paper finally by using MATLAB software tools such as a large number of simulation experiments,with the existing multi tag anti-collision algorithm for reader ofthe number of queries by,between reader and tag the traffic and system overall throughput are analyzed and compared.The experimental simulation results and mathematical derivation analysis shows that,the improved algorithm is better than the other binary search tree algorithm,reduce the reader to tag number of queries,significantly reducing amount of communication between reader and tag,improve the efficiency of overall identification tags.