Routing Protocols in Infrastructure-Based Opportunistic Networks

  • Sanjay K. Dhurandher
  • Deepak Kumar Sharma
  • Isaac Woungang
  • Sahil Gupta
  • Sourabh Goyal


This chapter analyzes the infrastructure needed for communication in Opportunistic Networks (OppNets) and the routing protocols for message passing in order to optimize message delivery delays, energy consumption, buffer occupancy, bandwidth requirements, and throughput. Infrastructures used in OppNets can be classified as fixed infrastructure such as infostations which provide high bandwidth connectivity within a specified area and mobile infrastructures such as Message Ferry (MF) which provide a reliable source for communication and transmission of messages between the nodes. Message ferrying scheme proves to be good for sparse networks where network partition problem is very common like in wireless sensor networks (WSNs) due to limited energy and in Mobile Ad-Hoc Networks (MANETs) due to mobility and short radio communication range of nodes. Communication in MF scheme can be from node to ferry and ferry to node or even from ferry to ferry. Their main aim is to reduce delays in message delivery, proper management of message buffers, and optimization of energy consumption. Designing the route of a message ferry is a NP hard problem. In case of ferry failure, designing ferry replacement schemes is also an interesting issue to be explored.


Opportunistic networks Delay tolerant networks Infostation Message ferry Infrastructure-based protocols  Wireless sensor networks Network partition Shared wireless infostation model (SWIM) Mobile ubiquitous LAN extensions (MULEs). 


  1. 1.
    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
  2. 2.
    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
  3. 3.
    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, pp 90–100Google Scholar
  4. 4.
    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, 5–9 Dec 2011, pp 1067–1071Google Scholar
  5. 5.
    Huang C-M, Lan K-C, Tsai C-Z (2008) A survey of opportunistic networks. In: Proceedings of the 22nd international conference on advanced information networking and applications—workshops (AINAW 2008), Okinawa, Japan, 25–28 March 2008, pp 1672–1677Google Scholar
  6. 6.
    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
  7. 7.
    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
  8. 8.
    Jain S, Fall K, Patra R (2004) Routing in a delay tolerant network. In: Proceedings of ACM SIGCOMM 2004, 30 Aug–3 Sept 2004, pp 145–158Google Scholar
  9. 9.
    Pelusi L, Passarella A, Conti M (Nov 2006) Opportunistic networking: data forwarding in disconnected mobile ad hoc networks. IEEE Commun Mag 44(11):134–141CrossRefGoogle Scholar
  10. 10.
    Vahdat A, Becker D (2000) Epidemic routing for partially connected ad hoc networks, Technical report CS-2000-06. Duke University, Department of Computer Science, DurhamGoogle Scholar
  11. 11.
    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, 22–26 Aug 2005, pp 252–259Google Scholar
  12. 12.
    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, 19–23 March 2007, pp 79–85Google Scholar
  13. 13.
    Lindgren A, Doria A, Schelen O (July 2003) Probabilistic routing in intermittently connected networks. ACM SIGMOBILE Mob Comput Commun Rev 7(3):19–20CrossRefGoogle Scholar
  14. 14.
    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 (WoWMoM 2007), Espoo, Finland, 18–21 June 2007, pp 1–12Google Scholar
  15. 15.
    Goodman DJ, Borras J, Mandayam NB, Yates RD (1997) INFOSTATIONS: a new system model for data and messaging services. In: Proceedings of IEEE vehicular technology conference 1997( VTC97), vol 2, May 1997, pp 969–973Google Scholar
  16. 16.
    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 on mobile ad hoc networking and computing 2004 (MobiHoc’04), ACM Press, Tokyo, 24–26 May 2004, pp 187–198Google Scholar
  17. 17.
    Jain S, Shah RC, Bbrunette W, Borriello G, Roy S (June 2006) Exploiting mobility for energy efficient data collection in wireless sensor networks. ACM/Kluwer Mob Netw Appl (MONET) 11(3):327–339CrossRefGoogle Scholar
  18. 18.
    Cavalcanti D, Sadok D, Kelner J (2002) Mobile infostations: a paradigm for wireless data communications. In: Proceedings of IASTED international conference on wireless and optical communications (WOC 2002), 17–19 July 2002, pp 441–446Google Scholar
  19. 19.
    Small T, Haas ZJ (2003) The shared wireless infostation model—a new ad hoc nNetworking paradigm (or where there is a whale, there is a way). In: Proceedings of 4th ACM inernational symposium on mobile ad hoc networking and computing (MobiHoc 2003), Annapolis, MD, 1–3 June 2003, pp 233–244Google Scholar
  20. 20.
    Brauer F, Castillo-Ch’avez C (2001) Mathematical models in population biology and epidemiology. Springer, New York, ISBN 978-1-4419-3182-5Google Scholar
  21. 21.
    Mate BR, Gisiner R, Mobley J (1998) Local and migratory movements of Hawaiian humpback whales tracked by satellite telemetry. Can J Zool 76(5):863–868CrossRefGoogle Scholar
  22. 22.
    Krutzikowsky GK, Mate BR (2000) Dive and surfacing characteristics of bowhead whales (Balaena mysticetus) in the Beaufort and Chukchi seas. Can J Zool 78:1182–1198Google Scholar
  23. 23.
    Mate BR, Lagerquist BA, Calambokidis J (1999) The movements of North Pacific blue whales during the feeding season off Southern California and their southern fall migration. Mar Mammal Sci 15(4):1246–1257Google Scholar
  24. 24.
    Zhao W, Ammar M (2003) Message ferrying: proactive routing in highly-partitioned wireless ad hoc networks. In: Proceedings of the ninth IEEE workshop on future trends of distributed computing systems (FTDCS). San Juan, Puerto Rico, 28–30 May 2003, pp 308–314Google Scholar
  25. 25.
    Li Y, Weng B, Liu Q, Lijun Tang, Daneshmand M (2011) Multiple ferry routing for the opportunistic networks. In: Proceedings of IEEE Globecom 2011, Houston, Texas, 5–9 Dec 2011, pp 1–5Google Scholar
  26. 26.
    Wang T, Low CP (2010) Dynamic message ferry route (dMFR) for partitioned MANETs. In: Proceedings of international conference on communications and mobile computing, Shenzhen, 12–14 April 2010, pp 447–451Google Scholar
  27. 27.
    Zhu Y-H, Wu W-D, Leung VCM, Yang L-H (2008) Energy-efficient tree-based message ferrying routing schemes for wireless sensor networks. In: Proceedings of third international conference on communications and networking in China (ChinaCom), Hangzhou, 25–27 Aug 2008, pp 844–848Google Scholar
  28. 28.
    Raghunathan V, Schurgers C, Sung P (2002) Energy-aware wireless microsensor networks. IEEE Signal Process Mag 1(7):40–50CrossRefGoogle Scholar
  29. 29.
    Mansy A, Ammar M, Zegura E (2011) Deficit round-robin based message ferry routing. In: Proceedings of IEEE GLOBECOM workshop 2011, Houston, Texas, 5–9 Dec 2011, pp 1–5Google Scholar
  30. 30.
    Shreedhar M, Varghese G (1995) Efficient fair queueing using deficit round-robin. Proc SIGCOMM 25(4):231–242Google Scholar
  31. 31.
    Mansy A, Ammar M, Zegura E (2011) Deficit round-robin based message ferry routing. Georgia Tech, Atlanta, Technical report GT-CS-11-03Google Scholar
  32. 32.
    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, 13–17 March 2005, pp 2038–2044Google Scholar
  33. 33.
    Zhao W, Ammar M, Zegura E (2005) Controlling the mobility of multiple data transport ferries in a delay-tolerant network. In: Proceedings of the 24th annual joint conference of the IEEE computer and communications societies (INFOCOM05) 2005, Miami, vol 2, pp 1407–1418Google Scholar
  34. 34.
    Papadimitriou CH, Yannakakis M (1993) The traveling salesman problem with distances one and two. Math Oper Res 18(1):1–11MathSciNetCrossRefMATHGoogle Scholar
  35. 35.
    Ammar M, Chakrabarty D, Sarma AD, Kalyanasundaram S, Lipton RJ (2009) Algorithms for message ferrying on mobile ad hoc networks. In: Proceedings of the IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS09), IIT Kanpur, India, 15–17 Dec 2009, pp 13–24Google Scholar
  36. 36.
    Chan MY, Chin Francis Y L (1992) General schedulers for the pinwheel problem based on double-integer reduction. IEEE Trans Comput 41(6):755–768CrossRefGoogle Scholar
  37. 37.
    Chan MY, Chin FYL (1993) Schedulers for larger class of pinwheel instances. Algorithmica 9(5,):425–462MathSciNetCrossRefMATHGoogle Scholar
  38. 38.
    Fishburn PC, Lagarias JC (2002) Pinwheel scheduling: achievable ensities. Algorithmica 34(1):14–38Google Scholar
  39. 39.
    Holte R, Mok A, Rosier L, Tulchinsky I, Varvel D (1989) The pinwheel: a real-time scheduling problem. In: Proceedings of the 22nd Hawaii international conference of system sciences, Jan 1989, pp 693–702Google Scholar
  40. 40.
    Holte R, Rosier L, Tulchinsky I, Varvel D (1992) Pinwheel scheduling with two distinct numbers. Theor. Comput. Sci. 100(1):105–135 (Mathematical foundations of computer science 1989 (Porpolhk abka-Kozubnik 1989), Lecture notes in computer science, vol 379, 1989, pp 281–290)Google Scholar
  41. 41.
    Lin S-S, Lin K-J (1997) A pinwheel scheduler for three distinct numbers with a tight schedulability bound. Algorithmica 19(4):411–426MathSciNetCrossRefMATHGoogle Scholar
  42. 42.
    Wang T, Wang G (2010) TIBCRPH: traffic infrastructure based cluster routing protocol with handoff in VANET. In: Proceedings of 19th IEEE annual wireless and optical communications conference (WOCC), Shanghai, 14–15 May 2010, pp 1–5Google Scholar
  43. 43.
    Luo J, Xinxing G, Zhao T, Yan W (2010) A mobile infrastructure based VANET routing protocol in the Urban environment. In: Proceedings of IEEE international conference on communications and mobile computing (CMC 2010), Shenzhen, 12–14 April 2010, pp 432–437Google Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  • Sanjay K. Dhurandher
    • 1
  • Deepak Kumar Sharma
    • 2
  • Isaac Woungang
    • 3
  • Sahil Gupta
    • 2
  • Sourabh Goyal
    • 2
  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