(Considering base station orientation selection and energy-saving routing optimization jointly, the shortest path tree subdivision is defined, the structure of subdivision cells in two-dimensional space and the search algorithm of adjacent subdivision cells are analyzed, and three heuristic algorithms are designed. The function of the algorithm is analyzed and compared through simulation experiments. The results show that the function of the proposed heuristic algorithm is effectively close to or converges to the global optimal solution.)
收藏
