Skip to main content

Table 2 Comparative study of various clustering algorithms for MANETs

From: An optimized stable clustering algorithm for mobile ad hoc networks

Algorithms name

Method used for election of cluster head

Node mobility during cluster setup

Strength

Weaknesses

LID [20]

The node having the lowest IDs among neighbors elected as cluster head

Yes

Faster cluster head election process, simple method, unwanted message exchanges are not required.

If a mobile node that has higher priority and higher ID wants to become cluster head by using LID is not possible.

WCA [23]

Combined weight (W v) is calculated. W v is calculated based on degree of connectivity, mobility, the remaining battery power, and utilized transmission power for each node. The node having the lowest combined weight in network will be elected as cluster head.

Yes

Provide stable cluster, reelection of cluster head is on demand, it also recued clustering overhead.

WCA uses extra parameters for calculating combined weight, which required extra setup and unnecessary message exchanges during cluster head election process. Unnecessary message exchange consumes battery power of mobile nodes.

ICMS [21]

It handles cluster head changes if two or more than two cluster heads are within the same frequency range. Priority of old and new cluster head is calculated based on node degree and the remaining battery power of each cluster head, and cluster head changes will be delayed up to maximum limit. After waiting up to delay time, high priority cluster head elected as cluster head and other changes its status to cluster member within the same cluster.

Yes

Reelection of cluster head is on demand. It reduced cluster head changes to decrease clustering overhead and provide stable cluster head for networks.

If a cluster head acutely required to change within cluster, according to ICMS, cluster head changes will be delayed till it reaching up to maximum limit.

WBC [24]

WBC comprises of three phases. Preclustering phase, cluster formation phase, and cluster maintenance phase. In the first phase, node degree and bandwidth are calculated for each node to get node info. Weight entry is calculated for each node after receiving node info from local table. The node whose weight is higher among all neighbors’ node declares as cluster head.

Yes

Cluster head sustains for longer time by delaying cluster head change to increase stability of network and reduced unnecessary cluster head change.

Extra message exchanges are required for cluster head election which leads towards battery consumption of mobile node.

Prop OSCA

In proposed OSCA, a new node is introduced known as backup node. This node becomes cluster head in absence of cluster head for a cluster, and a new backup node is created later on. OSCA is the extension of WBC.

Yes

Because of backup node concept immediate cluster head election is not required if existing cluster head moves/died from the cluster because backup node upgrades to cluster head and new backup node is elected later on by newly cluster head.

In a cluster, cluster head is responsible for communication with members in a cluster which consumes extra battery power in comparison to cluster members. Election of backup node is extra work, which is done by cluster head, so more battery power will consumed in OSCA while electing backup node for a cluster.