Improved Hybrid Query Tree Anti-collision Algorithm

An improved algorithm based on the hybrid query tree (HQT) algorithm is proposed in this work. Tags are categorized according to the combined information of the highest bit of collision and second-highest bit of collision. Then, these tags are used to decide the postponement of several delayed-response time slots, to diminish the collision probability. The performance analysis results show that this algorithm is superior to the query tree (QT) and HQT algorithms. It reduces the query time and system communication traffic and improves the tag identification efficiency.