Steiner Tree Movement Control Algorithm for Topology Recovery
Liang Dai · Xi'an Jiaotong Daxue xuebao · 2011
A Steiner tree movement control algorithm(SMC) is proposed to improve low success rate and large movement cost in wireless ad hoc network topology recovery.The SMC computes a Steiner tree by calling 3STP-MSP algorithm,where the vertices contain all the nodes in the network and the introduced Steiner points.Then the Steiner points are regarded as movement destinations,and some nodes are selected and scheduled to move to these Steiner points.SMC runs iteratively until the network is connected.Simulation results show that the SMC not only reconnects the network with a success rate 100%,but also decreases the movement cost significantly,compared with the MST-based PMST-UV algorithm,and that the total movement distance is reduced by 37% to 45% and the number of total movement nodes is reduced by 9% to 29%.