Opportunistic routing in wireless ad hoc networks: upper bounds for the packet propagation speed

Philippe Jacquet*, Bernard Mans, Paul Muhlethaler, Georgios Rodolakis

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review


Classical routing strategies for mobile ad hoe networks forward packets on a pre-defined route (typically obtained by a shortest path routing protocol). Recent research has highlighted the interest in developing opportunistic routing schemes, where the next relay is selected dynamically for each packet and each hop. This allows each packet to take advantage of the local pattern of transmissions at any time. The objective of such opportunistic routing schemes is to minimize the end-to-end delay required to carry a packet from the source to the destination.

In this paper, we provide upper bounds on the packet propagation speed for opportunistic routing, in a realistic network model where link conditions are variable. We analyze the performance of various opportunistic routing strategies and we compare them with classical routing schemes. The analysis and simulations show that opportunistic routing performs significantly better. We also investigate the effects of mobility. Finally, we present numerical simulations that confirm the accuracy of our bounds.

Original languageEnglish
Title of host publication2008 fifth IEEE International conference on mobile ad-hoc and sensor systems, Vols 1 and 2
Place of PublicationPiscataway, NJ
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Number of pages2
ISBN (Print)9781424425747
Publication statusPublished - 2008
Event5th IEEE International Conference on Mobile Ad-Hoc and Sensor Systems - Atlanta, Gabon
Duration: 29 Sep 20082 Oct 2008


Conference5th IEEE International Conference on Mobile Ad-Hoc and Sensor Systems

Cite this