A Distributed Approach of WCA in Ad-Hoc Network

In this paper, we proposed a distributed approach of weighted clustering algorithms (WCA) which can be useful in enhancing the performance of clustering algorithms in mobile ad-hoc networks. In this distributed WCA, every node in the network collects the information of the nodes which are in its four hops range, computes a local clusterhead set using a GA approach, then the node which wins the most other node´s support will be selected as the cluster head. After these, nodes nearby and the cluster head makes up a cluster. Simulation results show that the performance of distribute WCA is equivalent to the centralized WCA, but it is more adaptive to mobile ad-hoc networks