An Anti-collision Algorithm Using Tag Random-Dispersing for RFID Systems

The collision problem between tags in Radio Frequency Identification (RFID) system is one of the most important issues that affect the system performance. The multi-tag anti-collision algorithm in the RFID system can be divided into binary tree based algorithms and ALOHA based algorithms at present. The binary tree based algorithms use tag ID to judge collision and have been employed popularly as its high efficiency. However, one of the disadvantages in the binary tree algorithms is that large amount of data have to be transmitted in system. A modified binary tree anti-collision algorithm is proposed in this paper. Firstly, the algorithm dispersed tags randomly. Then, the algorithm took short random number as tag temporary ID to avoid direct transmission of tag ID. Compared to the existing binary tree algorithms, the results of experiments show that the proposed algorithm reduces the amount of data traffic greatly and improves the identification rate significantly.