Routing Protocols in Opportunistic Networks – A Survey

ABSTRACT Opportunistic networks (OppNets) refer to a number of wireless nodes opportunistically communicating with each other in a form of “Store–Carry–Forward”. This occurs when they come into contact with each other without a proper network infrastructure. OppNets are designed to operate in an environment characterized by high delay, high error rate, intermittent connectivity, and non-availability of end-to-end route between the source and destination. OppNets use wireless technologies, such as IEEE 802.11, WiMAX, Bluetooth, and other short-range radio communication, and grow from a single node (seed) to become large networks by inviting new nodes (helpers) to join the network. Nodes have the ability to store and carry data and also forward it to other nodes in order to achieve different tasks. In OppNets, there is no end-to-end connection between the source and the destination nodes. Further, due to their inherent features, OppNets suffer from frequent partitions and long delays, while also being subject to serious security challenges. This survey includes an overview of the available OppNets routing protocols, their classification, and an evaluation of six routing protocols (Epidemic routing, PRoPHET, MaxProp, Spray and Wait, Direct Delivery, and First Contact) in terms of complexity/robustness and scalability. Detailed simulation results show that as the load on the network increases, the performance of protocols decrease in terms of delivery delay and network overhead. As for scalability, simulation results show that Epidemic routing and PRoPHET achieved high delivery rates, but with a very high network overhead. MaxProp and Spray and Wait achieved lower delivery rates, but with a low network overhead. First Contact and Direct Delivery achieved low delivery rates with high delivery delays. Results vary depending on the buffer size, contact times, and speed. The results indicate that trams have the capacity to carry and exchange information faster, and improve connectivity in OppNets.

[1]  T. Spyropoulos,et al.  Multiple-copy Routing in Intermittently Connected Mobile Networks , 2004 .

[2]  Ling-Jyh Chen,et al.  A hybrid routing approach for opportunistic networks , 2006, CHANTS '06.

[3]  Norman M. Sadeh,et al.  Predict and spread: An efficient routing algorithm for opportunistic networking , 2011, 2011 IEEE Wireless Communications and Networking Conference.

[4]  Michael J. Demmer,et al.  DTLSR: delay tolerant routing for developing regions , 2007, NSDR '07.

[5]  Siva Ganesh.E.  Designing a Human Mobility Model BasedRouting Protocol for Delay Tolerant Network(DTN) , 2013 .

[6]  Robin Kravets,et al.  Encounter: based routing in DTNs , 2009, MOCO.

[7]  Amarsinh Vidhate,et al.  Routing in Delay Tolerant Network , 2016 .

[8]  Jörg Ott,et al.  The ONE simulator for DTN protocol evaluation , 2009, SimuTools.

[9]  Shivakant Mishra,et al.  CenWits: a sensor-based loosely coupled search and rescue system using witnesses , 2005, SenSys '05.

[10]  Daniel F. Macedo,et al.  Resource Location for Opportunistic Networks , 2012, 2012 5th International Conference on New Technologies, Mobility and Security (NTMS).

[11]  David Tse,et al.  Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.

[12]  Per Øyvind Eid Fjuk.  Underwater Radio Communication , 2013 .

[13]  Vijay Erramilli,et al.  Forwarding in opportunistic networks with resource constraints , 2008, CHANTS '08.

[14]  Jingfeng Xue,et al.  Advanced PROPHET Routing in Delay Tolerant Network , 2009, 2009 International Conference on Communication Software and Networks.

[15]  Xiaoxiong Zhong,et al.  A Novel Routing Scheme for Resource-Constraint Opportunistic Networks: A Cooperative Multiplayer Bargaining Game Approach , 2016, IEEE Transactions on Vehicular Technology.

[16]  Pan Hui,et al.  Pocket Switched Networks: Real-world mobility and its consequences for opportunistic forwarding , 2005 .

[17]  Isaac Woungang,et al.  HBPR: History Based Prediction for Routing in Infrastructure-less Opportunistic Networks , 2013, 2013 IEEE 27th International Conference on Advanced Information Networking and Applications (AINA).

[18]  Xiangchuan Chen,et al.  Enabling Disconnected Transitive Communication in Mobile Ad Hoc Networks , 2001 .

[19]  Cauligi S. Raghavendra,et al.  Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility , 2007, Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07).

[20]  Mads Haahr,et al.  Social network analysis for routing in disconnected delay-tolerant MANETs , 2007, MobiHoc '07.

[21]  Jörg Ott,et al.  Time scales and delay-tolerant routing protocols , 2008, CHANTS '08.

[22]  Simin Nadjm-Tehrani,et al.  Opportunistic DTN routing with window-aware adaptive replication , 2008, AINTEC '08.

[23]  Di Yuan,et al.  Probabilistic Routing in Opportunistic Ad Hoc Networks , 2012 .

[24]  Vijay Erramilli,et al.  Delegation forwarding , 2008, MobiHoc '08.

[25]  Boleslaw K. Szymanski,et al.  Cost Efficient Erasure Coding Based Routing in Delay Tolerant Networks , 2010, 2010 IEEE International Conference on Communications.

[26]  Zygmunt J. Haas,et al.  Resource and performance tradeoffs in delay-tolerant wireless networks , 2005, WDTN '05.

