Path planning for network performance

Alex Fridman, Steven Weber, Charles Graffs, Moshe Kam

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

2 Scopus citations

Abstract

Path planning and network design are often treated by architects of mobile communication networks as separate problems. In fact, most mobile ad hoc network (MANET) designs do not consider the path that the network nodes would take as part of the objective set, but incorporate them in an abstract form as general constraints on mobility (limit on the initial configuration and the node velocity). It appears that significant performance improvement may be possible if multiobjective optimization is attempted on performance indices such as connectivity of the network and arrival time of all nodes at a specified terminal set In this study we provide an efficient decentralized method for computing the Pareto optimal set of plans, and show the benefit of path planning under six different metrics of MANET performance.

Original languageEnglish (US)
Title of host publicationIEEE GLOBECOM 2007 - 2007 IEEE Global Telecommunications Conference, Proceedings
Pages1258-1262
Number of pages5
DOIs
StatePublished - Dec 1 2007
Externally publishedYes
Event50th Annual IEEE Global Telecommunications Conference, GLOBECOM 2007 - Washington, DC, United States
Duration: Nov 26 2007Nov 30 2007

Publication series

NameGLOBECOM - IEEE Global Telecommunications Conference

Other

Other50th Annual IEEE Global Telecommunications Conference, GLOBECOM 2007
CountryUnited States
CityWashington, DC
Period11/26/0711/30/07

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Fingerprint Dive into the research topics of 'Path planning for network performance'. Together they form a unique fingerprint.

Cite this