Introduction - If you have any usage issues, please Google them yourself
Presents a matrix of adaptive search-based anti-collision algorithm. The algorithm is the effective use of collision information, by constructing a search matrix, to overcome the self-adaptive binary tree search algorithm for low bit-searching efficiency shortcomings. At the same time put forward the concept of the stack collision, according to slot the state, from adjustments to the search path, thereby reducing the number of collisions and idle slots, as well as the amount of transmitted bits. Theory and simulation results show that the algorithm is effective and practical, which can effectively reduce the recognition time and improve search efficiency