Study on the Performance of Tag-Tag Collision Avoidance Algorithms in RFID Systems

If there are multiple objects attached with RFID tags within the interrogation zone of a reader, and more than one tags send their identification messages to the reader simultaneously to response the query from the reader, the tag-tag collision would happen and no tag is identified by the reader. The tag-tag collision leads to retransmission of tag IDs which results in wastage of bandwidth and an increase in the total delay in identifying all the objects. Several tag collision avoidance algorithms have been proposed. In this paper, a survey on tag collision avoidance algorithms is presented. The performance of two algorithms which are classic and widely used, Tree Split and Memoryless are studied. Simulation and comparison analysis of performance is performed.