Least Cluster Change

LCC

The clusterhead scheme could cause performance degradation due to frequent clusterhead elections in a dynamic network. CGSR uses a Least Cluster Change (LCC) algorithm, which is a distributed algorithm. It is based on the lowest-ID or highest-connectivity cluster algorithm (used as an underlying mechanism).

At the start

The lowest-ID or highest-connectivity cluster algorithm is used to create initial clusters, where the Cluster IDs would be dynamically assigned first.

Then

When a non-clusterhead node moves into an other cluster, none of both clusterheads will change (only cluster members are changed).

A clusterhead change occurs only if

• two clusterheads come into one cluster leading to a situation where someone has to give up its clusterhead position according to lowest-id or highest-connectivity.
• one of the nodes moves out of range of all clusterheads

This is an improvement in stability over existing algorithms as those algorithms select the clusterhead every time the cluster membership changes.

"Least Cluster Change" is mentioned on: Cluster-Head Gateway Switch Routing Protocol