Marking-based load balancing Weighted Clustering Framework for Mobile ADHOC Network
4 affiliations
- 1School of Computer Science and Engineering, Galgotias University, Greater Noida, Uttar Pradesh, India
- 2Department of CSE, MRIIRS, Faridabad, India
- 3Department of Electrical, Electronics and Communication Engineering, Galgotias University, Greater Noida, Uttar Pradesh, India
- 4Manipal Institute of Technology, Manipal Academy of Higher Education, Manipal, Karnataka, India
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.
Related
- Weighted Spline-Expanded Networks with Distributional Balancing for Continuous Treatment Effects
- Multilayer-Dynamic Network Clustering with Application to World Trade Data
- Data Quality Audit and Bivariate Temperature-Humidity Analysis of a Long-Term LoRaWAN Network: Anomaly Detection, PCA, Clustering and Machine Learning
- An explainable machine learning framework for cross-dataset chronic kidney disease risk prediction using hybrid data balancing
- Deep Learning for Singular PDEs: A Weighted Neural Network Approach
BibTeX
@article{dixit2026markingbased,
title = {{Marking-based load balancing Weighted Clustering Framework for Mobile ADHOC Network}},
author = {Prashant Dixit and Sonia Setia and Ramesh Chandra Sahoo and Manish Sharma and Sameena Pathan},
journal = {PLOS One},
year = {2026},
month = oct,
doi = {10.1371/journal.pone.0360099},
url = {https://doi.org/10.1371/journal.pone.0360099},
note = {CC BY 4.0},
}
RIS
TY - JOUR
TI - Marking-based load balancing Weighted Clustering Framework for Mobile ADHOC Network
AU - Prashant Dixit
AU - Sonia Setia
AU - Ramesh Chandra Sahoo
AU - Manish Sharma
AU - Sameena Pathan
PY - 2026
DA - 2026/10/15
JO - PLOS One
DO - 10.1371/journal.pone.0360099
UR - https://doi.org/10.1371/journal.pone.0360099
AB - 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.
SN - 1932-6203
ER -