Hierarchical search-based routing protocol for infrastructure-based opportunistic networks. (18th March 2021)

• Record Type: Journal Article
• Authors: Sharma, Deepak Kumar; Dhurandher, Sanjay Kumar; Kumar, Shiv
• Is Part Of: International journal of innovative computing and applications. Volume 12:Number 2/3(2021)
• Page Start: 134
• Page End: 145
• Publication Date: 2021-03-18
• Subjects: incentive scheme -- opportunistic networks -- OppNets -- selfish nodes -- the opportunistic network environment -- ONE -- simulator -- wireless charging; Evolutionary computation -- Periodicals; Neural networks (Computer science) -- Periodicals; Genetic programming (Computer science) -- Periodicals; Biologically-inspired computing -- Periodicals; Swarm intelligence -- Periodicals; Quantum computers -- Periodicals; 006.3
• Languages: English
• ISSNs: 1751-648X

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.