Title: Hierarchical search-based routing protocol for infrastructure-based opportunistic networks

Authors: Deepak Kumar Sharma; Sanjay Kumar Dhurandher; Shiv Kumar

Addresses: Department of Information Technology, Netaji Subhas University of Technology, New Delhi, India; Formerly: NSIT, India ' Department of Information Technology, Netaji Subhas University of Technology, New Delhi, India; Formerly: NSIT, India ' Department of Information Technology, Netaji Subhas University of Technology, New Delhi, India; Formerly: NSIT, India

Abstract: Opportunistic networks (OppNets) consist of intermittently connected devices where there is no guarantee that a predefined path from source to destination for message transmission exists. In such a sparsely connected network where nodes relay messages in an opportunistic manner, designing a routing protocol is a challenging task. In this paper, a novel routing protocol for infrastructure-based OppNets called the hierarchical search-based routing protocol (HSBRP) has been proposed. This protocol combines the benefits of both fixed and mobile routing techniques, combating the disadvantages posed by each, to give better performance on a multitude of performance metrics like, no single point of failure, fault detection and communication capacity, etc. In the proposed protocol, nodes are arranged in a hierarchical fashion and interactions between different levels of nodes are only allowed through well-defined rules that boost message delivery probability and reduce the overhead of the network.

Keywords: incentive scheme; opportunistic networks; OppNets; selfish nodes; the opportunistic network environment; ONE; simulator; wireless charging.

DOI: 10.1504/IJICA.2021.10036518

International Journal of Innovative Computing and Applications, 2021 Vol.12 No.2/3, pp.134 - 145

Received: 30 Nov 2019
Accepted: 24 Feb 2020

Published online: 18 Mar 2021 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article