Sciweavers

Share
MONET
2007

Multi-hop Clustering Based on Neighborhood Benchmark in Mobile Ad-hoc Networks

9 years 1 months ago
Multi-hop Clustering Based on Neighborhood Benchmark in Mobile Ad-hoc Networks
— Large-scale mobile ad-hoc networks require flexible and stable clustered network structure for efficient data collection and dissemination. In this paper, a scheme is presented to construct multi-hop clusters with balanced sizes, based on the neighborhood benchmark (NB) which quantifies 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 scheme generates highly stable multi-hop clusters with low overhead, and provides the flexibility of controlling the cluster radius adaptively for various network applications.
Stephen S. Yau, Wei Gao
Added 27 Dec 2010
Updated 27 Dec 2010
Type Journal
Year 2007
Where MONET
Authors Stephen S. Yau, Wei Gao
Comments (0)
books