Time and message complexities of the generalized distributed mobility-adaptive clustering (GDMAC) algorithm in wireless multihop networks

@inproceedings{Bettstetter2003TimeAM,
  title={Time and message complexities of the generalized distributed mobility-adaptive clustering (GDMAC) algorithm in wireless multihop networks},
  author={Christian Bettstetter and B-C. Friedrich},
  year={2003}
}
Distributed mobility–adaptive clustering algorithms are used in multihop ad hoc networks to separate the nodes into logical groups and build up a hierarchical network architecture. This paper studies the convergence time and message complexity of Basagni’s generalized DMAC clustering algorithm. Our results show how many time steps and signaling messages are typically needed after a single topology change to re–achieve a stable and valid cluster structure. Furthermore, we discuss chain reactions… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 14 CITATIONS

Similar Papers

Loading similar papers…