An anti-collision RFID algorithm based on binary-tree search of the dynamic binary

A new algorithm based on binary-tree search of Dynamic binary is presented for solving the common problem of anti-collision in RFID,it is proved by using reduction that the process of search is in accord with full binary sort tree of structure,the advantage of the algorithm is proved by compared with binary algorithm and dynamic binary algorithm.(Finally,) the results of simulation also show that the new algorithm has better performance in comparison with the existing dynamic binary algorithm,and with the increase of the tags and the length of EPC,the advantages is more obvious.