Size-restricted cluster formation and cluster maintenance technique for mobile ad hoc networks

  • Authors:

  • Gayathri Venkataraman;Sabu Emmanuel;Srikanthan Thambipillai

  • Affiliations:

  • School of Computer Engineering, Nanyang Technological University, Singapore;School of Computer Engineering, Nanyang Technological University, Singapore;School of Computer Engineering, Nanyang Technological University, Singapore

  • Venue:
  • International Journal of Network Management
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Mobile ad hoc networks may be composed of a large number of nodes and hence a hierarchical cluster-based structure can be employed to address the scalability issues of the large network. In this paper we propose a size-restricted, distributed clustering strategy (cluster formation and cluster maintenance) for mobile ad hoc networks. A distributed approach where every node is responsible for the clustering decisions would avoid single-point bottleneck failures. We use a size restriction S, for the cluster formation and cluster maintenance. In addition, while forming the cluster we also use a diameter restriction K. The simulations show that our strategy gives rise to a lesser number of clusters when compared to other clustering algorithms proposed by Gerla et al., Fernadess et al. and Lin et al. This is attributed to the size restriction and cluster merging that we have incorporated. The size restriction helps in better management of resources inside the cluster. Our clustering technique uses a weight-based cluster head election strategy which results in less change in cluster head and higher cluster head lifetime when compared to the Least Cluster Head Changes (LCC) with lowest ID algorithm. The low change in cluster head and higher cluster head lifetime make our proposed algorithm suitable for high-mobility situations. The proposed clustering strategy could be used for building the clusters required in a hierarchical structure of the ad hoc network.