scenario-based stability anlysis of the distributed mobility-adaptive clustering (dmac) algorithm
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
scenario stability distributed mobility adapt clustering algorithm wireless ad hoc networks organization group paper evaluation change timing lifetime failure simulation randomization mobility model modeling simulation and performance evaluation distributed network algorithms mobile wireless ad hoc networks