Research Of Anti-collision Algorithm Of RFID Tags Based On Blind Source Separation

Radio frequency identification(RFID)is one of the core technologies of the Internet of Things,getting more and more large space for development under the guidance of the Internet of Things.RFID has many advantages,such as non-contact,fast reading speed,large storage capacity,good environmental adaptability,high security and so on,making it widely used in different fields.However,the RFID systems have collision problems of multiple tags information during the operation,which limits the practical applications of the RFID system.Therefore,the research of anti-collision algorithms for RFID system is of great importance.This paper firstly introduces the basic components of RFID system,and describes the application background of RFID system such as working process,digital coding and modulation mode.Aimed at the existed problem of tags information collisions in RFID system,two kinds of tags anti-collision algorithms,which are the ALOHA-based uncertainty algorithm and the tree-based deterministic algorithm.Through the analysis we can see that these two algorithms still have low system throughput rate and low efficiency.In view of the above problems,this paper improves the original ALOHA algorithm of dynamic frame slot,a grouped dynamic frame slotted ALOHA tag anti-collision algorithm based on parallelizable identification(PIGDFSA)is proposed in this paper.Based on the experiments,the method and strategy of increasing the system throughput rate and lowering the tag collision rate are presented in this paper by exploring effects of the number of the tags and its groups,the frame length on the system throughout and tag collision rate.Combining the multi-antenna of the RFID system and blind source separation technology,the collision slot can be redefined,and the number of the unrecognized tags can be used to set the number of groups and frame length adaptively.Finally,through the simulation software MATLAB,the PI GDFSA algorithm is investigated from the aspects of the algorithm throughput rate,free timeslot ratio,algorithm efficiency and total time cost.The simulation results show that the PIGDFSA algorithm can stabilize the throughput rate more than 92%when the number of tags reaches 2000.Comparing with the FSA-256,GDFSA and BSDBG algorithms,PIGDFSA algorithm has higher throughput rate,less free timeslot,higher algorithm efficiency and shorter total time cost.The simulation results prove that the research of this paper has some application value.