Research Article Open Access

Dynamic Head Cluster Election Algorithm for Clustered Ad-Hoc Networks

Arwa Zabian, Ahmed Ibrahim and Fadi Al-Kalani

Abstract

In distributed system, the concept of clustering consists on dividing the geographical area covered by a set of nodes into small zones. In mobile network, the clustering mechanism varied due to the mobility of the nodes any time in any direction. That causes the partitioning of the network or the joining of nodes. Several existing centralized or globalized algorithm have been proposed for clustering technique, in a manner that no one node becomes isolated and no cluster becomes overloaded. A particular node called head cluster or leader is elected, has the role to organize the distribution of nodes in clusters. We propose a distributed clustering and leader election mechanism for Ad-Hoc mobile networks, in which the leader is a mobile node. Our results show that, in the case of leader mobility the time needed to elect a new leader is smaller than the time needed a significant topological change in the network is happens.

Journal of Computer Science
Volume 4 No. 1, 2008, 42-50

DOI: https://doi.org/10.3844/jcssp.2008.42.50

Submitted On: 10 December 2007 Published On: 31 January 2008

How to Cite: Zabian, A., Ibrahim, A. & Al-Kalani, F. (2008). Dynamic Head Cluster Election Algorithm for Clustered Ad-Hoc Networks . Journal of Computer Science, 4(1), 42-50. https://doi.org/10.3844/jcssp.2008.42.50

  • 3,043 Views
  • 2,461 Downloads
  • 11 Citations

Download

Keywords

  • Dynamic head cluster
  • Ad-Hoc networks
  • mechanism
  • leader
  • election algorithm