Skip to main content
SpringerLink
Log in

Opportunistic Routing in Wireless Mesh Networks

  • Chapter
  • First Online:
Routing in Opportunistic Networks

Abstract

Opportunistic Routing (OR) has been proposed as a way to increase the performance of wireless networks by exploiting its broadcast nature. In OR, instead of pre-selecting a single specific node to be the next-hop as a forwarder for a packet, multiple nodes can potentially be selected as the next-hop forwarder. Thus the source can use multiple potential paths to deliver the packets to the destination. More specially, when the current node transmits a packet, all the candidates that receive the packet successfully will coordinate with each other to determine which one would actually forward the packet according to some criteria, while the other nodes will simply discard the packet. In this chapter, we survey the state of the art in OR, then focus on the candidates selection algorithms and carry out a comparative performance evaluation of the most relevant proposals appeared in the literature.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Aguayo D, Bicket J, Biswas S, Judd G, Morris R (2004) Link-level measurements from an 802.11b mesh network. SIGCOMM Comput Commun Rev 34:121–132. doi:10.1145/1030194.1015482

    Article  Google Scholar 

  2. Ahlswede R, Cai N, Li SY, Yeung R (2000) Network information flow. IEEE Trans Inf Theor 46(4):1204–1216. doi:10.1109/18.850663

    Article  MathSciNet  MATH  Google Scholar 

  3. Baccelli F, Blaszczyszyn B, Muhlethaler P (2008) On the performance of time-space opportunistic routing in multihop mobile ad hoc networks. In: 6th International Symposium on Modeling and optimization in Mobile, Ad Hoc, and Wireless Networks and Workshops, 2008. WiOPT 2008. pp 307–316. doi: 10.1109/WIOPT.2008.4586083

  4. Biswas S, Morris R (2004) Opportunistic routing in multi-hop wireless networks. ACM SIGCOMM Comput Commun Rev 34(1):69–74

    Article  Google Scholar 

  5. Biswas S, Morris R (2005) ExOR: opportunistic multi-hop routing for wireless networks. ACM SIGCOMM Comput Commun Rev 35(4):133–144

    Article  Google Scholar 

  6. Bruno R, Nurchis M (2010) Survey on diversity based routing in wireless mesh networks: challenges and solutions. Comput Commun 33(3):269–282. doi:10.1016/j.comcom.2009.09.003

    Article  Google Scholar 

  7. Cacciapuoti A, Caleffi M, Paura L (2010) Optimal constrained candidate selection for opportunistic routing. In: IEEE GLOBECOM, pp 1–5. doi:10.1109/GLOCOM.2010.5683490

  8. Cerdà-Alabern L, Darehshoorzadeh A, Pla V (2010) On the maximum performance in opportunistic routing. In: 2010 IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks (WoWMoM), pp 1–8. doi:10.1109/WOWMOM.2010.5534897

  9. Cerdà-Alabern L, Pla V, Darehshoorzadeh A (2010) On the performance modeling of opportunistic routing. In: MobiOpp ’10: Proceedings of the Second International Workshop on Mobile Opportunistic Networking, ACM, New York, pp 15–21. doi:10.1145/1755743.1755747

  10. Chachulski S, Jennings M, Katti S, Katabi D (2007) Trading structure for randomness in wireless opportunistic routing. In: SIGCOMM ’07: Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications, ACM, New York, pp 169–180

    Google Scholar 

  11. Darehshoorzadeh A, Cerdà-Alabern L (2011) A new multicast opportunistic routing protocol for wireless mesh networks. In: Casares-Giner V, Manzoni P, Pont A (eds) NETWORKING 2011 workshops, lecture notes in computer science, vol. 6827, Springer, Berlin, pp 62–72

    Google Scholar 

  12. Darehshoorzadeh A, Cerdà-Alabern L (2012) Distance progress based opportunistic routing for wireless mesh networks. (Accepted). In: Wireless communications and mobile computing conference, IWCMC ’12. International

    Google Scholar 

  13. Darehshoorzadeh A, Cerdà-Alabern L, Pla V (2011) Modeling and comparison of candidate selection algorithms in opportunistic routing. Comput Netw 55(13):2886–2898. doi:10.1016/j.comnet.2011.06.009

    Article  Google Scholar 

  14. De Couto DSJ, Aguayo D, Bicket J, Morris R (2005) A high-throughput path metric for multi-hop wireless routing. Wirel Netw 11(4):419–434

    Article  Google Scholar 

  15. Dubois-Ferriere H, Grossglauser M, Vetterli M (2007) Least-cost opportunistic routing. In: Proceedings of 2007 allerton conference on communication, control, and computing

    Google Scholar 

  16. Dubois-Ferriere H, Grossglauser M, Vetterli M (2011) Valuable detours: least-cost anypath routing. IEEE/ACM Trans Netw 19(2):333–346. doi:10.1109/TNET.2010.2070844

    Article  Google Scholar 

  17. Dubois-Ferriére H, Grossglauser M, Vetterli M (2011) Valuable detours: least-cost anypath routing. IEEE/ACM Trans Netw 19(2):333–346

    Article  Google Scholar 

  18. Fuste-Vilella D, Garcia-Vidal J, Morillo-Pozo J (2008) Cooperative forwarding in IEEE 802.11-based MANETs. In: Wireless Days, 2008. WD ’08. 1st IFIP, pp 1–5. doi:10.1109/WD.2008.4812845

  19. Hsu CJ, Liu HI, Seah WKG (2011) Opportunistic routing—a review and the challenges ahead. Comput Netw 55(15):3592–3603

    Article  Google Scholar 

  20. Jain S, Das SR (2008) Exploiting path diversity in the link layer in wireless ad hoc networks. Ad Hoc Netw 6(5):805–825

    Article  Google Scholar 

  21. Katti S, Rahul H, Hu W, Katabi D, Médard M, Crowcroft J (2006) Xors in the air: practical wireless network coding. In: Proceedings of the 2006 conference on applications, technologies, architectures, and protocols for computer communications, SIGCOMM ’06, ACM, New York, pp 243–254

    Google Scholar 

  22. Katti S, Rahul H, Hu W, Katabi D, Médard M, Crowcroft J (2008) XORs in the air: practical wireless network coding. IEEE/ACM Trans Netw 16(3):497–510

    Article  Google Scholar 

  23. Koutsonikolas D, Hu Y, Wang CC (2009) Pacifier: High-throughput, reliable multicast without “crying babies” in wireless mesh networks. In: INFOCOM 2009, IEEE, pp 2473–2481

    Google Scholar 

  24. Kurth M, Zubow A, Redlich JP (2008) Cooperative opportunistic routing using transmit diversity in wireless mesh networks. In: IEEE INFOCOM, pp 1310–1318. doi:10.1109/INFOCOM.2008.188

  25. Larsson P (2001) Selection diversity forwarding in a multihop packet radio network with fading channel and capture. SIGMOBILE Mob Comput Commun Rev 5(4):47–54. http://doi.acm.org/10.1145/509506.509517

  26. Larsson P (2001) Selection diversity forwarding in a multihop packet radio network with fading channel and capture. SIGMOBILE Mob Comput Commun Rev 5(4):47–54. doi:10.1145/509506.509517

    Article  Google Scholar 

  27. Latouche G, Ramaswami V (1999) Introduction to matrix analytic methods in stochastic modeling. ASA-SIAM

    Google Scholar 

  28. Laufer R, Velloso P, Vieira L, Kleinrock L (2012) Plasma: a new routing paradigm for wireless multihop networks. In: INFOCOM, 2012 Proceedings IEEE, pp 2706–2710. doi:10.1109/INFCOM.2012.6195683

  29. Le J, Lui J, Chiu DM (2008) Dcar: Distributed coding-aware routing in wireless networks. In: The 28th international conference on distributed computing systems, 2008. ICDCS ’08. pp 462–469. doi:10.1109/ICDCS.2008.84

  30. Le T, Liu Y (2010) Opportunistic overlay multicast in wireless networks. In: GLOBECOM, pp. 1–5

    Google Scholar 

  31. Li Y, Chen W, Zhang ZL (2009) Optimal forwarder list selection in opportunistic routing. In: IEEE 6th International Conference on mobile adhoc and sensor systems, 2009. MASS ’09. pp 670–675. doi:10.1109/MOBHOC.2009.5336939

  32. Li Y, Zhang ZL (2010) Random walks on digraphs: a theoretical framework for estimating transmission costs in wireless routing. In: 29th conference on information communications, INFOCOM’10, IEEE Press, pp 2775–2783

    Google Scholar 

  33. Liu H, Zhang B, Mouftah H, Shen X, Ma J (2009) Opportunistic routing for wireless ad hoc and sensor networks: Present and future directions. Commun Mag IEEE 47(12):103–109. doi:10.1109/MCOM.2009.5350376

    Article  Google Scholar 

  34. Lu M, Wu J (2009) Opportunistic routing algebra and its applications. In: IEEE INFOCOM, pp 2374–2382. doi:10.1109/INFCOM.2009.5062164

  35. Luk CP, Lau WC, Yue OC (2008) An analysis of opportunistic routing in wireless mesh network. In: IEEE International Conference on Communications, 2008. ICC ’08, pp 2877–2883. doi:10.1109/ICC.2008.542

  36. R Development Core Team: R: A language and environment for statistical computing. R foundation for statistical computing, Vienna, Austria (2008). http://www.R-project.org. ISBN 3-900051-07-0

  37. Rozner E, Seshadri J, Mehta Y, Qiu L (2009) Soar: simple opportunistic adaptive routing protocol for wireless mesh networks. IEEE Trans Mob Comput 8(12):1622–1635. doi:10.1109/TMC.2009.82

    Article  Google Scholar 

  38. Shah R, Wietholter S, Wolisz A (2005) Modeling and analysis of opportunistic routing in low traffic scenarios. In: Third international symposium on modeling and optimization in mobile, ad hoc, and wireless networks, 2005. WIOPT 2005, IEEE, pp 294–304

    Google Scholar 

  39. Trivin̋o-Cabrera A, Can̋adas-Hurtado S (2011) Survey on opportunistic routing in multihop wireless networks. IJCNIS 3(2)

    Google Scholar 

  40. The Network Simulator ns-2. http://www.isi.edu/nsnam/ns (Last visited April 23, 2013)

  41. WenZhong Y, ZhenYu Z, Bo W, XiaoHong W (2010) A reliable multicast for manets based on opportunistic routing. In: 2010 6th International Conference on wireless communications networking and mobile computing (WiCOM), pp 1–4

    Google Scholar 

  42. Westphal C (2006) Opportunistic routing in dynamic ad hoc networks: the oprah protocol. In: 2006 IEEE international conference on mobile adhoc and sensor systems (MASS), pp 570–573. doi:10.1109/MOBHOC.2006.278612

  43. Wu J, Lu M, Li F (2008) Utility-based opportunistic routing in multi-hop wireless networks. In: The 28th international conference on distributed computing systems, 2008. ICDCS’08, pp 470–477

    Google Scholar 

  44. Wu Y, Das S, Chandra R (2007) Routing with a markovian metric to promote local mixing. In: INFOCOM 2007. 26th IEEE international conference on computer communications, IEEE, pp 2381–2385. doi:10.1109/INFCOM.2007.285

  45. Yan Y, Zhang B, Mouftah H, Ma J (2008) Practical coding-aware mechanism for opportunistic routing in wireless mesh networks. In: IEEE international conference on communications, 2008. ICC ’08, pp 2871–2876

    Google Scholar 

  46. Yan Y, Zhang B, Zheng J, Ma J (2010) Core: a coding-aware opportunistic routing mechanism for wireless mesh networks [accepted from open call]. Wirel Commun IEEE 17(3):96–103. doi:10.1109/MWC.2010.5490984

    Article  Google Scholar 

  47. Yang S, Zhong F, Yeo CK, Lee BS, Boleng J (2009) Position based opportunistic routing for robust data delivery in manets. In: Global telecommunications conference, 2009. GLOBECOM 2009, IEEE, pp 1–6. doi:10.1109/GLOCOM.2009.5425351

  48. Yanhua Li WC, Zhang ZL (2008) Design of forwarder list selection scheme in opportunistic routing protocol. Technical-report, University of Minnesota, Minneapolis, USA

    Google Scholar 

  49. Yuan Y, Yang H, Wong S, Lu S, Arbaugh W (2005) ROMER: Resilient opportunistic mesh routing for wireless mesh networks. In: IEEE workshop on wireless mesh networks (WiMesh)

    Google Scholar 

  50. Zeng K, Lou W, Yang J (2007) On throughput efficiency of geographic opportunistic routing in multihop wireless networks. Mob Netw Appl 12:347–357. doi:10.1007/s11036-008-0051-7

    Article  Google Scholar 

  51. Zhao B, Seshadri RI, Valenti MC, Geraf HL, That HA (2004) Geographic random forwarding with hybrid-arq for ad hoc networks with rapid sleep cycles. In: Proceedings of IEEE Military Communication Conference (MILCOM)

    Google Scholar 

  52. Zhong Z, Wang J, Nelakuditi S, Lu GH (2006) On selection of candidates for opportunistic anypath forwarding. SIGMOBILE Mob Comput Commun Rev 10(4):1–2. doi:10.1145/1215976.1215978

    Article  Google Scholar 

  53. Zorzi M, Rao R (2003) Geographic random forwarding (geraf) for ad hoc and sensor networks: multihop performance. IEEE Trans Mob Comput 2(4):337–348. doi:10.1109/TMC.2003.1255648

    Article  Google Scholar 

