Opportunistic routing in wireless Ad Hoc networks: upper bounds for the packet propagation speed

Philippe Jacquet; Bernard Mans; Paul Muhlethaler; Georgios Rodolakis

doi:10.1109/MAHSS.2008.4660054

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

School of Computing

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

5 Citations (Scopus)

11 Downloads (Pure)

Abstract

Classical routing strategies for mobile ad hoc 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 language	English
Title of host publication	5th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, 2008, MASS 2008
Subtitle of host publication	Sept. 29 2008-Oct. 2 2008
Place of Publication	Piscataway, NJ
Publisher	Institute of Electrical and Electronics Engineers (IEEE)
Pages	384-389
Number of pages	6
ISBN (Print)	9781424425754
DOIs	https://doi.org/10.1109/MAHSS.2008.4660054
Publication status	Published - 2008
Event	2008 5th IEEE International Conference on Mobile Ad-Hoc and Sensor Systems, MASS 2008 - Atlanta, GA, United States Duration: 29 Sep 2008 → 2 Oct 2008

Other

Other	2008 5th IEEE International Conference on Mobile Ad-Hoc and Sensor Systems, MASS 2008
Country/Territory	United States
City	Atlanta, GA
Period	29/09/08 → 2/10/08

Bibliographical note

Copyright 2008 IEEE. Reprinted from 5th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, 2008, MASS 2008 : Sept. 29 2008-Oct. 2 2008. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Macquarie Universityâ€™s products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.

Access to Document

10.1109/MAHSS.2008.4660054

Publisher version (open access).pdfFinal published version, 1.62 MB

Cite this

Jacquet, P., Mans, B., Muhlethaler, P., & Rodolakis, G. (2008). Opportunistic routing in wireless Ad Hoc networks: upper bounds for the packet propagation speed. In 5th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, 2008, MASS 2008: Sept. 29 2008-Oct. 2 2008 (pp. 384-389). [4660054] Institute of Electrical and Electronics Engineers (IEEE). https://doi.org/10.1109/MAHSS.2008.4660054

Jacquet, Philippe ; Mans, Bernard ; Muhlethaler, Paul ; Rodolakis, Georgios. / Opportunistic routing in wireless Ad Hoc networks : upper bounds for the packet propagation speed. 5th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, 2008, MASS 2008: Sept. 29 2008-Oct. 2 2008. Piscataway, NJ : Institute of Electrical and Electronics Engineers (IEEE), 2008. pp. 384-389

@inproceedings{18396cc2afe143f0b4e2ecce4ee0e890,

title = "Opportunistic routing in wireless Ad Hoc networks: upper bounds for the packet propagation speed",

abstract = "Classical routing strategies for mobile ad hoc 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.",

author = "Philippe Jacquet and Bernard Mans and Paul Muhlethaler and Georgios Rodolakis",

note = "Copyright 2008 IEEE. Reprinted from 5th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, 2008, MASS 2008 : Sept. 29 2008-Oct. 2 2008. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Macquarie University{\^a}€{\texttrademark}s products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.; 2008 5th IEEE International Conference on Mobile Ad-Hoc and Sensor Systems, MASS 2008 ; Conference date: 29-09-2008 Through 02-10-2008",

year = "2008",

doi = "10.1109/MAHSS.2008.4660054",

language = "English",

isbn = "9781424425754",

pages = "384--389",

booktitle = "5th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, 2008, MASS 2008",

publisher = "Institute of Electrical and Electronics Engineers (IEEE)",

address = "United States",

}

Jacquet, P, Mans, B, Muhlethaler, P & Rodolakis, G 2008, Opportunistic routing in wireless Ad Hoc networks: upper bounds for the packet propagation speed. in 5th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, 2008, MASS 2008: Sept. 29 2008-Oct. 2 2008., 4660054, Institute of Electrical and Electronics Engineers (IEEE), Piscataway, NJ, pp. 384-389, 2008 5th IEEE International Conference on Mobile Ad-Hoc and Sensor Systems, MASS 2008, Atlanta, GA, United States, 29/09/08. https://doi.org/10.1109/MAHSS.2008.4660054

Opportunistic routing in wireless Ad Hoc networks : upper bounds for the packet propagation speed. / Jacquet, Philippe; Mans, Bernard; Muhlethaler, Paul; Rodolakis, Georgios.

5th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, 2008, MASS 2008: Sept. 29 2008-Oct. 2 2008. Piscataway, NJ : Institute of Electrical and Electronics Engineers (IEEE), 2008. p. 384-389 4660054.

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

TY - GEN

T1 - Opportunistic routing in wireless Ad Hoc networks

T2 - 2008 5th IEEE International Conference on Mobile Ad-Hoc and Sensor Systems, MASS 2008

AU - Jacquet, Philippe

AU - Mans, Bernard

AU - Muhlethaler, Paul

AU - Rodolakis, Georgios

N1 - Copyright 2008 IEEE. Reprinted from 5th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, 2008, MASS 2008 : Sept. 29 2008-Oct. 2 2008. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Macquarie Universityâ€™s products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.

PY - 2008

Y1 - 2008

N2 - Classical routing strategies for mobile ad hoc 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.

AB - Classical routing strategies for mobile ad hoc 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.

UR - http://www.scopus.com/inward/record.url?scp=67650665494&partnerID=8YFLogxK

U2 - 10.1109/MAHSS.2008.4660054

DO - 10.1109/MAHSS.2008.4660054

M3 - Conference proceeding contribution

AN - SCOPUS:67650665494

SN - 9781424425754

SP - 384

EP - 389

BT - 5th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, 2008, MASS 2008

PB - Institute of Electrical and Electronics Engineers (IEEE)

CY - Piscataway, NJ

Y2 - 29 September 2008 through 2 October 2008

ER -

Jacquet P, Mans B, Muhlethaler P, Rodolakis G. Opportunistic routing in wireless Ad Hoc networks: upper bounds for the packet propagation speed. In 5th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, 2008, MASS 2008: Sept. 29 2008-Oct. 2 2008. Piscataway, NJ: Institute of Electrical and Electronics Engineers (IEEE). 2008. p. 384-389. 4660054 https://doi.org/10.1109/MAHSS.2008.4660054

Opportunistic routing in wireless Ad Hoc networks: upper bounds for the packet propagation speed

Abstract

Other

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this