A Multi-Hop Weighted Clustering of Homogenous MANETs Using Combined Closeness Index

TL;DR

This paper introduces a novel multi-hop weighted clustering algorithm for homogeneous MANETs that creates non-overlapping double star clusters with robust leader management based on a comprehensive node weight metric.

Contribution

It presents a new clustering method using a combined closeness index and graph parameters, enhancing cluster stability and communication efficiency in MANETs.

Findings

Effective cluster formation with non-overlapping double star structures

Improved leader node management and failure handling

Analysis of graph-theoretic properties of clusters

Abstract

In this paper, a new multi-hop weighted clustering procedure is proposed for homogeneous Mobile Ad hoc networks. The algorithm generates double star embedded non-overlapping cluster structures, where each cluster is managed by a leader node and a substitute for the leader node (in case of failure of leader node). The weight of a node is a linear combination of six different graph theoretic parameters which deal with the communication capability of a node both in terms of quality and quantity, the relative closeness relationship between network nodes and the maximum and average distance traversed by a node for effective communication. This paper deals with the design and analysis of the algorithm and some of the graph theoretic/structural properties of the clusters obtained are also discussed.