Cargando…
Lightweight and Efficient Dynamic Cluster Head Election Routing Protocol for Wireless Sensor Networks
Wireless Sensor Networks (WSNs) have gained great significance from researchers and industry due to their wide applications. Energy and resource conservation challenges are facing the WSNs. Nevertheless, clustering techniques offer many solutions to address the WSN issues, such as energy efficiency,...
Autores principales: | , , , , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8347344/ https://www.ncbi.nlm.nih.gov/pubmed/34372449 http://dx.doi.org/10.3390/s21155206 |
_version_ | 1783735066565804032 |
---|---|
author | Yagoub, Mudathir F. S. Khalifa, Othman O. Abdelmaboud, Abdelzahir Korotaev, Valery Kozlov, Sergei A. Rodrigues, Joel J. P. C. |
author_facet | Yagoub, Mudathir F. S. Khalifa, Othman O. Abdelmaboud, Abdelzahir Korotaev, Valery Kozlov, Sergei A. Rodrigues, Joel J. P. C. |
author_sort | Yagoub, Mudathir F. S. |
collection | PubMed |
description | Wireless Sensor Networks (WSNs) have gained great significance from researchers and industry due to their wide applications. Energy and resource conservation challenges are facing the WSNs. Nevertheless, clustering techniques offer many solutions to address the WSN issues, such as energy efficiency, service redundancy, routing delay, scalability, and making WSNs more efficient. Unfortunately, the WSNs are still immature, and suffering in several aspects. This paper aims to solve some of the downsides in existing routing protocols for WSNs; a Lightweight and Efficient Dynamic Cluster Head Election routing protocol (LEDCHE-WSN) is proposed. The proposed routing algorithm comprises two integrated methods, electing the optimum cluster head, and organizing the re-clustering process dynamically. Furthermore, the proposed protocol improves on others present in the literature by combining the random and periodic electing method in the same round, and the random method starts first at the beginning of each round/cycle. Moreover, both random and periodic electing methods are preceded by checking the remaining power to skip the dead nodes and continue in the same way periodically with the rest of the nodes in the round. Additionally, the proposed protocol is distinguished by deleting dead nodes from the network topology list during the re-clustering process to address the black holes and routing delay problems. Finally, the proposed algorithm’s mathematical modeling and analysis are introduced. The experimental results reveal the proposed protocol outperforms the LEACH protocol by approximately 32% and the FBCFP protocol by 8%, in terms of power consumption and network lifetime. In terms of Mean Package Delay, LEDCHE-WSN improves the LEACH protocol by 42% and the FBCFP protocol by 15%, and regarding Loss Ratio, it improves the LEACH protocol by approximately 46% and FBCFP protocol by 25%. |
format | Online Article Text |
id | pubmed-8347344 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2021 |
publisher | MDPI |
record_format | MEDLINE/PubMed |
spelling | pubmed-83473442021-08-08 Lightweight and Efficient Dynamic Cluster Head Election Routing Protocol for Wireless Sensor Networks Yagoub, Mudathir F. S. Khalifa, Othman O. Abdelmaboud, Abdelzahir Korotaev, Valery Kozlov, Sergei A. Rodrigues, Joel J. P. C. Sensors (Basel) Article Wireless Sensor Networks (WSNs) have gained great significance from researchers and industry due to their wide applications. Energy and resource conservation challenges are facing the WSNs. Nevertheless, clustering techniques offer many solutions to address the WSN issues, such as energy efficiency, service redundancy, routing delay, scalability, and making WSNs more efficient. Unfortunately, the WSNs are still immature, and suffering in several aspects. This paper aims to solve some of the downsides in existing routing protocols for WSNs; a Lightweight and Efficient Dynamic Cluster Head Election routing protocol (LEDCHE-WSN) is proposed. The proposed routing algorithm comprises two integrated methods, electing the optimum cluster head, and organizing the re-clustering process dynamically. Furthermore, the proposed protocol improves on others present in the literature by combining the random and periodic electing method in the same round, and the random method starts first at the beginning of each round/cycle. Moreover, both random and periodic electing methods are preceded by checking the remaining power to skip the dead nodes and continue in the same way periodically with the rest of the nodes in the round. Additionally, the proposed protocol is distinguished by deleting dead nodes from the network topology list during the re-clustering process to address the black holes and routing delay problems. Finally, the proposed algorithm’s mathematical modeling and analysis are introduced. The experimental results reveal the proposed protocol outperforms the LEACH protocol by approximately 32% and the FBCFP protocol by 8%, in terms of power consumption and network lifetime. In terms of Mean Package Delay, LEDCHE-WSN improves the LEACH protocol by 42% and the FBCFP protocol by 15%, and regarding Loss Ratio, it improves the LEACH protocol by approximately 46% and FBCFP protocol by 25%. MDPI 2021-07-31 /pmc/articles/PMC8347344/ /pubmed/34372449 http://dx.doi.org/10.3390/s21155206 Text en © 2021 by the authors. https://creativecommons.org/licenses/by/4.0/Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). |
spellingShingle | Article Yagoub, Mudathir F. S. Khalifa, Othman O. Abdelmaboud, Abdelzahir Korotaev, Valery Kozlov, Sergei A. Rodrigues, Joel J. P. C. Lightweight and Efficient Dynamic Cluster Head Election Routing Protocol for Wireless Sensor Networks |
title | Lightweight and Efficient Dynamic Cluster Head Election Routing Protocol for Wireless Sensor Networks |
title_full | Lightweight and Efficient Dynamic Cluster Head Election Routing Protocol for Wireless Sensor Networks |
title_fullStr | Lightweight and Efficient Dynamic Cluster Head Election Routing Protocol for Wireless Sensor Networks |
title_full_unstemmed | Lightweight and Efficient Dynamic Cluster Head Election Routing Protocol for Wireless Sensor Networks |
title_short | Lightweight and Efficient Dynamic Cluster Head Election Routing Protocol for Wireless Sensor Networks |
title_sort | lightweight and efficient dynamic cluster head election routing protocol for wireless sensor networks |
topic | Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8347344/ https://www.ncbi.nlm.nih.gov/pubmed/34372449 http://dx.doi.org/10.3390/s21155206 |
work_keys_str_mv | AT yagoubmudathirfs lightweightandefficientdynamicclusterheadelectionroutingprotocolforwirelesssensornetworks AT khalifaothmano lightweightandefficientdynamicclusterheadelectionroutingprotocolforwirelesssensornetworks AT abdelmaboudabdelzahir lightweightandefficientdynamicclusterheadelectionroutingprotocolforwirelesssensornetworks AT korotaevvalery lightweightandefficientdynamicclusterheadelectionroutingprotocolforwirelesssensornetworks AT kozlovsergeia lightweightandefficientdynamicclusterheadelectionroutingprotocolforwirelesssensornetworks AT rodriguesjoeljpc lightweightandefficientdynamicclusterheadelectionroutingprotocolforwirelesssensornetworks |