cluster head

The algorithm optimizes the selecting form of the cluster head and gateway and operates with fast convergence and low cost.

The large network shown in Figure 6 - 9 is composed of four smaller clusters, each with a "cluster head " , or coordinator.

An optimized routing protocol is proposed, which uses convergence degree concept during the foundation of cluster-head.

The selection of cluster head takes a mechanism, which is called "first declaration wins" .

The master cluster-head is used for date collecting and date integration. The integrated dates are sent to the vice one.

During the prepare phase, the network is formed and the first cluster head of each cluster is selected.

Members of the node is responsible for sensing and gathering information, sending data to the cluster head node.

Because energy threshold decides to when cluster-head rotation happens, the selection of threshold is critical.

The whole network is divided into several different clusters, and each cluster is made up of a cluster head and some member nodes.

However, due to the heavy work which cluster-head has to take on, energy will be exhausted soon, thus network lifetime will be affected.

Simulated annealing algorithm is used to elect a cluster head set in the implementation of LEACH-C protocol of wireless sensor networks.

The cluster head manages to distribute resource in cluster and communication of clusters.

A dynamic clustering algorithm is proposed based on aggregation gains, which can elect the cluster head in a distributed way.

It spreads network overhead through circularly electing cluster head node.

The cluster head and manager are occupied by MEO satellites and agents are occupied by LEO satellites.

Secondly, this thesis presents a mixed cluster-head selection algorithm (LEACH-C).

A load balancing intercluster routing (LBC) protocol in wireless sensor networks was proposed to balance cluster head load.

Cluster-head selection is the key technique of cluster formation algorithm.

The vice cluster-head charges for the communication with base station.

Based on LEACH and PEGASIS algorithm, this paper proposes an assistant cluster head algorithm in Wireless Sensor Networks(WSN).

Firstly, we've divided the CR users into some clusters and chosen the cluster-head nodes.

In the new round begin, the choose of cluster head node is based on the current energy value in a cluster.

An Energy-efficient Cluster Head Election Algorithm in Wireless Sensor Networks

Energy Adaptive Cluster-Head Selection for Wireless Sensor Networks

RBF-based cluster-head selection for wireless sensor networks

in accordance with the signal power and the residual energy of cluster head to form cluster;

Continuous Trust Building Methods Based on Cluster-head in VE