Clustering Overhead and Convergence Time Analysis of the Mobilitybased MultiHop Clusterin.pdfVIP

Clustering Overhead and Convergence Time Analysis of the Mobility-based Multi-Hop Clustering Algorithm for Mobile Ad Hoc Networks Inn Inn ER2,1 Winston K.G. Seah1,2 {stuerii, winston}@i2r.a-star.edu.sg 1Institute for Infocomm Research 2Department of Computer Science Agency for Science Technology and Research School of Computing Singapore National University of Singapore Abstract changes [1]. There are some techniques suggested to With the emergence of large mobile ad hoc networks, the reduce clusterhead changes, e.g. the Least Clusterhead ability of existing routing protocols to scale well and Change algorithm [2] when applied to the Lowest ID function satisfactorily comes into question. Clustering has clustering algorithm suggests that a clusterhead change been proposed as a means to divide large networks into will not occur if another host with lower node id comes groups of suitably smaller sizes such that prevailing into the direct transmission range of the existing MANET routing protocols can be applied. However, the clusterhead. However, node mobility of MANETs may still benefits of clustering come at a cost. Clusters take time to cause frequent failure and activation of links. As a result, form and the clustering algorithms also introduce clustering algorit