A Two-way Hybrid Query Tree Anti-collision Algorithm

Abstract

Based on the Hybrid Query tree algorithm, this new algorithm compares the sums of collision distances: in forward direction, utilizing the combined information of the highest and the second highest bit of collision, categorizes the tags and decides gaps of delay to reduce collision; In reverse, utilizing collision template to form identification tree by using leaf nodes of electronic tags. The findings from the simulated experiments show that this proposed algorithm is superior to QT and HQT by decreasing the number of query and the traffic volume of system communication so that the efficiency of tag identification is greatly enhanced.