An efficient clusterhead election algorithm based on maximum weight for MANET

In the last two decades, there is magnetism in the use of internet and Communication Technology in the field of Mobile Ad Hoc Network. It motivates the researchers to turn over in those areas. There were some algorithms proposed for electing the efficient Clusterheads. Clusterheads are having more responsibilities like to minimize the re-affiliation, topology changes, and the stability of the on demand networks. We proposed a new efficient clusterhead selection algorithm based on the maximum weight in which it takes consideration of five different weight parameters. In this paper we analyses the clusterhead changes, energy consumption, life time of the network and end to end delay of the nodes. The experimental result also shows that proposed algorithm is better than the existing Weighted Clustering Algorithms.