Download references

Acknowledgments

This work was supported by the Spanish government and Generalitat de Catalunya through projects TIN2010-21378-C02-01, TIN2010-21378-C0202 and 2009-SGR-1167, respectively, and by the European Commission through the NoE EuroNF.

Author information

Authors and Affiliations

  1. Computer Architecture Department, University Politècnica de Catalunya, Catalunya, Spain

    Amir Darehshoorzadeh & Llorenç Cerdà-Alabern

  2. Communications Department, University Politècnica de València, València, Spain

    Vicent Pla

Authors
  1. Amir Darehshoorzadeh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Llorenç Cerdà-Alabern
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Vicent Pla
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Amir Darehshoorzadeh .

Editor information

Editors and Affiliations

  1. George Vari Engineering and Computing Centre, ENG 282, Ryerson University Department of Computer Science, Toronto, Ontario, Canada

    Isaac Woungang

  2. Netaji Subhas Institute of Technology Azad Hing Fauj Marg
Sector - 3, University of Delhi Division of Information Technology, New Delhi, India

    Sanjay Kumar Dhurandher

  3. George Vari Engineering and Computing Ce, Ryerson University Department of Electrical and Computer En, Toronto, Canada

    Alagan Anpalagan

  4. University of Western Macedonia, N. Erythraia, Greece

    Athanasios V. Vasilakos

