A query tree anti-collision algorithm based on multi-dimensional group mappin

To solve the problem of high space overhead and high deployment cost, a multi-dimensional block map query tree anti-collision algorithm is proposed. In this algorithm, the tag ID grouping dimension is added, and the tag ID is processed with the new mapping rules. The mapping result does not increase the encoding length. It not only speeds up the collision processing speed but also adds no additional communication data. Simulation results show that compared with the traditional QT algorithm, the A4PQT algorithm, and the GBAQT algorithm, the MDGQT algorithm has higher traffic and throughput, and the total number of time slots does not increase significantly under the same environment. The performance of the GBAQT algorithm is better than other algorithms in the case of a large number of tags.