Journal of Computer Science

Dynamic Head Cluster Election Algorithm for Clustered Ad-Hoc Networks

Arwa Zabian, Ahmed Ibrahim and Fadi Al-Kalani

DOI : 10.3844/jcssp.2008.42.50

Journal of Computer Science

Volume 4, Issue 1

Pages 42-50

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.

Copyright

© 2008 Arwa Zabian, Ahmed Ibrahim and Fadi Al-Kalani. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.