4.4 Article

An optimized stable clustering algorithm for mobile ad hoc networks

Publisher

SPRINGEROPEN
DOI: 10.1186/s13638-017-0832-4

Keywords

Backup node; Cluster head; Cluster member; Routing overhead; Clustering scheme in MANET

Ask authors/readers for more resources

In mobile ad hoc network, each node is capable of sending message (data) dynamically without requirement of any fixed infrastructure. Mobile nodes frequently move in/out from the network dynamically, making network topology unstable in mobile ad hoc network (MANET). As a result, it becomes an extremely challenging task to maintain stable network. In this research article, we have proposed an optimized stable clustering algorithm that will provide more stability to the network by minimizing the cluster head changes and reducing clustering overhead. In proposed algorithm, a new node is introduced which acts as a backup node in the cluster. Such backup node acts as cluster head, when actual cluster head moves out (or died) from the cluster. Latter, the cluster head reelect a new backup node. This practice keeps network availability without disturbance. Further, the priority of cluster head and backup node is calculated based on the node degree and the remaining battery life for mobile nodes. Decision for electing cluster head and backup node depends on the priority factor.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.4
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available