①Center of Network, Electronic Engineering Institute PLA, Hefei, 230037, China; ②Department of Electronic Science and Technology, USTC, Hefei, 230027, China
Abstract：A new adaptive anti-collision algorithm based on binary-tree disassembly is proposed in this paper. In order to enhance the search efficiency, a big and complex binary-tree is disassembled to several small and simple binary-trees by estimating the distributing of tags. The introduction of the collision stack, as well as adjusting the search paths adaptively based on the state of slots, the performance of the new algorithm is improved further, including reducing the search timeslots and improving the throughput of timeslots. Theory and computer simulations show that the new anti-collision algorithm is practical, especially when the number of tags is large.
2009, Vol. 31 
