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

A new adaptive anti-collision algorithm based on multi-tree search is proposed in this paper.Based on the binary tree and quadtree search,the new algorithm taking advantage of the features of Manchester encoding computes the collision factor and estimates the number of the tags.That is to say,when the number of tags in branches is large,the new algorithm uses quadtree search,otherwise,binary tree search is used.Theoretic analysis and computer simulations show that the new anti-collision algorithm overcomes the disadvantages of binary tree and quadtree algorithms.It can decrease timeslots and improve the throughput of timeslots effectively.