Collision avoidance anti-collision algorithm based on subset partition

Tag collision is a very important issue in RFID system. In order to improve the identification efficiency of the system, this paper proposes a collision avoidance anti-collision algorithm based on subset partition (CABSP). The CABSP narrows the identification range and reduces the probability of tag collision by splitting tag subsets. On this basis, the process of tag identification is divided into two phases including of tag slot reservation phase and tag reading phase, the reader eliminates the idle slots of the tag reading phase by detecting whether there is a reservation collision in the slot reservation phase, and improves the identification efficiency by selecting the tag to be recognized according to the collision avoidance mechanism. Simulation results show that the CABSP algorithm reduces the collision slots in the process of tag identification, and the system throughput can be increased to 90.4%, the performance is better than other existing algorithms in the literature in terms of the identification efficiency and communication complexity.