Based on the analysis of typical binary and dynamic binary search anti-collision algorithm in RFID system, this article proposes a fast and efficient anti-collision algorithm, that is, conduct dynamic packet on tags and adjust query instruction. The performance analysis and experiments show: this algorithm greatly reduces the tag identification time, and increases the identification efficiency of RFID system. At the same time, it reduces information exposure of tags when reader communicates with tags, and effectively decreases the collision probability of tags.

In RFID, when the amount of tags is large, scanning efficiency of the reader is often low. A novel anti-collision algorithm based on jumping-Searching tree is proposed, and the principle of the algorithm is formulated, the procedure and performance of the algorithm is introduced in detail. The algorithm simulation indicates it not only decreases the anti-collision times, but reduces the time delay.