An Efficient Distributed Clustering Scheme for Ad-hoc Wireless Networks

Chyi-Ren DOW; Jyh-Horng LIN; Shiow-Fen HWANG; Yi-Wen WANG

An Efficient Distributed Clustering Scheme for Ad-hoc Wireless Networks

Chyi-Ren DOW, Jyh-Horng LIN, Shiow-Fen HWANG, Yi-Wen WANG

Full Text Views

0

Cite this

Summary :

In ad-hoc mobile radio networks, nodes are organized into non-overlapping clusters. These clusters are independently controlled and dynamically reconfigured when the topology changes. This work presents a Distributed Label clustering scheme (DL) that partitions nodes into clusters using a weight-based criterion. The DL scheme allows the border nodes to determine their roles first to avoid selecting unsuitable clusterheads. In order to resolve the clusterhead change problem, the DL scheme restricts the number of clusterhead changes. The DL scheme also restricts the size of the virtual backbone by reducing the number of clusters. This scheme is distributed and can be executed at each node with only the knowledge of one-hop neighbors. The simulation results demonstrate that our scheme outperforms other clustering schemes in terms of the number of clusters, stability of the clusters and control overhead when the topology changes.

Publication: IEICE TRANSACTIONS on Communications Vol.E85-B No.8 pp.1561-1571

Publication Date: 2002/08/01

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Wireless Communication Switching

Authors

Chyi-Ren DOW
Jyh-Horng LIN
Shiow-Fen HWANG
Yi-Wen WANG

Keyword

Cite this

Copy

Chyi-Ren DOW, Jyh-Horng LIN, Shiow-Fen HWANG, Yi-Wen WANG, "An Efficient Distributed Clustering Scheme for Ad-hoc Wireless Networks" in IEICE TRANSACTIONS on Communications, vol. E85-B, no. 8, pp. 1561-1571, August 2002, doi: .
Abstract: In ad-hoc mobile radio networks, nodes are organized into non-overlapping clusters. These clusters are independently controlled and dynamically reconfigured when the topology changes. This work presents a Distributed Label clustering scheme (DL) that partitions nodes into clusters using a weight-based criterion. The DL scheme allows the border nodes to determine their roles first to avoid selecting unsuitable clusterheads. In order to resolve the clusterhead change problem, the DL scheme restricts the number of clusterhead changes. The DL scheme also restricts the size of the virtual backbone by reducing the number of clusters. This scheme is distributed and can be executed at each node with only the knowledge of one-hop neighbors. The simulation results demonstrate that our scheme outperforms other clustering schemes in terms of the number of clusters, stability of the clusters and control overhead when the topology changes.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e85-b_8_1561/_p

Copy

@ARTICLE{e85-b_8_1561,
author={Chyi-Ren DOW, Jyh-Horng LIN, Shiow-Fen HWANG, Yi-Wen WANG, },
journal={IEICE TRANSACTIONS on Communications},
title={An Efficient Distributed Clustering Scheme for Ad-hoc Wireless Networks},
year={2002},
volume={E85-B},
number={8},
pages={1561-1571},
abstract={In ad-hoc mobile radio networks, nodes are organized into non-overlapping clusters. These clusters are independently controlled and dynamically reconfigured when the topology changes. This work presents a Distributed Label clustering scheme (DL) that partitions nodes into clusters using a weight-based criterion. The DL scheme allows the border nodes to determine their roles first to avoid selecting unsuitable clusterheads. In order to resolve the clusterhead change problem, the DL scheme restricts the number of clusterhead changes. The DL scheme also restricts the size of the virtual backbone by reducing the number of clusters. This scheme is distributed and can be executed at each node with only the knowledge of one-hop neighbors. The simulation results demonstrate that our scheme outperforms other clustering schemes in terms of the number of clusters, stability of the clusters and control overhead when the topology changes.},
keywords={},
doi={},
ISSN={},
month={August},}

Copy

TY - JOUR
TI - An Efficient Distributed Clustering Scheme for Ad-hoc Wireless Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 1561
EP - 1571
AU - Chyi-Ren DOW
AU - Jyh-Horng LIN
AU - Shiow-Fen HWANG
AU - Yi-Wen WANG
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E85-B
IS - 8
JA - IEICE TRANSACTIONS on Communications
Y1 - August 2002
AB - In ad-hoc mobile radio networks, nodes are organized into non-overlapping clusters. These clusters are independently controlled and dynamically reconfigured when the topology changes. This work presents a Distributed Label clustering scheme (DL) that partitions nodes into clusters using a weight-based criterion. The DL scheme allows the border nodes to determine their roles first to avoid selecting unsuitable clusterheads. In order to resolve the clusterhead change problem, the DL scheme restricts the number of clusterhead changes. The DL scheme also restricts the size of the virtual backbone by reducing the number of clusters. This scheme is distributed and can be executed at each node with only the knowledge of one-hop neighbors. The simulation results demonstrate that our scheme outperforms other clustering schemes in terms of the number of clusters, stability of the clusters and control overhead when the topology changes.
ER -