Clustering Algorithm for Mobile Ad-hoc Networks (MANETs): A Weight-Based Approach Using WCA

Mobile Ad-hoc Networks (MANETs) introduce distinct challenges owing to their inherent dynamically changing topology, absence of physically established infrastructure systems and limited resource networks.A common technique to build such hierarchy is in the form of clustering, which decreases routing overhead and increases scalability of these networks.This paper proposes a simulation based work on Weight-based Clustering Algorithm (WCA) for MANETs.All nodes in the network then compute composite weight using four parameters degree, distance between nodes, mobility and residual energy and the node with least weight is elected as Cluster Head (CH).The simulator, while capturing live metrics (CH ratio, cluster health, stability index, energy consumption), also visualizes intra-cluster and inter-cluster links in real time.Experimental results show that WCA provides stable formation of cluster with less routing overhead, and it is very appropriate for military communication, vehicular networks and rescue operations where infrastructure is not available.Selection of parameters encouraging its deployment for MANETs are also considered leading to the exhaustive selection of versatile capabilities