In order to solve multi-tag collision problem in radio frequency identification system, many anti-collision algorithms have been proposed, such as query tree algorithm, bi-slotted collision tracking tree algorithm (BSCTTA). In this paper, an enhanced collision tracking tree algorithm
is proposed to improve the performance of BSCTTA. The proposed algorithm generates prefix depending on the first collided bit, and then eliminates the idle timeslots and reduces the collided timeslots. Moreover, the proposed algorithm can identify two tags in a timeslot if there is only one
collided bit in the response data, and can truncate unvalued data when two collided bits are detected. The simulation results show that the proposed algorithm reduces the communication bits and query cycles than other algorithms, therefore enhances the identification efficiency and identification
speed of radio frequency identification system.
Bit Shuffling Query Tree Algorithm for Secure Communication in RFID Network