RFID bit match anti-collision algorithm in Internet of things
物联网中RFID位匹配防碰撞算法*

This paper analyzed the existing binary query tree algorithm, 4-ary query tree algorithm and hybrid query tree algorithm. Then it presented the adaptive hybrid collision-bit tree which was based on the matching of anti-collision algorithm. New algorithm was based on the highest collision detection code tag EPC number of consecutive matching information, then adaptively selected the bifurcation in the binary tree and the quadtree. The search performance of the algorithm was further improved by introducing the stack and back strategies. Through analysis of the algorithm, the simulation results show that the new algorithm effectively reduces the total number of identified, shortens the identification time, and significantly improves the search efficiency and throughput.