Research And Performance Analysis Of Parallelizable Identification Multi-tag Anti-collision Algorithm Of RFID System

Radio frequency identification technology is a kind of communication between the radio frequency signal and space coupling,so as to realize the non-contact automatic identification technology.Radio frequency identification(RFID)as the core technology of the Internet of things,with the development of the Internet of things technology and application,become the research hotspot..In practical application,it is often encountered in the same time to respond to the reader's query commands,resulting in tag collision problem,so that the reader can not label the recognition,resulting in the identification of time is too long and the waste of communication broadband,become the urgent need to address the problem of radio frequency identification.In this paper,we have studied the problem of collision in multi tag identification.The work done in this paper mainly includes:(1)a novel parallelizable identification anti-collision algorithm based on NMF and framed-slot was proposed.The number of tags in each slot can be controlled within the optimum range by selecting the reasonable number of slots,remained the best condition of the RFID system,.Compared with the Blind Separation and Dynamic Bit-Slot Group(BSDBG)algorithm using the same multi-antenna technology the simulation results show that the tag identification rate improves from 180% to 389% and the tag identification speed of the proposed algorithm increases from 39% to 70% when the number of antennas is from 4 to 28.(2)a novel parallelizable identification anti-collision algorithm based on NMF and the grouping of binary tree slots based on ID sequence,an adaptive tree grouping was proposed.The number of tags in each group can be controlled within the optimum range by selecting the reasonable number of groups,remained the best condition of the separation of the source signals and the throughput in RFID system,which improves greatly the system performance.Compared with the Blind Separation and Dynamic Bit-Slot Group(BSDBG)algorithm using the same multi-antenna technology the simulation results show that the tag identification rate improves from 152.8% to 359.2% and the tag identification speed of the proposed algorithm increases from 60% to 78.4% when the number of antennas is from 4 to 16.(3)a novel parallelizable identification anti-collision algorithm based on NMF and Dynamic Bit-slot grouping was proposed.The number of tags in each group can be controlled within the optimum range by Dynamic Bit-slot grouping technology,remained the best condition of the separation of the source signals in RFID system,which improves greatly the RFID system performance.Compared with Enhanced Binary Search tree anti-collision algorithm,(EBS)algorithm results show that the tag identification rate improves from 190.8% to 1466.2% and the tag identification speed of the proposed algorithm increases from 73.5% to 92.6% when the number of antennas is from 4 to 28.(4)a novel parallelizable identification anti-collision algorithm based on NMF and the Hamming weight grouping was proposed,it used the Hamming weight of tags ID top M bits to group the tags which were in the scope of the reader Then the reader of the RFID system identified each group according to the grouping sequence.Compared with the Jumping and Dynamic Searching algorithm using the same multi-antennas technology,when the number of antennas is from 8 to 18,simulation results show that the tag identification rate improves from 42.8%~169.5% and the tag identification speed of the proposed algorithm increases from 42.8%~169.5%.