Movement control algorithm for balancing transmission power

作者：Yan Zhongjiang^*; Shen Zhong; Chang Yilin; Yang Jiawei

来源：Journal of Xidian University, 2011, 38(3): 48-54.

DOI：10.3969/j.issn.1001-2400.2011.03.009

• Backbone nodes
• Destination points
• Iteration numbers
• Minimum connected dominating set
• Movement control
• Simulation result
• Steiner points
• Steiner trees
• Transmission power
• Transmission radius

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%.

• 出版日期2011
• 单位西安电子科技大学