Design and performance of a distributed dynamic clustering algorithm for ad-hoc networks

A. Bruce McDonald, Taieb F. Znati

Research output: Contribution to journalArticlepeer-review

87 Citations (Scopus)


Routing in ad-hoc networks is a difficult challenge that involves a tradeoff between efficiency and responsiveness. An ad-hoc network routing algorithm must adapt rapidly enough to topology changes to meet the performance demands of users, without over-utilizing network resources. This paper presents the (α, t)-Cluster-framework which utilizes a distributed dynamic clustering strategy to organize nodes into clusters in which the probability of path failure due to node movement can be bounded over time. The objective of the clustering strategy is to achieve scalability and support robust, efficient routing subject to a wide range of mobility rates. Based on the (α, t)-Cluster scheme, routes within clusters are maintained on a proactive basis; whereas, hierarchical routing between clusters is managed on a demand-basis. Simulation results show that the cluster organization can be effectively adapted to node mobility and that routing is both more robust and efficient than routing in fully proactive, reactive or fixed-hybrid schemes.

Original languageEnglish
Pages (from-to)27-35
Number of pages9
JournalProceedings of the IEEE Annual Simulation Symposium
Publication statusPublished - 2001
Externally publishedYes

ASJC Scopus subject areas

  • Software
  • Modelling and Simulation


Dive into the research topics of 'Design and performance of a distributed dynamic clustering algorithm for ad-hoc networks'. Together they form a unique fingerprint.

Cite this