Research and optimization of RFID tag anti-collision algorithm

In order to reduce the total identification time of readers and improve the system throughput in Radio Frequency Identification (RFID) systems, a new algorithm is proposed. Based on the Frame-Slotted ALOHA (FSA) algorithm, Tags are grouped according to the number of time slots during the reader's recognition process. For tags in collision time slots after a frame ends, the Collision Tree (CT) algorithm is used for group recognition, solving the starvation problem of the FSA algorithm and significantly reducing the total identification time of the reader. Simulation experiments have demonstrated that the algorithm proposed by the author significantly reduces the processing time when compared to the CT algorithm. and achieves a throughput rate that is higher than the traditional CT algorithm When the number of tags exceeds 260, reaching a maximum of 52% when the number of tags is around 400.