A Fast Algorithm for Anti-Collision in RFID System

This paper proposes a fast query tree-based (FQT) algorithm for anti-collision in RFID system. Tags to be identified would be grouped by a reader randomly at beginning, and the reader identifies a group of tags and records the quantity of tags. Then reckons the number of all tags and carries out optimized group again. In identification process, the prefix of queries would add two bits in odd rounds, and one bit in even rounds. The results of analysis and simulation show that FQT algorithm can obtain the better performance than QT algorithm.