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 uncutvertex 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.
topology control movement control deployment transmission power ad hoc networks
Weibin Gong Yilin Chang Ying Zhang Zhong Shen
State Key Lab.of Integrate Service Networks,Xidian University Xian,China,710071
国际会议
广州
英文
2008-11-19(万方平台首次上网日期,不代表论文的发表时间)