中文摘要：

针对均衡网络传输功率时节点移动开销大，算法迭代次数多的问题，提出了一种基于最小连通支配集和Steiner树的移动控制算法．首先计算网络拓扑的骨干节点集，然后根据骨干节点集和临界传输半径建立Steiner树，树中的Steiner点作为节点移动的目的点，最后匹配并移动非骨干节点到Steiner点，实现节点传输功率的均衡．仿真结果表明，与基于最小生成树的PMST—UV算法相比，在相同的网络场景下，本算法节点移动开销小，算法迭代次数少，节点总移动距离降低13％～34％，算法迭代次数减少17％。68％．

英文摘要：

To decrease the movement cost and the algorithm＇s iteration number in balancing the transmission power of nodes, a novel movement control algorithm is proposed, which is based on the minimum connected dominating set and Steiner tree. Firstly, a node set, which acts as the backbone of the network, is computed. Then a Steiner tree is constructed with the input of the backbone node set and the critical transmission radius, where the Steiner points are set as the moving candidates＇ destination points. Finally, the nodes which are not in the backbone node set are matched with and moved to the Steiner points to balance the transmission power. Simulation results show that, compared to the MST-based PMST-UV, the proposed algorithm reduces the movement cost and the iteration number, with the total movement distance decreased 13% - 34%, and the iteration number reduced 17% -68% .