Establishing Reliability for Efficient Routing in Opportunistic Networks

Opportunistic network (Oppnet) is a class of networks where connections between the nodes are not permanent. The nodes are continuously moving and some nodes even switch off their batteries to conserve energy. Reliable delivery of messages in Opportunistic network is one major inherent issue. It is unreliable in the sense that once the source node has forwarded its message, then it will never get to know about its status in the network like whether the message has got discarded at an intermediate node or at the destination node (due to buffer overflow) or the successful delivery of the message has taken place. This work tries to make Oppnet as much reliable as possible. It proposes a reliability protocol named as Reliability in Oppnet (RIO). RIO improves the routing in Oppnet and works in parallel with the existing routing protocols. It makes the source node aware about the status of message so that if an error occurs then the source node can take suitable action to resend the message. It considers the redirection error, buffer overflow error, Time Limit Exceeded (TLE), parameter problem and destination unreachable errors that may occur inside the network. RIO has been tested using ONE simulator and implemented with Spray and Wait routing protocol. Results show that the RIO with Spray and Wait protocol outperforms normal Spray and Wait protocol in terms of average message delivery probability.

[1]  Mohammad S. Obaidat,et al.  Integration of Fixed and Mobile Infrastructure for Message Passing in Opportunistic Networks , 2015, J. Networks.

[2]  Deepika Kukreja,et al.  Power aware malicious nodes detection for securing MANETs against packet forwarding misbehavior attack , 2018, J. Ambient Intell. Humaniz. Comput..

[3]  Deepak Kumar Sharma,et al.  kROp: k-Means clustering based routing protocol for opportunistic networks , 2019, J. Ambient Intell. Humaniz. Comput..

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

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

[6]  Ari Keränen.  Opportunistic Network Environment simulator , 2008 .

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

[8]  Isaac Woungang,et al.  GD-CAR: A Genetic Algorithm Based Dynamic Context Aware Routing Protocol for Opportunistic Networks , 2017, NBiS.

[9]  Isaac Woungang,et al.  Performance evaluation of various routing protocols in Opportunistic Networks , 2011, 2011 IEEE GLOBECOM Workshops (GC Wkshps).

[10]  Deepika Kukreja,et al.  Enhancing the Security of Dynamic Source Routing Protocol Using Energy Aware and Distributed Trust Mechanism in MANETs , 2014, ISI.

[11]  Deepak Kumar Sharma,et al.  A fuzzy logic and game theory based adaptive approach for securing opportunistic networks against black hole attacks , 2018, Int. J. Commun. Syst..

[12]  Manpreet Kaur,et al.  Poisson's probability‐based Q‐Routing techniques for message forwarding in opportunistic networks , 2018, Int. J. Commun. Syst..

[13]  Isaac Woungang,et al.  History-Based Secure Routing Protocol to Detect Blackhole and Greyhole Attacks in Opportunistic Networks , 2017 .

[14]  Deepak Kumar Sharma,et al.  SEIR: A Stackelberg game based approach for energy-aware and incentivized routing in selfish Opportunistic Networks , 2017, 2017 51st Annual Conference on Information Sciences and Systems (CISS).

[15]  W. Marsden.  I and J , 2012 .

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

[17]  Anil Kumar,et al.  Cloud computing based routing protocol for infrastructure-based opportunistic networks , 2016, 2016 1st India International Conference on Information Processing (IICIP).

[18]  Deepika Kukreja,et al.  Power Aware and Secure Dynamic Source Routing Protocol in Mobile Ad Hoc Networks , 2014, SSCC.

[19]  Kevin R. Fall,et al.  A delay-tolerant network architecture for challenged internets , 2003, SIGCOMM '03.

[20]  Isaac Woungang,et al.  GAER: genetic algorithm-based energy-efficient routing protocol for infrastructure-less opportunistic networks , 2014, The Journal of Supercomputing.

[21]  D.J. Goodman,et al.  INFOSTATIONS: a new system model for data and messaging services , 1997, 1997 IEEE 47th Vehicular Technology Conference. Technology in Motion.

[22]  Isaac Woungang,et al.  An energy‐efficient history‐based routing scheme for opportunistic networks , 2017, Int. J. Commun. Syst..

[23]  Ellen W. Zegura,et al.  A message ferrying approach for data delivery in sparse mobile ad hoc networks , 2004, MobiHoc '04.

[24]  Joel J. P. C. Rodrigues,et al.  A Machine Learning-Based Protocol for Efficient Routing in Opportunistic Networks , 2018, IEEE Systems Journal.

[25]  Isaac Woungang,et al.  EDR: An Encounter and Distance Based Routing Protocol for Opportunistic Networks , 2016, 2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA).

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

[27]  Cauligi S. Raghavendra,et al.  Spray and wait: an efficient routing scheme for intermittently connected mobile networks , 2005, WDTN '05.

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