A Fast RFID Tag Anticollision Algorithm for Dynamic Arrival Scenarios Based on First-Come-First-Serve

摘要

Radio-frequency identification (RFID) tag anticollision algorithm is a key technology that affects the performance of RFID systems. In dynamic arrival scenarios, when the tags arrive the reader's interrogation zone, they cannot participate in the ongoing identification immediately, resulting in longer waiting time and tag miss. Focusing on solving this problem, based on blocking technology, dynamic frame-slotted ALOHA (DFSA) algorithm, and the first-come-first-serve (FCFS) idea, a fast RFID tag anticollision algorithm for dynamic arrival scenarios is proposed, named as "DAS-DFSA algorithm". By optimizing the instruction structure and identification process, the DAS-DFSA allows the new arrival tag to immediately participate in the ongoing identification process, the tag's waiting time is shortened, and the miss rate is reduced. DAS-DFSA not only adopts blocking technology to prevent the collision between the arrival tag and waiting tag but also uses unequal-length slots to reduce the communication time overhead. Simulation results show that the identification speed of the algorithm is significantly improved and high system efficiency is guaranteed. Under the same operating conditions, compared with similar algorithms, the waiting time is shortened by more than 44.548% and the identification speed is improved by at least 39.053%. More importantly, it can provide the instant-on-service for dynamic arrival tags and can fully meet the requirements of fast identification of tags in different dynamic arrival scenarios.