Abstract: In the RFID system, tags are used to transmit information. Within the effective function range of the reader, multiple tags respond at the same time and thus collision is inevitable. The collision of tags will reduce the recognition efficiency of the system. In order to improve the efficiency of label recognition, this paper proposes a multi-cycle anti-collision search algorithm based on ALOHA partition and the existing anti-collision algorithms. Firstly, the frame length of the corresponding time slot is divided according to the number of tags to be recognized. Then, the multi-cycle anti-collision search algorithm is used to identify the tags in the time slot where the collision occurs, which can effectively reduce the probability of collision and improve the efficiency of tag recognition. This algorithm can be applied to a large number of label recognition systems, and has certain advantages over these systems. Theoretical analysis and experimental results show that the algorithm can effectively reduce the number of algorithmic time slots and improve the efficiency of label recognition.

Key words: RFID, anti-collision algorithm, ALOHA, multi-tree search, tag identification