Improved Binary Tree Search Anti-Collision Algorithm

According to the issue of tag collision in the radio frequency identification technology, this paper proposes a binary tree search anti-collision algorithm, which takes different processing methods according to how many continuous collision. Compared with the dynamic binary tree search algorithm, the improved algorithm reduces the query information send by the reader. At the same time,the algorithm in the process of identifying tags reduces the query information, the query number and tag response times, so as to shorten the recognition time, further improve the search performance.