[27]  Martin Vetterli,et al.  Locating nodes with EASE: last encounter routing in ad hoc networks through mobility diffusion , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[28]  Pan Hui,et al.  BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks , 2008, IEEE Transactions on Mobile Computing.

[29]  Anders Lindgren,et al.  Probabilistic routing in intermittently connected networks , 2003, MOCO.

[30]  Hongyi Wu,et al.  Replication-based efficient data delivery scheme (red) for delay/fault-tolerant mobile sensor network (DFT-MSN) , 2006, Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06).

[31]  Bala Krishna Maddali,et al.  Agent-based multicast opportunistic routing protocol for wireless networks , 2013, HP-MOSys '13.

[32]  Brian Gallagher,et al.  MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[33]  Cecilia Mascolo,et al.  CAR: Context-Aware Adaptive Routing for Delay-Tolerant Mobile Networks , 2009, IEEE Transactions on Mobile Computing.

[34]  Jörg Ott,et al.  The ONE simulator for DTN protocol evaluation , 2009, SIMUTools 2009.

[35]  Guohong Cao,et al.  Cooperative Caching for Efficient Data Access in Disruption Tolerant Networks , 2014, IEEE Transactions on Mobile Computing.

[36]  M. Gerla,et al.  Network coding vs. erasure coding: Reliable multicast in ad hoc networks , 2008, MILCOM 2008 - 2008 IEEE Military Communications Conference.

[37]  B Poonguzharselvi.  Data Forwarding in Opportunistic Network Using Mobile Traces , 2012 .

[38]  Zhili Sun,et al.  Routing in Delay/Disruption Tolerant Networks: A Taxonomy, Survey and Challenges , 2013, IEEE Communications Surveys & Tutorials.

[39]  Jörg Ott,et al.  Working day movement model , 2008, MobilityModels '08.

[40]  Thrasyvoulos Spyropoulos,et al.  An optimal joint scheduling and drop policy for Delay Tolerant Networks , 2008, 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks.

[41]  Yong Wang,et al.  Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet , 2002, ASPLOS X.

[42]  Cauligi S. Raghavendra,et al.  Single-copy routing in intermittently connected mobile networks , 2004, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[43]  Marco Conti,et al.  HiBOp: a History Based Routing Protocol for Opportunistic Networks , 2007, 2007 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks.

[44]  Zygmunt J. Haas,et al.  The shared wireless infostation model: a new ad hoc networking paradigm (or where there is a whale, there is a way) , 2003, MobiHoc '03.

[45]  Soontae Kim,et al.  Enhanced buffer management policy that utilises message properties for delay-tolerant networks , 2011, IET Commun..

[46]  Christophe Diot,et al.  Are you moved by your social network application? , 2008, WOSN '08.

[47]  Yunfeng Lin,et al.  Performance modeling of network coding in epidemic routing , 2007, MobiOpp '07.

[48]  Silvia Giordano,et al.  Context information prediction for social-based routing in opportunistic networks , 2012, Ad Hoc Networks.

[49]  Margaret Martonosi,et al.  Erasure-coding based routing for opportunistic networks , 2005, WDTN '05.

[50]  Mostafa H. Ammar,et al.  PeopleRank: Social Opportunistic Forwarding , 2010, 2010 Proceedings IEEE INFOCOM.

[51]  Arun Venkataramani,et al.  DTN routing as a resource allocation problem , 2007, SIGCOMM '07.

[52]  J. Ott,et al.  Increasing Reality for DTN Protocol Simulations , 2007 .

[53]  Jie Wu,et al.  Scalable Routing in Cyclic Mobile Networks , 2009, IEEE Transactions on Parallel and Distributed Systems.

[54]  Vinton G. Cerf,et al.  Delay-Tolerant Networking Architecture , 2007, RFC.

[55]  Richard E. Hansen,et al.  Prioritized epidemic routing for opportunistic networks , 2007, MobiOpp '07.

[56]  K. Psounis,et al.  Efficient Routing in Intermittently Connected Mobile Networks: The Single-Copy Case , 2008, IEEE/ACM Transactions on Networking.

[57]  Md. Humayun Kabir,et al.  TTL based routing in opportunistic networks , 2011, J. Netw. Comput. Appl..

[58]  Christophe Diot,et al.  Impact of Human Mobility on Opportunistic Forwarding Algorithms , 2007, IEEE Transactions on Mobile Computing.

[59]  D. Rus,et al.  An Underwater Sensor Network with Dual Communications, Sensing, and Mobility , 2007, OCEANS 2007 - Europe.

[60]  Robin Doss,et al.  Comparative study of routing protocols for opportunistic networks , 2013, 2013 Seventh International Conference on Sensing Technology (ICST).

[61]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 1999, Wirel. Networks.

[62]  T. Spyropoulos,et al.  Efficient Routing in Intermittently Connected Mobile Networks: The Multiple-Copy Case , 2008, IEEE/ACM Transactions on Networking.

[63]  Matthias Grossglauser,et al.  Age matters: efficient route discovery in mobile ad hoc networks using encounter ages , 2003, MobiHoc '03.

[64]  Jörg Widmer,et al.  Network coding for efficient communication in extreme networks , 2005, WDTN '05.

[65]  Amin Vahdat,et al.  Epidemic Routing for Partially-Connected Ad Hoc Networks , 2009 .