A NOVEL WEIGHT-BASED CLUSTERING ALGORITHM FOR MOBILE AD HOC NETWORK

In recent years, many studies have been conducted in Mobile Ad Hoc Networks field in order to make a virtual infrastructure consisting of nodes. The common goal of all was to select a node called clusterhead which guarantees relationships between nodes. In this paper, we have presented a new clustering algorithm in Mobile Ad Hoc Network based on nodes weight. For calculating node weight we present four new parameter, cluster density, consumed energy, stability and number of nodes moving towards a node. The goal of this algorithm is to decrease the number of cluster forming, maintain stable clustering structure and maximize lifespan of mobile nodes in the system. In simulation, the proposed algorithm has been compared with WCA, MOBIC and the Lowest ID algorithm. The results of simulation reveal that the proposed algorithm achieves the goals.