Clustering overhead and convergence time analysis of the mobility-based multi-hop clustering algorithm for mobile ad hoc networks

  • Authors:

  • Inn Inn Er;Winston K. G. Seah

  • Affiliations:

  • Department of Computer Science, School of Computing, National University of Singapore, Singapore and Institute for Infocomm Research, Singapore, Singapore;Institute for Infocomm Research, Singapore, Singapore and Department of Computer Science, School of Computing, National University of Singapore, Singapore

  • Venue:
  • Journal of Computer and System Sciences - Special issue: Performance modelling and evaluation of computer systems
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

With the emergence of large mobile ad hoc networks, the ability of existing routing protocols to scale well and function satisfactorily comes into question. Clustering has been proposed as a means to divide large networks into groups of suitably smaller sizes such that prevailing MANET routing protocols can be applied. However, the benefits of clustering come at a cost. Clusters take time to form and the clustering algorithms also introduce additional control messages that contend with data traffic for the wireless bandwidth. In this paper, we aim to analyse a distributed multi-hop clustering algorithm, Mobility-based D-Hop (MobDHop), based on two key clustering performance metrics and compare it with other popular clustering algorithms used in MANETs. We show that the overhead incurred by multi-hop clustering has a similar asymptotic bound as 1-hop clustering while being able to reap the benefits of multi-hop clusters. Simulation results are presented to verify our analysis.