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

Sik-Sang Yau, Wei Gao

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish (US)
Title of host publication4th International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness and Workshops, QSHINE '07
DOIs
StatePublished - 2007
Event4th International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness and Workshops, QSHINE '07 - Vancouver, BC, Canada
Duration: Aug 14 2009Aug 17 2009

Other

Other4th International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness and Workshops, QSHINE '07
CountryCanada
CityVancouver, BC
Period8/14/098/17/09

Fingerprint

Mobile ad hoc networks

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Software

Cite this

Yau, S-S., & Gao, W. (2007). Multi-hop clustering based on neighborhood benchmark in mobile ad-hoc networks. In 4th International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness and Workshops, QSHINE '07 [24] https://doi.org/10.1145/1577222.1577264

Multi-hop clustering based on neighborhood benchmark in mobile ad-hoc networks. / Yau, Sik-Sang; Gao, Wei.

4th International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness and Workshops, QSHINE '07. 2007. 24.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Yau, S-S & Gao, W 2007, Multi-hop clustering based on neighborhood benchmark in mobile ad-hoc networks. in 4th International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness and Workshops, QSHINE '07., 24, 4th International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness and Workshops, QSHINE '07, Vancouver, BC, Canada, 8/14/09. https://doi.org/10.1145/1577222.1577264
Yau S-S, Gao W. Multi-hop clustering based on neighborhood benchmark in mobile ad-hoc networks. In 4th International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness and Workshops, QSHINE '07. 2007. 24 https://doi.org/10.1145/1577222.1577264
Yau, Sik-Sang ; Gao, Wei. / Multi-hop clustering based on neighborhood benchmark in mobile ad-hoc networks. 4th International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness and Workshops, QSHINE '07. 2007.
@inproceedings{1250cfcd6d3f45ae8ae46184b53ba89d,
title = "Multi-hop clustering based on neighborhood benchmark in mobile ad-hoc networks",
abstract = "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.",
author = "Sik-Sang Yau and Wei Gao",
year = "2007",
doi = "10.1145/1577222.1577264",
language = "English (US)",
isbn = "9781595937568",
booktitle = "4th International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness and Workshops, QSHINE '07",

}

TY - GEN

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

AU - Yau, Sik-Sang

AU - Gao, Wei

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=70450230358&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70450230358&partnerID=8YFLogxK

U2 - 10.1145/1577222.1577264

DO - 10.1145/1577222.1577264

M3 - Conference contribution

AN - SCOPUS:70450230358

SN - 9781595937568

BT - 4th International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness and Workshops, QSHINE '07

ER -