M. Chatterjee, S.K. Das, and D. Turgut

An On-Demand Weighted Clustering Algorithm (WCA) for Ad hoc Networks


Cite as:

M. Chatterjee, S.K. Das, and D. Turgut. An On-Demand Weighted Clustering Algorithm (WCA) for Ad hoc Networks. In Proceedings of the IEEE GLOBECOM'00, pp. 1697–1701, November 2000.

Download:

Download 

Abstract:

We consider a multi-cluster, multi-hop packet radio network architecture for wireless systems which can dynamically adapt itself with the changing network configurations. Due to the dynamic nature of the mobile nodes, their association and dissociation to and from clusters perturb the stability of the system, and hence a reconfiguration of the system is unavoidable. At the same time it is vital to keep the topology stable as long as possible. The clusterheads, which form a dominant set in the network, decide the topology and are responsible for its stability. In this paper, we propose a weighted clustering algorithm (WCA) which takes into consideration the ideal degree, transmission power, mobility and battery power of a mobile node. We try to keep the number of nodes in a cluster around a pre-defined threshold to facilitate the optimal operation of the medium access control (MAC) protocol. Our clusterhead election procedure is not periodic as in earlier research, but adapts based on the dynamism of the nodes. This on-demand execution of WCA aims to maintain the stability of the network, thus lowering the computation and communication costs associated with it. Simulation experiments are conducted to evaluate the performance of WCA in terms of the number of clusterheads, reaffiliation frequency and dominant set updates. Results show that the WCA performs better than the existing algorithms and is also tunable to different types of ad hoc networks.

BibTeX:

@inproceedings{Turgut-2000-GLOBECOM,
   author = "M. Chatterjee and S.K. Das and D. Turgut",
   title = "An On-Demand Weighted Clustering Algorithm (WCA) for Ad hoc Networks",
   booktitle = "Proceedings of the IEEE GLOBECOM'00",
   location = "San Francisco",
   month = "November",
   year = "2000",
   pages = "1697-1701",
   abstract = { We consider a multi-cluster, multi-hop packet radio network
   architecture for wireless systems which can dynamically adapt itself with the
   changing network configurations. Due to the dynamic nature of the mobile
   nodes, their association and dissociation to and from clusters perturb the
   stability of the system, and hence a reconfiguration of the system is
   unavoidable. At the same time it is vital to keep the topology stable as long
   as possible. The clusterheads, which form a dominant set in the network,
   decide the topology and are responsible for its stability. In this paper, we
   propose a weighted clustering algorithm (WCA) which takes into consideration
   the ideal degree, transmission power, mobility and battery power of a mobile
   node. We try to keep the number of nodes in a cluster around a pre-defined
   threshold to facilitate the optimal operation of the medium access control
   (MAC) protocol. Our clusterhead election procedure is not periodic as in
   earlier research, but adapts based on the dynamism of the nodes. This
   on-demand execution of WCA aims to maintain the stability of the network,
   thus lowering the computation and communication costs associated with it.
   Simulation experiments are conducted to evaluate the performance of WCA in
   terms of the number of clusterheads, reaffiliation frequency and dominant set
   updates. Results show that the WCA performs better than the existing
   algorithms and is also tunable to different types of ad hoc networks.},
}

Generated by bib2html.pl (written by Patrick Riley, Lotzi Boloni ) on Tue Nov 07, 2017 13:11:27