Anti-collision algorithm for RFID tag identification using fast query tree

A fast tag anti-collision algorithm named Fast Query Tree (FQT) is presented. FQT is an improved technique based on query tree algorithm, the novelty of FQT is that it use a counter and a pointer in each tag for tag transmission arbitration, owing to the counter and pointer, which on the other hand remembered the reader´s query history, reader just needs to transmit the last bit of the current prefix. The simulated results show that FQT can achieve a better performance than other conventional tree-based algorithms in terms of communication overhead, identification delay and speed.