Cluster-based routing protocols through optimal cluster head selection for mobile ad hoc network

4Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Mobile ad hoc networks (MANETs) operate without fixed infrastructure, with mobile nodes acting as both hosts and routers. These networks face challenges due to node mobility and limited resources, causing frequent changes in topology and instability. Clustering is essential to manage this issue. Significant research has been devoted to optimal clustering algorithms to improve cluster-based routing protocols (CBRP), such as the weighted clustering algorithm (WCA), optimal stable clustering algorithm (OSCA), lowest ID (LID) clustering algorithm, and highest connectivity clustering (HCC) algorithm. However, these protocols suffer from high re-clustering frequency and do not adequately account for energy efficiency, leading to network instability and reduced longevity. This work aims to improve the CBRP to create a more stable and long-lasting network. During cluster head (CH) selection, nodes with high residual energy or degree centrality are chosen as CH and backup cluster head (BCH). This approach eliminates the need for re-clustering, as the BCH can seamlessly replace a failing CH, ensuring continuous cluster maintenance. The proposed modified cluster-based routing protocol (MCBRP) evaluated network simulator 2 (ns2) demonstrates that MCBRP is more energy-efficient, selecting optimal CH and balancing the load to enhance network stability and longevity.

Cite

CITATION STYLE

APA

Melkamu, Y. A., Purushothaman, R., Sujatha, M., Napa, K. K., Mekonen, M. Z., Assegie, T. A., & Salau, A. O. (2025). Cluster-based routing protocols through optimal cluster head selection for mobile ad hoc network. Bulletin of Electrical Engineering and Informatics, 14(1), 733–741. https://doi.org/10.11591/eei.v14i1.8863

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free