An algorithm for electing cluster heads based on maximum residual energy
Weixing Wang, Axel Jantsch · 2006
One of the main challenges in wireless sensor networks is to obtain long system lifetime. We propose an algorithm for electing the cluster head node based on the maximum residual energy for the purpose of even distribution of energy consumption in the overall network and obtaining the longest network lifetime. To maintain the original performance of the network, the lifetime is suggested to be expressed as to both the maximum last node dying time and the minimum time difference between the last node dying and the first node dying. The key parameter — the electing coefficient (θ) was obtained and evaluated. The optimal θ value is related to number of nodes, energy consumption of cluster members (ECCM), and energy consumption of the cluster head (ECCH). θ descends when number of nodes and ECCM decrease, and when ECCH increases. However, when energy consumptions of the cluster head and cluster members change proportionally, θ seems to be affected slightly. Results show that network lifetime can be prolonged when cluster heads are elected with the optimal θ value.