A Bit collision detection based Query Tree protocol for anti-collision in RFID system

Anti-collision algorithms in the RFID system can be divided into two categories: ALOHA based and binary tree based algorithm. Each of them has its own advantages or disadvantages. The QT protocol, as a classic binary tree based algorithm, was proposed to achieve the reliable throughput of identification by using prefix to avoid collisions. This paper proposes an improved QT protocol called Bit collision detection based Query Tree (BQT) by adopting individual bit collision detection, which can detect the collision in each bit. It can reduce the collision for the tags which have the same prefix and accelerate identification process. The simulation results and analysis show that our BQT protocol could reduce the collisions and achieve much better performance on tag identification.