A Novel Distributed Clustering Algorithm for Mobile Ad-hoc Networks
Sahar Adabi, Sam Jabbehdari, Amirmasoud Rahmani & Sepideh Adabi
Journal of Computer Science, Volume 4, Issue 2, pp. 161–166 · doi.org/10.3844/jcssp.2008.161.166
Abstract
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.
Licence and reuse
Free to read. This article carries the publisher’s copyright, as printed on it: © 2008 Science Publications. It is free to read; ask us before reusing it.
How to reuse this articleResponses (0)
About this article
Adabi, S., Jabbehdari, S. & Rahmani, A. (2008). A Novel Distributed Clustering Algorithm for Mobile Ad-hoc Networks. Journal of Computer Science, 4(2), 161–166. https://doi.org/10.3844/jcssp.2008.161.166
- Licence
- © Science Publications
- Issue
- Volume 4, Issue 2
- Policies
- Editorial independenceUse of generative AIData availabilityAppeals and complaints
- Version
- Version of record
