An Improved Adaptive Anti-collision Algorithm Based on Multi-tree Search

Based on the existing adaptive multi-tree search anti-collision algorithm,via the Bits Coding Unit mechanism,a new adaptive anti-collision algorithm was proposed. The new algorithm automatically choosed binary tree or quad tree to query the label code. When the quad tree was used,the card reader optimized the parameter of the query prefix to avoid the idle time slot. The simulation results showed that the new algorithm can effectively reduce the times of tag identification and the information transferred in the process of query. The new algorithm improved the efficiency of tags identification and the system throughput.