Title: Graph-based optimal routing in clustered WSNs

Authors: Layla Aziz; Said Raghay; Hanane Aznaoui

Addresses: Polydisciplinary Faculty of Sidi Bennour, Chouaib Doukkali University, El Jadida, Morocco ' Department of Computer Sciences, FSTG-Cadi Ayyad University, Morocco ' Department of Computer Sciences, FSTG-Cadi Ayyad University, Morocco

Abstract: Wireless sensor networks (WSNs) represent a huge number of tiny sensors that cooperate for easing wireless communication. They are widely used in various applications such as transportation, and patient monitoring. However, these applications still encounter difficulties because sensors are highly resource-constrained. Hence, optimising the whole network energy is a major goal of WSNs. In this paper, we aim to enhance the process of routing using an efficient graph theory model that optimises the routing cost. This work improved the inter-cluster communication by the use of a strong network classification. Moreover, it aims at routing data using an optimal routing path based on the graph theory model. To enhance the generated solution, our work consists of activating only nodes that detect enough strong signals. The graph-based solution is evaluated using the network density and the data size scenarios. The numerical experiments prove that our protocol significantly improved the network stability.

Keywords: clustering; shortest path; graph theory; routing cost.

DOI: 10.1504/IJAHUC.2021.117326

International Journal of Ad Hoc and Ubiquitous Computing, 2021 Vol.37 No.4, pp.207 - 217

Received: 14 Feb 2020
Accepted: 11 Mar 2021
Published online: 31 Aug 2021 *

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