research-article

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

Authors:

Philippe Jacquet,

Paul Mühlethaler,

Georgios RodolakisAuthors Info & Claims

IEEE Journal on Selected Areas in Communications, Volume 27, Issue 7

Pages 1192 - 1202

https://doi.org/10.1109/JSAC.2009.090915

Published: 01 September 2009 Publication History

Abstract

Classical routing strategies for mobile ad hoc networks operate in a hop by hop "push mode" basis: packets are forwarded on pre-determined relay nodes, according to previously and independently established link performance metrics (e.g., using hellos or route discovery messages). Conversely, recent research has highlighted the interest in developing opportunistic routing schemes, operating in "pull mode": the next relay can be selected dynamically for each packet and each hop, on the basis of the actual network performance. 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 the simulations show that opportunistic routing performs significantly better. We also investigate the effects of mobility and of random fading. Finally, we present numerical simulations that confirm the accuracy of our bounds.

References

[1]

T. Clausen, P. Jacquet (editors), Optimized Link State Routing protocol, IETF RFC 3626, 2003.

[2]

C. Perkins, E. Belding-Royer, and S. Das, Ad hoc On-demand Distance Vector (AODV) routing, IETF RFC 3561, 2003.

Digital Library

[3]

D. Johnson, Y. Hu and D. Maltz, "The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks", IETF RFC 4728, 2007.

[4]

F. Baccelli, B. Blaszczyszyn, and P. Muhlethaler, An Aloha Protocol for Multihop Mobile Wireless Networks, IEEE Trans. Inform. Theory, 52(2):421-436, 2006.

Digital Library

[5]

B. Blum, T. He, S. Son, and J. Stankovic, "IGF: A state-free robust communication protocol for wireless sensor networks," University of Virginia CS Department, Tech. Rep. CS-2003-1, 2003.

[6]

B. Karp and H. T. Kung, Gpsr: Greedy perimeter stateless routing for wireless networks, in Proc. ACM MOBICOM, 2000.

Digital Library

[7]

F. Baccelli, B. Blaszczyszyn, P. Muhlethaler, "On the Performance of Time-Space Opportunistic Routing in Multihop Mobile Ad Hoc Networks", in Proc. WIOPT, 2008.

[8]

S. Biswas and R. Morris, "Exor: opportunistic multi-hop routing for wireless networks," in Proc. ACM SIGCOMM, 2005.

Digital Library

[9]

B. Sadeghi, V. Kanodia, A. Sabharwal, and E. Knightly, Opportunistic Media Access for Multirate Ad Hoc Networks, in Proc. ACM MOBICOM, 2002.

Digital Library

[10]

C. Westphal, "Opportunistic Routing in Dynamic Ad Hoc Networks: the OPRAH protocol," in Proc. IEEE MASS, 2006.

[11]

Z. Kong and E. Yeh, "On the latency for information dissemination in Mobile Wireless Networks", Proc. ACM MOBIHOC, 2008.

Digital Library

[12]

P. Jacquet, B. Mans and G. Rodolakis, "Information Propagation Speed in Delay Tolerant Networks: Analytic Upper Bounds", in Proc. IEEE ISIT, 2008.

[13]

P. Jacquet, B. Mans and G. Rodolakis, "Information Propagation Speed in Mobile and Delay Tolerant Networks", in Proc. IEEE INFOCOM, 2009.

[14]

Y. Xu and W. Wang, "The speed of information propagation in large wireless networks", in Proc. IEEE INFOCOM, 2008.

[15]

C. Adjih, E. Baccelli, T. Clausen, P. Jacquet, and G. Rodolakis, "Fish eye OLSR Scaling Properties", IEEE J. Commun. Networks, vol. 6, pp. 343-351, 2004.

[16]

V. M. Zolotarev, One-dimensional Stable Distributions, American Mathematical Society, 1986.

[17]

P. Jacquet, "Control of Mobile Ad Hoc Networks", in Proc. IEEE Information Theory Workshop (ITW), 2006.

[18]

B. Bui Xuan, A. Ferreira and A. Jarry, "Computing Shortest, Fastest, and Foremost Journeys in Dynamic Networks", Int. Journal of Foundations of Computer Science, vol. 14(2), pp. 267-285, 2003.

[19]

P. Flajolet and R. Sedgewick, Analytic Combinatorics, Cambridge University Press, ISBN-13: 9780521898065, 2009.

Digital Library

[20]

O. Dousse, F. Baccelli and P. Thiran, Impact of Interferences on Connectivity in Ad Hoc Networks, IEEE/ACM Trans. Networking, 2005.

Digital Library

[21]

M. Abramowitz and I. A. Stegun, Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables, Chapter 9, New York, Dover Publications, 1965.

Digital Library

[22]

P. Gupta and P. R. Kumar, "The capacity of wireless networks", IEEE Trans. Inform. Theory, vol. IT-46(2), pp. 388-404, 2000.

Digital Library

Cited By

Jacquet PTupikina L(2021)Geometry of Outdoor Virus Avoidance in CitiesGeometric Science of Information10.1007/978-3-030-80209-7_93(869-877)Online publication date: 21-Jul-2021
https://dl.acm.org/doi/10.1007/978-3-030-80209-7_93
Yang WPeng S(2017)A mobility model for opportunistic networks in commercial areasInternational Journal of Networking and Virtual Organisations10.1504/IJNVO.2016.08165816:4(402-416)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.1504/IJNVO.2016.081658
Chen YZhu JShen YJiang XTokuda H(2017)On the rate of successful transmissions in finite slotted Aloha MANETsAd Hoc Networks10.1016/j.adhoc.2017.04.00562:C(76-87)Online publication date: 1-Jul-2017
https://dl.acm.org/doi/10.1016/j.adhoc.2017.04.005
Show More Cited By

Opportunistic routing in wireless ad hoc networks: upper bounds for the packet propagation speed
1. Networks
  1. Network protocols
    1. Network layer protocols
  2. Network types
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis

Recommendations

Mobility-based opportunistic routing for mobile ad-hoc networks
PE-WASUN '14: Proceedings of the 11th ACM symposium on Performance evaluation of wireless ad hoc, sensor, & ubiquitous networks

Opportunistic Routing (OR) is an effective and enhanced routing scheme for wireless multihop environment. OR is an approach which selects a certain number of best forwarders (candidates) at each hop by taking the advantage of the broadcast nature of the ...
An Opportunistic Routing Protocol for Mobile Ad Hoc Networks Based on Stable Ideology

In mobile ad hoc networks (MANETs), traditional routing protocols send packets along pre-determined paths which are vulnerable in dealing with unreliable and unpredictable wireless medium. The main difference between the opportunistic routing and the ...
Opportunistic media access control and routing for delay-tolerant mobile ad hoc networks

In delay-tolerant mobile ad hoc networks, motion of network nodes, network sparsity and sporadic density can cause a lack of guaranteed connectivity. These networks experience significant link delay and their routing protocols must take a store-and-...

Comments

Information & Contributors

Information

Published In

cover image IEEE Journal on Selected Areas in Communications

IEEE Journal on Selected Areas in Communications Volume 27, Issue 7

Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks

September 2009

282 pages

ISSN:0733-8716

Issue’s Table of Contents

Copyright © 2009.

Publisher

IEEE Press

Publication History

Published: 01 September 2009

Revised: 31 January 2009

Received: 30 August 2008

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 11 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Jacquet PTupikina L(2021)Geometry of Outdoor Virus Avoidance in CitiesGeometric Science of Information10.1007/978-3-030-80209-7_93(869-877)Online publication date: 21-Jul-2021
https://dl.acm.org/doi/10.1007/978-3-030-80209-7_93
Yang WPeng S(2017)A mobility model for opportunistic networks in commercial areasInternational Journal of Networking and Virtual Organisations10.1504/IJNVO.2016.08165816:4(402-416)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.1504/IJNVO.2016.081658
Chen YZhu JShen YJiang XTokuda H(2017)On the rate of successful transmissions in finite slotted Aloha MANETsAd Hoc Networks10.1016/j.adhoc.2017.04.00562:C(76-87)Online publication date: 1-Jul-2017
https://dl.acm.org/doi/10.1016/j.adhoc.2017.04.005
Mans BMathieson L(2014)On the treewidth of dynamic graphsTheoretical Computer Science10.1016/j.tcs.2013.12.024554:C(217-228)Online publication date: 16-Oct-2014
https://dl.acm.org/doi/10.1016/j.tcs.2013.12.024
Wang XWang SLiang WHuang JBie RChen D(2014)The Tempo-spatial Properties of Information Dissemination to Time-Varying Destination Areas in Mobile Opportunistic NetworksProceedings of the 9th International Conference on Wireless Algorithms, Systems, and Applications - Volume 849110.1007/978-3-319-07782-6_40(436-445)Online publication date: 23-Jun-2014
https://dl.acm.org/doi/10.1007/978-3-319-07782-6_40
Dong L(2012)Opportunistic media access control and routing for delay-tolerant mobile ad hoc networksWireless Networks10.1007/s11276-012-0444-118:8(949-965)Online publication date: 1-Nov-2012
https://dl.acm.org/doi/10.1007/s11276-012-0444-1
Haenggi MAndrews JBaccelli FDousse OFranceschetti M(2009)Stochastic geometry and random graphs for the analysis and design of wireless networksIEEE Journal on Selected Areas in Communications10.1109/JSAC.2009.09090227:7(1029-1046)Online publication date: 1-Sep-2009
https://dl.acm.org/doi/10.1109/JSAC.2009.090902

View Options

View options

Figures

Tables

Media

View Issue’s Table of Contents