提出一种基于搜索矩阵的自适应防碰撞算法．该算法有效利用碰撞信息，通过构造搜索矩阵，克服自适应

二又树搜索算法逐位搜索效率低的缺点．同时提出碰撞堆栈的概念，根据时隙状态，来自适应调整搜索路径，从而

减少碰撞和空闲时隙数以及传输的比特量．理论和仿真实验表明，该算法有效实用，可有效减少识别时间，提高搜

索效率-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