11.1 Electronic supplementary material

Below is the link to the electronic supplementary material.

Glossary

Glossary

 

COPE:

Name used to identify the OR scheme using Network Coding proposed in [21]

CORE:

Coding-aware Opportunistic Routing mechanism & Encoding

CS:

Candidates Set

CTS:

Clear-To-Send

DPOR:

Distance Progress Opportunistic Routing

DTMC:

Discrete Time Markov Chain

EAX:

Expected Any-Path Transmission

EOT:

Expected One-hop Throughput

ETX:

Expected Transmission Count

ExOR:

Extremely Opportunistic Routing

GeRaF:

Geographic Random Forwarding

GOR:

Geographic Opportunistic Routing

LCOR:

Least-Cost Opportunistic Routing

NAV:

Network Allocation Vector

NC:

Network Coding

MORE:

MAC-independent Opportunistic Routing & Encoding

MORP:

Multicast Opportunistic Routing Protocol

MSTOR:

Minimum Steiner Tree with Opportunistic Routing

MTS:

Minimum Transmission Selection

OAPF:

Opportunistic Any-Path Forwarding

OR:

Opportunistic Routing

POR:

Position based Opportunistic Routing

RTS:

Request-To-Send

SDF:

Selection Diversity Forwarding

SIFS:

Short Interframe Space

SOAR:

Simple Opportunistic Adaptive Routing

SPF:

Shortest Path First

VANET:

Vehicular Ad Hoc Network

MWN:

Multi-hop Wireless Network

 

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media New York

About this chapter

Cite this chapter

Darehshoorzadeh, A., Cerdà-Alabern, L., Pla, V. (2013). Opportunistic Routing in Wireless Mesh Networks. In: Woungang, I., Dhurandher, S., Anpalagan, A., Vasilakos, A. (eds) Routing in Opportunistic Networks. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-3514-3_11

Download citation

  • DOI: https://doi.org/10.1007/978-1-4614-3514-3_11

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4614-3513-6

  • Online ISBN: 978-1-4614-3514-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation