Performance of multihop wireless networks: shortest path is not enough

  • Authors:

  • Douglas S. J. De Couto;Daniel Aguayo;Benjamin A. Chambers;Robert Morris

  • Affiliations:

  • M.I.T. Laboratory for Computer Science;M.I.T. Laboratory for Computer Science;M.I.T. Laboratory for Computer Science;M.I.T. Laboratory for Computer Science

  • Venue:
  • ACM SIGCOMM Computer Communication Review
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Existing wireless ad hoc routing protocols typically find routes with the minimum hop-count. This paper presents experimental evidence from two wireless test-beds which shows that there are usually multiple minimum hop-count paths, many of which have poor throughput. As a result, minimum-hop-count routing often chooses routes that have significantly less capacity than the best paths that exist in the network. Much of the reason for this is that many of the radio links between nodes have loss rates low enough that the routing protocol is willing to use them, but high enough that much of the capacity is consumed by retransmissions. These observations suggest that more attention be paid to link quality when choosing ad hoc routes; the paper presents measured link characteristics likely to be useful in devising a better path quality metric.