A distributed movement control algorithm in wireless ad hoc networks

In wireless ad hoc networks, in order to prolong network life time and improve network capacity, it is necessary to reduce large transmission power of nodes. Due to the random distribution of nodes, traditional topology control algorithms fail to solve this problem completely. So we propose a distributed movement control algorithm to solve this problem. Target locations and redundant nodes are identified first based on localized minimum spanning trees(LMST) and localized uncut-vertex nodes (LUV) respectively. After moving nodes candidates are found out from redundant nodes, they finally move to target locations directly. Simulation results show that the LMST-LUV movement control algorithm can reduce the maximum communication radius and improve the performance of topology control dramatically.