A novel clustering strategy for efficient routing in adhoc networks
G. Chopra, Sumit Kumar Srivastava, Abhay Karandikar · 2005
Routing in wireless mobile ad hoc networks should be time efficient and resource saving. One approach to reduce traffic during the routing process is to divide the network into clusters. Until now, there have been several approaches to cluster-based routing. We propose a voting based clustering strategy to form a network with spatial and temporal stability. The selection of cluster head and cluster size is done in a very efficient manner. We present algorithms for creation of clusters and their maintenance in the presence of various network events. Our strategy outperforms existing and conventional clustering approaches in terms of number of hops required, at a little overhead cost during topology updates. The strategy performs very well when the density of nodes is high.