The Research Of RFID Anti-collision Algorithm Based On EPC-C1G2

The purpose of the IOT?Internet of Things?is to connect all the objects in the world and to identify,track and manage them.As the key technology of IOT,RFID?Radio Frequency Identification?is achieving more and more attention.RFID is using the RF carrier signal from the goods carried by the electronic tags to obtain identification information.And The entire identification process is automated,without human intervention.Non-contact is the biggest characteristic of RFID.In the RFID system,if there are multiple tags in the work area of the RFID reader and send data to the reader at the same time,the data will conflict,the reader will not be able to correctly identify the data.Obviously,the data conflict is the main factor that affects the system identification efficiency of RFID.Therefore,the use of an effective anti-collision algorithm in the RFID system is extremely important.Firstly,in this paper,a typical RFID anti-collision algorithm is studied,including the binary-based deterministic algorithm and the ALOHA-based probabilistic algorithm.Secondly,this paper analyzes the widely used RFID anti-collision algorithm:Q algorithm.Q algorithm is proposed by the RFID standardization organization EPCglobal,the algorithm is improved on the basis of DFSA algorithm implementation.After analyzing the performance of Q algorithm and its defects,this paper proposes two improved algorithms,Q-BS algorithm and Fast-Q algorithm:1)Q algorithm is improved on the basis of DFSA algorithm.Even in the case of a large number of tags,Q algorithm has a stable system identification efficiency.BS?Binary Splitting?is a deterministic binary anti-collision algorithm,in the case of small number of tags,BS algorithm has a very good identifidation efficiency.The Q-BS algorithm embeds the BS algorithm into the Q algorithm,and makes full use of the advantages of the two algorithms.It is a hybrid anti-collision algorithm.The simulation results show that the new algorithm can effectively improve the efficiency of RFID system identification and reduce the number of required time slots and the number of collision slots,which has certain practical value.2)It is unreasonable that Q algorithm uses fixed step size C to adjust the Q value.Aiming at this kind of irrationality of Q algorithm,this paper proposes a second improved algorithm:Fast-Q algorithm.The Fast-Q algorithm uses different parameters to adjust the Q value in both collision slots and idle slots.If it is a collision slot,we will adjust the Q value using the parameter C_coll,if it is an idle slot,we will adjust the Q value using the parameter C_idle.In the following,we will analyze C_coll and C_idle in detail and their proportion relation.The simulation results show that the new algorithm can effectively reduce the number of total slots and collision slots,and shorten the total recognition delay.