A Novel Distributed Clustering Algorithm for Mobile Ad-hoc Networks
Sahar Adabi, Sam Jabbehdari, Amirmasoud Rahmani and Sepideh Adabi
DOI : 10.3844/jcssp.2008.161.166
Journal of Computer Science
Volume 4, Issue 2
This paper proposed a new Distributed Score Based Clustering Algorithm (DSBCA) for Mobile Ad-hoc Networks (MANETs).In MANETs, select suitable nodes in clusters as cluster heads are so important. The proposed Clustering Algorithm considers the Battery Remaining, Number of Neighbors, Number of Members, and Stability in order to calculate the node's score with a linear algorithm. After each node calculates its score independently, the neighbors of the node must be notified about it. Also each node selects one of its neighbors with the highest score to be its cluster head and, therefore the selection of cluster heads is performed in a distributed manner with most recent information about current status of neighbor nodes. The proposed algorithm was compared with Weighted Clustering Algorithm and Distributed Weighted Clustering Algorithm in terms of number of clusters, number of re-affiliations, lifespan of nodes in the system, end-to-end throughput and overhead. The simulation results proved that the proposed algorithm has achieved the goals.
© 2008 Sahar Adabi, Sam Jabbehdari, Amirmasoud Rahmani and Sepideh Adabi. 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.