An Optimized Search Algorithm Based on the Binary for RFID Tags Collision

An improved anti-collision algorithms is proposed based on binary tree search algorithm to the tag collision problem in the process of RFID reading.The algorithm greatly reduces the number of corresponding tag in collision detection and the probability of collision bits,which was established by constructing a new request method and a bit-by-bit identification is used to double-digit arbitration collisions.Compared with the basic binary tree search algorithm and dynamic binary tree search algorithm,the simulation results show that this algorithm has obvious advantages in the transmission of binary data.And it provides the same performance in the average number of requests,thus the recognition process faster,reducing the propagation time information.