RFID (Radio Frequency Identification) is one of the key automatic identification technologies. Along with the large-scale application of RFID tags, the tag collision problem becomes more frequently and seriously affects RFID system performance. In this paper, according to the characteristic of disordered and successive tag ID number, we propose a binary-tree searching anti-collision algorithm based on dynamic adjustment and a polling algorithm to solve the collision problem. The simulation results and performance analyses show that both algorithms can improve the system throughput in some degree, and both algorithms have well practical value in RFID system.