Based on the adaptive multi-tree search anti-collision algorithm

we proposed an improved adaptive multi-tree search anti-collision algorithm (IAMS) by optimizing the prefix sent by readers.Our algorithm reduces idle time slots by choosing the number of search tree branches adaptively according to the collision factor and optimizing the query prefix of quadtree.By mathematical analysis

we accurately predict the total number of time slots required for the tag identification in IAMS algorithm.Simulation results show that the IAMS algorithm has faster identification speed and higher system throughput.