Hierarchical search-based routing protocol for infrastructure-based opportunistic networks Online publication date: Mon, 22-Mar-2021
by Deepak Kumar Sharma; Sanjay Kumar Dhurandher; Shiv Kumar
International Journal of Innovative Computing and Applications (IJICA), Vol. 12, No. 2/3, 2021
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Innovative Computing and Applications (IJICA):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook