Scenario-based stability anlysis of the distributed mobility-adaptive clustering (DMAC) algorithm

  • Authors:
  • Christian Bettstetter;Roland Krausser

  • Affiliations:
  • Technische Universität München (TUM), Institute of Communication Networks D-80290 Munich, Germany;Technische Universität München (TUM), Institute of Communication Networks D-80290 Munich, Germany

  • Venue:
  • MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

Adaptive distributed clustering algorithms and respective protocols are used in wireless ad hoc networks to dynamically organize all nodes into groups and hierarchites. In this paper, we investigate the Distributed Mobility-Adaptive Clustering (DMAC) algorithm proposed in [6]. In particular, we evaluate how the cluster stability (i.e., the number of clusterhead elections, cluster changes per time step, and cluster lifetime) is influenced by the speed, the choice of the weight, and the failure rate of nodes. We performed simulations in a scenario with an enhanced random mobility model and in a realistic campus scenario that includes hot spots and streets