Multi-hop clustering based on neighborhood benchmark in mobile Ad-hoc networks

Sik-Sang Yau, Wei Gao

Research output: Contribution to journalArticlepeer-review

14 Scopus citations


Large-scale mobile ad-hoc networks require flexible and stable clustered network structure for efficient data collection and dissemination. In this paper, a technique is presented to construct multi-hop clusters with balanced sizes, based on the neighborhood benchmark (NB) to quantify the connectivity and link stability of mobile nodes. By exploiting autonomous clusterhead selection and a specialized handshake process with the clusterheads, the nodes with highest NB scores are selected as clusterheads and all the clusters constructed are connected. The deviation of cluster sizes is kept small using a partial probability-based approach. Our technique generates highly stable multi-hop clusters with low overhead, and provides the flexibility of controlling the cluster radius adaptively for various network applications.

Original languageEnglish (US)
Pages (from-to)381-391
Number of pages11
JournalMobile Networks and Applications
Issue number5-6
StatePublished - Dec 2007


  • Balanced sizes
  • Mobile ad-hoc networks
  • Multi-hop clusters
  • Neighborhood benchmark

ASJC Scopus subject areas

  • Software
  • Information Systems
  • Hardware and Architecture
  • Computer Networks and Communications


Dive into the research topics of 'Multi-hop clustering based on neighborhood benchmark in mobile Ad-hoc networks'. Together they form a unique fingerprint.

Cite this