Weighted Clustering Algorithms in MANET: A Survey
Amit Kumar Gupta · 2015
A mobile adhoc network (MANET) is a collection of independent mobile nodes that communicate over relative bandwidth and power constrained wireless links. The network topology may transform quickly and randomly due to mobility of nodes. Also, in MANET the decentralized network leads to perform the routing functionalities by nodes themselves such as route discovery, topology discovery and delivering messages from source to destination. Clustering provides the finest answer for huge and dense mobile adhoc networks with high mobility. It also lifts the capacity of network and diminishes the routing overhead in order to bring more efficient and effective routing in MANET. There are two mechanisms in every clustering algorithm, (i) cluster formation and (ii) cluster maintenance. In cluster formation, cluster heads are selected among the nodes to form the hierarchical network. Selecting appropriate cluster head is one of the main research issues. In cluster maintenance, a unique mechanism is needed so that the cluster head can maintain the topological information of the cluster in spite of the cluster structure changes every time due to mobility of nodes. This paper mainly focuses on the weight based clustering approaches in MANET.