Abstract
We consider the problem of appropriate clusterhead selection in wireless ad-hoc networks where it is necessary to provide robustness in the face of topological changes caused by node motion, node failure and node insertion or removal. The main contribution of our work is a new strategy for clustering a wireless AD HOC network and improvements in WCA and other similar algorithms. We first derived some analytical models and thereafter some clustering schemes. Our contribution also extends previous works in providing some properties and analyses of Quality of Clustering (QoC) in AD HOC. We showed that our algorithm outperforms the Weighted Clustering Algorithm (WCA) in terms of cluster formation and stability. One of the main ideas of our approach is to prioritize favourable nodes in clusterhead election and re-election processes. We strived to provide a trade-off between the uniformity of the load handled by the clusterheads and the connectivity of the network.