Research On RFID Tag Identification Reliability Technology In Internet Of Things System

Radio Frequency Identification(RFID)technology in the Internet of Things is a non-contact wireless data communication technology with strong anti-interference ability,which is widely used in all aspects of people's lives.Compared with traditional automatic identification technology,RFID technology plays an important role in the process of data transmission between readers and electronic tags.In order to ensure the stability of the RFID system and solve the problem of tag collision in the system,multi-target tags recognition technology has been the focus of resear-ch in RFID systems.Based on the RFID technology of Internet of Things(IoT),this paper introduces the concept and architecture level of the Internet of Things from the multi-target tag collision problem,and analyzes the composition,working process and working principle of the RFID identification system.In addition,the ALOHA algorithm for solving the tag collision problem and the random tag anti-collision algorithm based on the improved ALOHA algorithm are analyzed.The existing deficiencies in the algorithm are studied.Two new tag anti-collision algorithms are proposed respectively.On the basis of the traditional dynamic frame slot ALOHA(DFSA)algorithm and the existing tag communication slot(TCS)algorithm,a tag anti-collision algorithm(MTSH)based hash function is proposed by judging the number of tags and setting the threshold size to select the slot.During the execution of the MTSH algorithm,when the number of tags is less than a certain threshold,a hash function is constructed and the tags are mapped into corresponding slots by the function relationship.Otherwise,the tags are divided into groups,and when the tags select the slot randomly in each group.In this identification process,a semi-active smart electronic tag is used.That is a paired communication can be performed between the tag and the tag,and some tags can exit the identification system.The simulation results show that the proposed algorithm outperforms the traditional tag anti-collision algorithm in terms of system throughput and stability.From the perspective of improving the utilization of system resources,combined with the frame length setting rules of DFSA algorithm and considering the limitations of hardware conditions,this paper proposes a frame-based time slot grouping(FG-BDFSA)tag anti-collision algorithm.The algorithm uses DFSA algorithm to dynamically adjust the core idea of frame length,and improves the group length setting.Through the performance comparison between the FG-BDFSA algorithm and the DFSA algorithm in terms of system throughput and system slot consumption.The results show that the FG-BDFSA algorithm avoids some unnecessary time slot waste in the DFSA algorithm and effectively improves the resource utilization of the system.