Node mobility control and capacity in wireless ad hoc networks

Jae Young Seol, Seong Lyun Kim

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)


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.

Original languageEnglish
Title of host publicationNetRob09 - IFAC Workshop on Networked Robotics, Final Program and Book of Abstracts
Number of pages6
Publication statusPublished - 2009
EventIFAC Workshop on Networked Robotics, NetRob09 - Golden, CO, United States
Duration: 2009 Oct 62009 Oct 8

Publication series

NameIFAC Proceedings Volumes (IFAC-PapersOnline)
ISSN (Print)1474-6670


OtherIFAC Workshop on Networked Robotics, NetRob09
Country/TerritoryUnited States
CityGolden, CO

Bibliographical note

Funding Information:
The second author acknowledges that this work was supported by CARUT-ITRC (IITA-2009-C1090-0902-0038).

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering


Dive into the research topics of 'Node mobility control and capacity in wireless ad hoc networks'. Together they form a unique fingerprint.

Cite this