Study on hash-tree searching anti-collision algorithm
散列树形搜索反碰撞算法的研究

A new anti-collision algorithm based on hash-tree searching was proposed, and three principles that the algorithm follows were formulated, the procedure of the algorithm was introduced in detail. The performance of this anti-collision algorithm was compared with EDFSA algorithm's in system efficiency and identification time. An evaluative model for the system efficiency was put forward, and then the system efficiency expectation of the proposed algorithm was proved between 36.8% and 1, which was better than that of EDFSA algorithm. The emulation results show that the identification time of the proposed algorithm is less than that of EDFSA algorithm when identifying lots of tags. In addition, the algorithm does not require testing the precise location of collision bits, so it is more flexible than the anti-collision algorithm based on binary-tree searching. The proposed algorithm has raised system efficiency, and has more extensive application prospects in auto identification field.