Advertisement

Routing Protocols in Infrastructure-Less Opportunistic Networks

  • Sanjay Kumar Dhurandher
  • Deepak Kumar Sharma
  • Isaac Woungang
  • Shruti Bhati
Chapter

Abstract

Opportunistic Networks (OppNets) remain one of the most researched extensions of Mobile Ad hoc Networks (MANETs) in the present times. Although characterized by sparse connectivity and indefinite paths, OppNets are highly scalable and flexible. They are quite different from the traditional MANETs as there is never a fixed path between the source and the destination, while in MANETs first a path is established between the sender and the receiver and then the message transfer takes place. They are considered as the subclass of Delay Tolerant Networks (DTN) as they support various features of DTNs. The delivery of message is reliant on hop-to-hop distribution through the network. A varying number of routing schemes have been proposed in the literature that cater to the efficient delivery of messages for various scenarios, movement models, and infrastructure. In this chapter, we present the recent related work focusing on the already existing routing protocols of infrastructure-less OppNets for various scenarios along with their relative advantages and disadvantages.

Keywords

Opportunistic networks Opportunistic routing Infrastructure-less protocols Delay tolerant networks Direct transmission First contact Epidemic routing Spray and wait Spray and focus Adaptive spray and wait  PRoPHET PRoPHET+ HiBOp Content encounter probability-based message forwarding (CEMPF) Robust proactive routing protocol Repository-based forwarding protocol MaxProp Context-aware routing (CAR) Meetings and visits (MV) Network coding 

