Ad hoc networks routing: shortest path is enough

Maher Heal, Marwan Fayed

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


It is well-known in hardwired networks that shortest path routing is optimum in regard to optimizing network performance such as maximizing network throughput for instance, but little is known in this regard in ad hoc networks routing due to the dynamic, changing topology of these networks. Via linear programming formulation of the optimum routing problem, we show shortest path is the best routing strategy as well when it comes to maximizing the mean network throughput in ad hoc networks provided that interference is neglected. However, the routing metrics in selecting routes (paths) should be dependent on links availability probabilities in these networks. Heuristic approaches were used in suggesting such metrics when the links capacities are equal and unequal.
Original languageEnglish
Title of host publicationProceedings of the International Conference on Wireless Networks (ICWN 2012)
Publication statusPublished - 2012
EventWorld Congress in Computer Science, Computer Engineering, and Applied Computing - Las Vegas, United States
Duration: 16 Jul 201219 Jul 2012
Conference number: 7


ConferenceWorld Congress in Computer Science, Computer Engineering, and Applied Computing
Abbreviated titleWORLDCOMP'12
Country/TerritoryUnited States
CityLas Vegas
Internet address


  • Ad hoc networks
  • Shortest path routing
  • Linear programming
  • Routing metric
  • Mobility


Dive into the research topics of 'Ad hoc networks routing: shortest path is enough'. Together they form a unique fingerprint.

Cite this