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

A Weight-Based Distributed Clustering Algorithm for Mobile Ad hoc Networks


Cite as:

M. Chatterjee, S.K. Das, and D. Turgut. A Weight-Based Distributed Clustering Algorithm for Mobile Ad hoc Networks. In Proceedings of Seventh International Conference on High Performance Computing (HiPC), pp. 511–521, December 2000.

Download:

Download 

Abstract:

In this paper, propose a distributed clustering algorithm for a multi-hop packet radio network. These types of networks, also known as \em ad hoc network, are dynamic in nature due to the mobility of the nodes. The association and dissociation of nodes to and from \em clusters perturb the stability of the network topology, and hence a reconfiguration of the system is often unavoidable. However, it is vital to keep the topology stable as long as possible. The clusterheads, which form a dominant set in the network, determine the topology and its stability. Our weight based distributed clustering algorithm 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. The non-periodic cluster procedure for clusterhead election gradually improves the load balance factor (LBF) which is a measure of the load distribution among the clusterheads. For lowering the computation and communication costs, the clustering algorithm is invoked on-demand which aims to maintain the connectivity of the network at the cost of load imbalance. Simulation experiments are conducted to evaluate the performance of our algorithm in terms of the number of clusterheads, reaffiliation frequency and dominant set updates. Results show that our algorithm performs better than the existing algorithms and is also tunable to different types of ad hoc networks.

BibTeX:

@inproceedings{Turgut-2000-HIPC,
   author = "M. Chatterjee and S.K. Das and D. Turgut",
   title = "A Weight-Based Distributed Clustering Algorithm for Mobile Ad hoc Networks",
   booktitle = "Proceedings of Seventh International Conference on High Performance Computing (HiPC)",
   month = "December",
   year = "2000",
   pages = "511-521",
   abstract = {In this paper, propose a distributed clustering algorithm for a
   multi-hop packet radio network. These types of networks, also known as {\em
   ad hoc} network, are dynamic in nature due to the mobility of the nodes. The
   association and dissociation of nodes to and from {\em clusters} perturb the
   stability of the network topology, and hence a reconfiguration of the system
   is often unavoidable. However, it is vital to keep the topology stable as
   long as possible. The clusterheads, which form a dominant set in the network,
   determine the topology and its stability. Our weight based distributed
   clustering algorithm 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. The
   non-periodic cluster procedure for clusterhead election gradually improves
   the load balance factor (LBF) which is a measure of the load distribution
   among the clusterheads. For lowering the computation and communication costs,
   the clustering algorithm is invoked on-demand which aims to maintain the
   connectivity of the network at the cost of load imbalance. Simulation
   experiments are conducted to evaluate the performance of our algorithm in
   terms of the number of clusterheads, reaffiliation frequency and dominant set
   updates. Results show that our algorithm 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