Marking-based load balancing Weighted Clustering Framework for Mobile ADHOC Network

In a mobile ad-hoc network, it has been observed that the existing weighted clustering algorithm induces high computational overhead on the mobile nodes in the cluster-head election process and distributes the load among the cluster-heads unfairly. Also, the cluster maintenance cost is very high due to the expiration or movement of the cluster-head. The purpose of this work is to mitigate the weaknesses of the existing weight-based clustering algorithm. The proposed "Marking-based Load Balancing Weighted Clustering Framework for Mobile ADHOC Network (MLWCM)" marks the weak nodes before the beginning of the election process and spares them from massive weight calculation, thus saving the scarce resources of the network. The concept of inmate affiliation reduces the maintenance cost considerably. To ensure fair load distribution among the cluster-heads, a handling factor has been computed, which is the number of nodes that a cluster-head can handle based on its available battery power. Also, to minimize the maintenance cost, a new event called inmate affiliation has been introduced. The simulation outcome reveals that the proposed framework outperforms the existing weighted clustering algorithm. MLWCM produces healthier and more stable cluster-heads. The number of members is fairly assigned to cluster-heads. Inmate affiliation allows a displaced node to get attached to an available nearby cluster silently, without inducing clustering in the complete network, which results in lower maintenance costs. Obtained results: By the simulation, it has been revealed that the MLWCM yields healthy cluster-heads in terms of battery power at a low computational cost, hence prolonging the life of the network and enabling efficient routing in the mobile ad-hoc network. For the proposed framework, MLWCM, the average battery life of the cluster-head is 73.8%, whereas for the existing WCA, the average battery life is 41.8%; hence, MLWCM enhances the stability of the network.

Authors

Institutions

Publication Details

Journal
PLoS ONE
Published
2026-10-15
DOI
https://doi.org/10.1371/journal.pone.0360099
Primary Topic
Mobile Ad Hoc Networks
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Marking-based load balancing Weighted Clustering Framework for Mobile ADHOC Network

Ramesh Chandra Sahoo, Sameena Pathan, Prashant Dixit, Sonia Setia et al.
PLoS ONE
Mobile Ad Hoc Networks
article

Marking-based load balancing Weighted Clustering Framework for Mobile ADHOC Network

Ramesh Chandra Sahoo, Sameena Pathan, Prashant Dixit, Sonia Setia, Manish Sharma
article en

Abstract

In a mobile ad-hoc network, it has been observed that the existing weighted clustering algorithm induces high computational overhead on the mobile nodes in the cluster-head election process and distributes the load among the cluster-heads unfairly. Also, the cluster maintenance cost is very high due to the expiration or movement of the cluster-head. The purpose of this work is to mitigate the weaknesses of the existing weight-based clustering algorithm. The proposed "Marking-based Load Balancing Weighted Clustering Framework for Mobile ADHOC Network (MLWCM)" marks the weak nodes before the beginning of the election process and spares them from massive weight calculation, thus saving the scarce resources of the network. The concept of inmate affiliation reduces the maintenance cost considerably. To ensure fair load distribution among the cluster-heads, a handling factor has been computed, which is the number of nodes that a cluster-head can handle based on its available battery power. Also, to minimize the maintenance cost, a new event called inmate affiliation has been introduced. The simulation outcome reveals that the proposed framework outperforms the existing weighted clustering algorithm. MLWCM produces healthier and more stable cluster-heads. The number of members is fairly assigned to cluster-heads. Inmate affiliation allows a displaced node to get attached to an available nearby cluster silently, without inducing clustering in the complete network, which results in lower maintenance costs. Obtained results: By the simulation, it has been revealed that the MLWCM yields healthy cluster-heads in terms of battery power at a low computational cost, hence prolonging the life of the network and enabling efficient routing in the mobile ad-hoc network. For the proposed framework, MLWCM, the average battery life of the cluster-head is 73.8%, whereas for the existing WCA, the average battery life is 41.8%; hence, MLWCM enhances the stability of the network.

PLoS ONEVol. 21(10)
Galgotias University (IN), Manipal Academy of Higher Education (IN), Manav Rachna International Institute of Research and Studies (IN)
Industry, innovation and infrastructure
Openalex Percentile: Top 12%
Mobile Ad Hoc Networks
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.