Abstract: This paper proposed an adaptive binary search algorithm based on IAMS．The adaptive algorithm chooses binary-tree or quad-tree search adaptively by the number of collisions．In this algorithm,if the number of detected collisions is 2,the reader will begin binary tree search by setting the maximum collision position "0" or "1"．If the number of detected collisions is more than two,the reader will record the position and set the bits value of the maximum and minimum collisions,then starting the quad-tree search．Finally we simulated the 3algorithms on Matlab platform．The results and analysis show that compared with the return binary search algorithm and IAMS,the average number of search instructions reduces 46.7%,31.52%,and throughput is increased by an average of 85.8%,24.22% and average 85.3%,82.54% reduction in the amount of data transmitted in our algorithm．

Key words: RFID,Collision anti-collision,Binary-tree search algorithm,Self-adaption