Comparative study of routing protocols for opportunistic networks

Opportunistic networks or 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 proper network infrastructure. In OppNets there is no end-to-end connection between the source node and the destination node. OppNets grow from a single node (seed) to become large networks by inviting new nodes (helpers) to join the network. Due to these characteristics, OppNets are subject to real routing challenges. In this paper, we have presented an overview of the main available three families of OppNet routing protocols. Further, we have evaluated one protocol from each family (Epidemic, Direct Delivery and PRoPHET) in terms of complexity and scalability. Simulation results show that for small and medium complexity, the three protocols perform better than large complexity. As for scalability, simulation results show that Epidemic and PRoPHET perform better than Direct Delivery in terms of delivery rates and delays, but at a very high cost while Direct Delivery achieved lower delivery rates with a low cost.

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

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

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

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

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

[6]  David Tse,et al.  Mobility increases the capacity of ad-hoc wireless networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

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

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

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

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

[11]  Silvia Giordano,et al.  Routing in Opportunistic Networks , 2009, Int. J. Ambient Comput. Intell..

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

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

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

[15]  Robin Kravets,et al.  Encounter-Based Routing in DTNs , 2009, INFOCOM.

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

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

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

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

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

[21]  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).

[22]  Rabin K. Patra,et al.  Routing in a delay tolerant network , 2004, SIGCOMM '04.

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

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

[25]  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..

[26]  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.

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

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

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

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

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

[32]  Anders Lindgren,et al.  Probabilistic Routing in Intermittently Connected Networks , 2004, SAPIR.