Optimizing Clustering Algorithm in Mobile Ad hoc Networks Using Genetic Algorithmic Approach

Cite as:

D. Turgut, S.K. Das, R. Elmasri, and B. Turgut. Optimizing Clustering Algorithm in Mobile Ad hoc Networks Using Genetic Algorithmic Approach. In Proceedings of GLOBECOM'02, pp. 62–66, November 2002.

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 \em 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 \em clusterheads, which form a dominant set in the network, decide the topology and are responsible for its stability. In this paper, we propose a \em 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-2002-GLOBECOM,
author = "D. Turgut and S.K. Das and R. Elmasri and B. Turgut",
title = "Optimizing Clustering Algorithm in Mobile Ad hoc Networks Using Genetic Algorithmic Approach",
booktitle = "Proceedings of GLOBECOM'02",
location = "Taipei, Taiwan",
month = "November",
year = "2002",
pages ="62-66",
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 {\em 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 {\em clusterheads}, which form a dominant set
in the network, decide the topology and are responsible for its stability. In
this paper, we propose a {\em 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 Dec 19, 2017 12:47:58