A novel anti-collision algorithm for high-density RFID tags

In a radio frequency identification (RFID) system, when more than one tag communicates with a reader at the same time, a collision will occur resulting in the failure of that communication. Many anti-collision algorithms, such as binary tree (BT), FSA, and DFSA have been used in ISO and EPC standards to prevent such a collision. This paper develops a new anti-collision algorithm based on the BT and the DFSA algorithms. Specifically, all tags are divided into many groups using the DSFA algorithm. Then, the tags in each group are identified using the BT algorithm. Results indicate that the proposed algorithm performs better than the existing ones in terms of the number of used time slots (the less the used time slot, the faster the algorithm).