Graph-based optimal routing in clustered WSNs Online publication date: Tue, 31-Aug-2021
by Layla Aziz; Said Raghay; Hanane Aznaoui
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 37, No. 4, 2021
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.
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 Ad Hoc and Ubiquitous Computing (IJAHUC):
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