References

  1. 1.
    Barr R, Haas ZJ (2005) Jist: An efficient approach to simulation using virtual machines. Software practice & experience. Wiley, New York, pp 539–576Google Scholar
  2. 2.
    Boldrini C, Conti M, Iacopini I, Passarella A (2007) HiBOp: a history based routing protocol for opportunistic networks. In: Proceedings of IEEE international symposium on world of wireless, mobile and multimedia networks, 2007 (WoWMoM 2007), Espoo, Finland, 18–21 June 2007, pp 1–12Google Scholar
  3. 3.
    Burgess J, Gallagher B, Jensen D, Levine BN (2006) Maxprop: routing for vehicle-based disruption-tolerant networks. In: Proceedings of 25th IEEE international conference on computer communications (INFOCOM 2006), Barcelona, Spain, 23–29 April 2006, pp 1–11Google Scholar
  4. 4.
    Burns B, Brock O, Levine BN (2005) MV routing and capacity building in disruption tolerant networks. In: Proceedings of IEEE 24th annual joint conference of the IEEE computer and communications societies (INFOCOM 2005), vol 1, Miami, FL, USA, 13–17 March 2005, pp 398–408Google Scholar
  5. 5.
    Camp T, Boleng J, Davies V (2002) A survey of mobility models for ad hoc network research. Wireless Commun Mobile Comput (WCMC): Spec Issue Mobile Ad Hoc Netw Res Trends Appl 2(5):483–502Google Scholar
  6. 6.
    Chaintreau A, Hui P, Crowcroft J, Diot C, Gass R, Scott J (2006) Impact of human mobility on the design of opportunistic forwarding algorithms. In: Proceedings of 25th IEEE international conference on computer communications (INFOCOM 2006), Barcelona, Spain, 23–29 April 2006, pp 1–13Google Scholar
  7. 7.
    Chen L-J, Hung Yu C, Tseng C, Chu H, Chou C (2008) A content-centric framework for effective data dissemination in opportunistic networks. IEEE J Sel Areas Commun 26(5):761–772CrossRefGoogle Scholar
  8. 8.
    Conti Marco, Kumar Mohan (2010) Opportunities in opportunistic computing. IEEE Comput J Mag 43(1):42–50CrossRefGoogle Scholar
  9. 9.
    Conti M, Crowcroft J, Giordano S, Hui P, Nguyen HA, Passarella A (2009) Routing issues in opportunistic networks. In: Miranda H, Rodrigues L, Garbinato B (eds) MiNEMA state-of-the-art book. Springer, BerlinGoogle Scholar
  10. 10.
    Delay Tolerant Network Research Group (DTNRG), http://www.dtnrg.org/
  11. 11.
    Dhurandher SK, Sharma DK, Woungang I, Chao HC (2011) Performance evaluation of various routing Protocols in opportunistic networks. In: Proceedings of IEEE GLOBECOM workshop 2011, Houston, Texas, USA, 5–9 Dec 2011, pp 1067–1071Google Scholar
  12. 12.
    Ekman F, Keränen A, Karvo J, Ott J (2008) Working day movement model. In: Proceeding of the 1st ACM SIGMOBILE workshop on mobility models (MobiHoc 2008), Hong Kong SAR, China, 27–30 May 2008, pp 33–40Google Scholar
  13. 13.
    Fall K (2003) A delay-tolerant network architecture for challenged internets. In: proceedings of ACM SIGCOMM 2003, Karlsruhe, Germany, 25–29 Aug 2003, pp 27–34Google Scholar
  14. 14.
    Goodman DJ, Borras J, Mandayam NB, Yates RD (1997) INFOSTATIONS: a new system model for data and messaging services. In: IEEE vehicular technology conference 1997( VTC’97), vol 2, May 1997, pp 969–973Google Scholar
  15. 15.
    Greede A, Allen SM, Whitaker RM (2009) RFP: repository based forwarding protocol for opportunistic networks. In: Proceedings of third international conference on next generation mobile applications, services and technologies (NGMAST ’09), Cardiff, Wales, 15–18 Sept 2009, pp 329–334Google Scholar
  16. 16.
    Huang C-M, Lan K-C, Tsai C-Z (2008) A survey of opportunistic networks. In: Proceedings of the 22 nd international conference on advanced information networking and applications- workshops, 2008 (AINAW 2008), Okinawa, Japan, 25–28 March 2008, pp 1672–1677Google Scholar
  17. 17.
    Huang T-K, Lee C-K, Chen L-J (2010) PRoPHET+: An adaptive PRoPHET-based routing protocol for opportunistic network. In: Proceedings of 24th IEEE international conference on advanced information networking and applications (AINA 2010), Perth, Australia, 20–13 April 2010, pp 112–119Google Scholar
  18. 18.
    Jain S, Fall K, Patra R (2004) Routing in a delay tolerant network. In: Proceedings of ACM SIGCOMM 2004, Portland/ Oregon/ USA, 30 Aug–3 Sept 2004, pp 145–158Google Scholar
  19. 19.
    Jain S, Shah RC, Brunette W, Borriello G, Roy S (2006) Exploiting mobility for energy efficient data collection in wireless sensor networks. In: ACM/Kluwer mobile networks and applications (MONET), vol 11, no 3, June 2006, pp 327–339Google Scholar
  20. 20.
    Kalman RE (1960) A new approach to linear filtering and prediction problems. Trans ASME J Basic Eng 82(Series D):35–45CrossRefGoogle Scholar
  21. 21.
    Kathiravelu T, Ranasinghe N, Pears A (2010) A robust proactive routing protocol for intermittently connected opportunistic networks. In: Proceedings of seventh IEEE international conference on wireless and optical communications networks (WOCN 2010), Colombo, Sri Lanka, 6–8 Sept 2010, pp 1–6Google Scholar
  22. 22.
    Keranen A (2008) Opportunistic network environment simulator. Special assignment report, Helsinki University of Technology, Department of Communications and Networking, May 2008Google Scholar
  23. 23.
    LeBrun J, Chuah C-N, Ghosal D, Zhang M (2005) Knowledge based opportunistic forwarding in vehicular wireless ad hoc networks. In: Proceedings of 61st IEEE vehicular technology conference (VTC 2005-Spring), 30 May–1 June 2005, vol 4, pp 2289–2293Google Scholar
  24. 24.
    Leguay J, Friedman T, Conan V (2006) Evaluating mobility pattern space routing for DTNs. In: Proceedings of 25th IEEE international conference on computer communications (INFOCOM 2006), Barcelona, Spain, 23–29 April 2006, pp 1–10Google Scholar
  25. 25.
    Lilien L, Kamal ZH, Bhuse V, Gupta A (2006) Opportunistic networks: the concept and research challenges in privacy and security. In: Proceedings of NSF international workshop on research challenges in security and privacy for mobile and wireless networks (WSPWN 2006), Miami, March 2006, pp 134–147Google Scholar
  26. 26.
    Lin C-S, Chang W-S, Chen L-J, Chou C-F (2008) Performance study of routing schemes in delay tolerant networks. In: Proceedings of the 22nd international conference on advanced information networking and applications—Workshops (AINAW ’08), Washington, DC, USA 25–28 March 2008, pp 1702–1707Google Scholar
  27. 27.
    Lindgren A, Doria A, Schelen O (2003) Probabilistic routing in intermittently connected networks. ACM SIGMOBILE Mobile Comput Commun Rev 7(3):19–20CrossRefGoogle Scholar
  28. 28.
    Liu Y, Niu J, Ma J (2009) Content encounter probability based message forwarding in opportunistic networks. In: Proceedings of Ist IEEE international conference on information science and engineering (ICISE ’09), Nanjing, 26–28 Dec 2009, pp 2589–2594Google Scholar
  29. 29.
    Makhlouta J, Harkous H, Hutayt F, Artail H (2011) Adaptive fuzzy spray and wait: efficient routing for opportunistic networks. In: Proceedings of IEEE international conference on selected topics in mobile and wireless networking( iCOST), Shanghai, China, 10–12 Oct 2011, pp 64–69Google Scholar
  30. 30.
    Merugu S, Ammar M, Zegura E (2004) Routing in space and time in networks with predictable mobility. Technical report GIT-CC 04–7, Georgia Institute of Technology, 2004Google Scholar
  31. 31.
    Musolesi M, Hailes S, Mascolo C (2004) An ad hoc mobility model founded on social network theory. In: Proceedings of 7 th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems (MSWiM ’04), Venice, Italy, 4–6 Oct 2004, pp 20–24Google Scholar
  32. 32.
    Musolesi M, Hailes S, Mascolo C (2005) Adaptive routing for intermittently connected mobile Ad Hoc network. In: Proceedings of sixth IEEE international symposium on world of wireless mobile and multimedia network (WOWMOM ’05), Taormina-Giardini Naxos, Italy, 13–16 June 2005, pp 183–189Google Scholar
  33. 33.
    OMNeT++, Downloaded from http://www.omnetpp.org/
  34. 34.
    Pelusi L, Passarella A, Conti M (2006) Opportunistic networking: data forwarding in disconnected mobile ad hoc networks. IEEE Commun Mag 44(11):134–141CrossRefGoogle Scholar
  35. 35.
    Pelusi L, Passarella A, Conti M (2007) Encoding for efficient data distribution in multi-hop Ad hoc networks. In: Boukerche A (ed) Handbook of wireless Ad hoc and sensor networks. Wiley, New YorkGoogle Scholar
  36. 36.
    Perkins CE, Bhagwat P (1994) Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers. In: Proceedings of the ACM conference on communications architecture, protocols and applications (SIGCOMM ‘94), London, England UK, 31 Aug–02 Sept 1994, pp 234–244Google Scholar
  37. 37.
    Perkins CE, Royer EM (1999) Ad hoc on-demand distance vector routing. In: Proceedings of the 2nd IEEE workshop on mobile computing systems and applications, New Orleans, LA, Feb 1999, pp 90–100Google Scholar
  38. 38.
    Scott J, Gass R, Crowcroft J, Hui P, Diot C, Chaintreau A (2009) CRAWDAD data set cambridge/haggle (v. 2006–09-15), Downloaded from http://crawdad.cs.dartmouth.edu/cambridge/haggle, May 2009
  39. 39.
    Small T, Haas ZJ (2003) The shared wireless infostation model—a new Ad Hoc networking paradigm (or where there is a whale, there is a way). In: Proceedings of 4th ACM international symposium on mobile Ad Hoc networking and computing (MobiHoc 2003), Annapolis, MD, USA, 1–3 June 2003, pp 233–244Google Scholar
  40. 40.
    Spyropoulos T, Psounis K, Raghavendra CS (2004) Single-copy routing in intermittently connected mobile networks. In: Proceedings of first annual IEEE communications society conference on sensor and Ad Hoc communications and networks (SECON 2004), Santa Clara, CA, USA, 4–7 Oct 2004, pp 235–244Google Scholar
  41. 41.
    Spyropoulos T, Psounis K, Raghavendra CS (2005) Spray and wait: An efficient routing scheme for intermittently connected mobile networks. In: Proceedings of ACM SIGCOMM workshop on delay-tolerant networking (WDTN ’05), Philadelphia, PA, USA 22–26 Aug 2005, pp 252–259Google Scholar
  42. 42.
    Spyropoulos T, Psounis K, Raghavendra CS (2007) Spray and focus: efficient mobility-assisted routing for heterogeneous and correlated mobility. In: Proceedings of the fifth IEEE international conference on pervasive computing and communications workshops (PerComW ’07), White Plains, NY, 19–23 March 2007, pp 79–85Google Scholar
  43. 43.
    The CMU Monarch Project‘s wireless and mobility extensions to ns-2. http://www.monarch.cs.rice.edu/cmu-ns.html
  44. 44.
    The Network Simulator (NS-2). www.isi.edu/nsnam/ns/
  45. 45.
    Vahdat A, Becker D (2000) Epidemic routing for partially connected ad hoc networks. Technical report CS-2000-06, Department of Computer Science, Duke University, Durham, NC, 2000Google Scholar
  46. 46.
    Widmer J, Le Boudec J-Y (2005) Network coding for efficient communication in extreme networks. In: Proceedings of ACM SIGCOMM workshop on delay-tolerant networking, Philadelphia, PA, 22–26 Aug 2005, pp 284–291Google Scholar
  47. 47.
    Woungang I, Denko MK (2011) Credit-based cooperation enforcement schemes tailored to opportunistic networks, Chap. 3. In: Denko M (ed) Mobile opportunistic networks: architectures, protocols and applications, Auerbach Publications/Taylor & Francis Group, Boca Raton/Florida. ISBN: 978-142-008-812-0, ISBN 10: 142-008-812-2, p 292Google Scholar
  48. 48.
    Yang J, Chen Y, Ammar M, Lee C (2005) Ferry replacement protocols in sparse MANET message ferrying systems. In: Proceedings of IEEE wireless communications and networking conference, New Orleans, USA 13–17 March 2005, pp 2038–2044Google Scholar
  49. 49.
    Zhang Z (2006) Routing in intermittently connected mobile Ad Hoc networks and delay tolerant networks: overview and challenges. IEEE Commun Surv Tutor 8(1):24–37CrossRefGoogle Scholar
  50. 50.
    Zhao W, Ammar M, Zegura E (2004) A message ferrying approach for data delivery in sparse mobile Ad Hoc networks. In: Proceedings of 5th ACM international symposium mobile Ad Hoc networking and computing 2004 (MobiHoc ‘04), ACM Press, Tokyo, Japan, 24–26 May 2004, pp 187–198Google Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  • Sanjay Kumar Dhurandher
    • 1
  • Deepak Kumar Sharma
    • 2
  • Isaac Woungang
    • 3
  • Shruti Bhati
    • 1
  1. 1.CAITFS, Division of Information Technology, Netaji Subhas Institute of TechnologyUniversity of DelhiNew DelhiIndia
  2. 2.Division of Computer Engineering, Netaji Subhas Institute of TechnologyUniversity of DelhiNew DelhiIndia
  3. 3.Department of Computer ScienceRyerson UniversityTorontoCanada

Personalised recommendations