Node mobility control and capacity in wireless ad hoc networks

The end-to-end throughput of stationary random wireless networks is scaled by Θ( 1/√n log n ). This throughput scale can be changed into Θ(1) by making the flows to be local flow patterns. By exploiting the controllable mobility of mobile nodes in order to reduce the path length, it is possible to achieve the constant scale end-to-end capacity regardless of the node density. The shortened path length at the resultant network reduces the traffic delay and improves the energy efficiency at the same time. The mobility control for the constant throughput scale can be formulated as a optimization problem, and we propose a simple heuristic mobility control algorithm based on the analysis and the problem formulation. Extensive simulations show that the proposed mobility control algorithm improve the end-to-end capacity.