Skip to main content
SpringerLink
Log in

Probabilistic Routing Schemes for Ad Hoc Opportunistic Networks

  • Chapter
  • First Online:
Routing in Opportunistic Networks

Abstract

In this chapter, we review probabilistic schemes for routing in ad hoc opportunistic networks. The literature holds a vast number of publications. For this, we select only a handful of the most influential schemes that have appeared and conclude by giving a brief overview of a recently proposed simulation framework whose goal is to provide understanding of how lower layer conditions affect the decision of the probabilistic parameters in such a scheme.

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. Misra S, Woungang I, Misra SC (eds) (2009) Guide to wireless ad hoc networks. Computer communication network series. Springer, Berlin

    Google Scholar 

  2. Rajaraman R (2002) Topology control and routing in ad hoc networks: a survey. ACM SIGACT News. doi:10.1145/564585.564602

    Google Scholar 

  3. Cerf CG et al (2007) Delay tolerant network architecture. RFC 4838

    Google Scholar 

  4. Wang Y et al (2007) A survey on analytic studies of delay-tolerant mobile sensor networks. J Wirel Commun Mobile Comput 7:1197–1208

    Article  Google Scholar 

  5. Vahdat A, Becker D (2000) Epidemic routing for partially-connected ad hoc networks. Duke technical report CS-2000-06

    Google Scholar 

  6. Ganesan D et al (2002) An empirical study of epidemic algorithms in large scale multihop wireless networks. Technical report UCLA/CSD-TR-02-0013, UCLA Computer Science Department

    Google Scholar 

  7. Demers A et al (1988) Epidemic algorithms for replicated database maintenance. ACMSIGOPS Oper Syst Rev 22:8–32 (ACM Press)

    Google Scholar 

  8. Juang P et al (2002) Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with Zebranet. In: ASPLOS-X

    Google Scholar 

  9. Small T, Haas ZJ (2003) The shared wireless infostation model—a new ad hoc networking paradigm. In: ACM MobiHoc

    Google Scholar 

  10. Groenevelt R, Nain P, Koole G (2005) The message delay in mobile ad hoc networks. Perform Eval 62:210–228

    Article  Google Scholar 

  11. Small T, Haas ZJ (2005) Resource and performance tradeoffs in delay-tolerant wireless networks. In: ACM workshop on delay tolerant networking

    Google Scholar 

  12. Spyropoulos T, Psounis K, Raghavendra CS (2005) Spray and wait: an efficient routing scheme for intermittently connected mobile networks. In: ACM workshop on delay-tolerant networking

    Google Scholar 

  13. Daley DJ, Gani J (1999) Epidemic modelling. Cambridge University Press, Cambridge

    MATH  Google Scholar 

  14. Zhang X et al (2007) Performance modeling of epidemic routing. Comput Netw 51:2867–2891

    Article  MATH  Google Scholar 

  15. Lindgren A, Doria A, Scheleny O (2003) Probabilistic routing in intermittently connected networks. In: ACM MobiHoc

    Google Scholar 

  16. The Networking for Communications Challenged Communities project. http://www.n4c.eu/

  17. Karvo J, Ott J (2008) Time scales and delay-tolerant routing protocols. In: ACM MobiCom CHANTS

    Google Scholar 

  18. Keränen A, Ott J, Kärkkäinen T (2009) The ONE simulator for DTN protocol evaluation. In: ICST SIMUTools

    Google Scholar 

  19. Grasic S et al (2011) The evolution of a DTN routing protocol—PRoPHETv2. In: ACM MobiCom CHANTS

    Google Scholar 

  20. Burgess J et al (2006) MaxProp: routing for vehicle-based disruption-tolerant networks. In: IEEE INFOCOM

    Google Scholar 

  21. Barrett CL et al (2005) Parametric probabilistic routing in sensor networks. Mobile Netw Appl 10(4):529–544

    Article  Google Scholar 

  22. Nguyen HA, Giordano S, Puiatti A (2007) Probabilistic routing protocol for intermittently connected mobile ad hoc networks (PROPICMAN). In: IEEE WoWMoM

    Google Scholar 

  23. The FP6-IST HAGGLE Project. http://www.haggleproject.org/

  24. Gazoni N et al (2010) A framework for opportunistic routing in multi-hop wireless networks. In: ACM PE-WASUN

    Google Scholar 

Download references

Acknowledgments

The authors acknowledge the support of the Swedish ELLIIT research center, the Swedish Research Council (Vetenskapsrådet), the EU-FP7 MC-IRSES Project 318992, and the EU-FP7 Marie Curie project MESH-WISE.

Author information

Authors and Affiliations

  1. Department of Science and Technology, Linköping University, Linköping, Sweden

    Vangelis Angelakis & Di Yuan

  2. Institute of Computer Science, Foundation for Research and Technology—Hellas, Heraklion, Greece

    Elias Tragos

  3. Forthnet S.A., Athens, Greece

    George Perantinos

Authors
  1. Vangelis Angelakis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Elias Tragos
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. George Perantinos
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Di Yuan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vangelis Angelakis .

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

8.1 Electronic supplementary material

Below is the link to the electronic supplementary material.

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media New York

About this chapter

Cite this chapter

Angelakis, V., Tragos, E., Perantinos, G., Yuan, D. (2013). Probabilistic Routing Schemes for Ad Hoc Opportunistic 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_8

Download citation

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

  • 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