Probabilistic Routing Schemes for Ad Hoc Opportunistic Networks

  • Vangelis Angelakis
  • Elias Tragos
  • George Perantinos
  • Di Yuan
Chapter

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.

Keywords

Cross-layer Forwarding Routing Sensor network Vehicular network Protocols 

Notes

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.

References

  1. 1.
    Misra S, Woungang I, Misra SC (eds) (2009) Guide to wireless ad hoc networks. Computer communication network series. Springer, BerlinGoogle Scholar
  2. 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. 3.
    Cerf CG et al (2007) Delay tolerant network architecture. RFC 4838Google Scholar
  4. 4.
    Wang Y et al (2007) A survey on analytic studies of delay-tolerant mobile sensor networks. J Wirel Commun Mobile Comput 7:1197–1208CrossRefGoogle Scholar
  5. 5.
    Vahdat A, Becker D (2000) Epidemic routing for partially-connected ad hoc networks. Duke technical report CS-2000-06Google Scholar
  6. 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 DepartmentGoogle Scholar
  7. 7.
    Demers A et al (1988) Epidemic algorithms for replicated database maintenance. ACMSIGOPS Oper Syst Rev 22:8–32 (ACM Press)Google Scholar
  8. 8.
    Juang P et al (2002) Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with Zebranet. In: ASPLOS-XGoogle Scholar
  9. 9.
    Small T, Haas ZJ (2003) The shared wireless infostation model—a new ad hoc networking paradigm. In: ACM MobiHocGoogle Scholar
  10. 10.
    Groenevelt R, Nain P, Koole G (2005) The message delay in mobile ad hoc networks. Perform Eval 62:210–228CrossRefGoogle Scholar
  11. 11.
    Small T, Haas ZJ (2005) Resource and performance tradeoffs in delay-tolerant wireless networks. In: ACM workshop on delay tolerant networkingGoogle Scholar
  12. 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 networkingGoogle Scholar
  13. 13.
    Daley DJ, Gani J (1999) Epidemic modelling. Cambridge University Press, CambridgeMATHGoogle Scholar
  14. 14.
    Zhang X et al (2007) Performance modeling of epidemic routing. Comput Netw 51:2867–2891CrossRefMATHGoogle Scholar
  15. 15.
    Lindgren A, Doria A, Scheleny O (2003) Probabilistic routing in intermittently connected networks. In: ACM MobiHocGoogle Scholar
  16. 16.
    The Networking for Communications Challenged Communities project. http://www.n4c.eu/
  17. 17.
    Karvo J, Ott J (2008) Time scales and delay-tolerant routing protocols. In: ACM MobiCom CHANTSGoogle Scholar
  18. 18.
    Keränen A, Ott J, Kärkkäinen T (2009) The ONE simulator for DTN protocol evaluation. In: ICST SIMUToolsGoogle Scholar
  19. 19.
    Grasic S et al (2011) The evolution of a DTN routing protocol—PRoPHETv2. In: ACM MobiCom CHANTSGoogle Scholar
  20. 20.
    Burgess J et al (2006) MaxProp: routing for vehicle-based disruption-tolerant networks. In: IEEE INFOCOMGoogle Scholar
  21. 21.
    Barrett CL et al (2005) Parametric probabilistic routing in sensor networks. Mobile Netw Appl 10(4):529–544CrossRefGoogle Scholar
  22. 22.
    Nguyen HA, Giordano S, Puiatti A (2007) Probabilistic routing protocol for intermittently connected mobile ad hoc networks (PROPICMAN). In: IEEE WoWMoMGoogle Scholar
  23. 23.
    The FP6-IST HAGGLE Project. http://www.haggleproject.org/
  24. 24.
    Gazoni N et al (2010) A framework for opportunistic routing in multi-hop wireless networks. In: ACM PE-WASUNGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  • Vangelis Angelakis
    • 1
  • Elias Tragos
    • 2
  • George Perantinos
    • 3
  • Di Yuan
    • 1
  1. 1.Department of Science and TechnologyLinköping UniversityLinköpingSweden
  2. 2.Institute of Computer ScienceFoundation for Research and Technology—HellasHeraklionGreece
  3. 3.Forthnet S.A.AthensGreece

Personalised recommendations