Supernode routing: a grid-based message passing scheme for sparse opportunistic networks

In opportunistic networks (Oppnets), messages are transferred from one node to another when the opportunity arrives and until then, these messages are stored in their buffers. Challenges in such scenarios can arise due to multiple reasons such as buffer space, energy limitations, density of nodes and sparse networks. This paper takes into consideration these factors and proposes a novel routing protocol. Supernode routing is proposed for networks in which nodes are organised in clusters, also known as cells, and takes advantage of this property to limit flooding. Special nodes called supernodes are utilised to transmit a message from one cell to another. Nodes within cells forward their messages to the optimal supernodes based on the direction of the destination cell. The messages are propagated by flooding in intermediate cells until the message is passed over to the next cell in the path using supernodes. When the message is transferred to another cell, it is dropped from all nodes in the current cell. In this manner, messages are streamlined to an expected path to an extent, based on the sender and receiver. This is in contrast to random paths of messages found in most other protocols. The proposed model has been simulated in spatially separated scenarios using ONE simulator. It has high delivery probabilities with drastically low overhead ratios in comparison to the other existing routing protocols.

[1]  Cecilia Mascolo,et al.  Adaptive routing for intermittently connected mobile ad hoc networks , 2005, Sixth IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks.

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

[3]  Xiaoming Wang,et al.  A social-aware probabilistic routing approach for mobile opportunistic social networks , 2017, Trans. Emerg. Telecommun. Technol..

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

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

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

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

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

[9]  Leonard Barolli,et al.  A multi-objectives based technique for optimized routing in opportunistic networks , 2018, J. Ambient Intell. Humaniz. Comput..

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

[11]  Cheng-Yen Lin,et al.  Geo-Routing with angle-based decision in delay-tolerant networks , 2017, 2017 10th International Conference on Ubi-media Computing and Workshops (Ubi-Media).

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

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

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

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

[16]  Mohammad S. Obaidat,et al.  Probability-based controlled flooding in opportunistic networks , 2015, 2015 12th International Joint Conference on e-Business and Telecommunications (ICETE).

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

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

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

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

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