A weight based double star embedded clustering of homogeneous mobile ad hoc networks using graph theory

Abstract

In this paper, we propose a new multi-parameter weight based double star embedded clustering algorithm for MANETs. 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 a node and the other nodes in the network, the maximum number of hops a node has to take in order to communicate with the other nodes. This paper deals with the description of the algorithm and an analysis of the algorithm in situations which lead to topology changes. © Springer-Verlag Berlin Heidelberg 2011.