The Combination of the Optimal Number of Cluster-Heads and Energy Adaptive Cluster-Head Selection Algorithm in Wireless Sensor Networks

Author(s):  
Yang Tao ◽  
Yaling Zheng
2012 ◽  
Vol 433-440 ◽  
pp. 5228-5232
Author(s):  
Mohammad Ahmadi ◽  
Hamid Faraji ◽  
Hossien Zohrevand

A sensor network has many sensor nodes with limited energy. One of the important issues in these networks is the increase of the life time of the network. In this article, a clustering algorithm is introduced for wireless sensor networks that considering the parameters of distance and remaining energy of each node in the process of cluster head selection. The introduced algorithm is able to reduce the amount of consumed energy in the network. In this algorithm, the nodes that have more energy and less distance from the base station more probably will become cluster heads. Also, we use algorithm for finding the shortest path between cluster heads and base station. The results of simulation with the help of Matlab software show that the proposed algorithm increase the life time of the network compared with LEACH algorithm.


2014 ◽  
Vol 989-994 ◽  
pp. 4273-4276
Author(s):  
Shi Ping Fan ◽  
Xiao Di Zhang ◽  
Hai Li Wang

In order to prolong the lifetime of wireless sensor networks, improvement of cluster-head selection mechanism based on LEACH protocol is proposed. To make the energy distribution more uniform, we consider the relationship of the density of nodes, residual energy of nodes and distance between nodes and Sink node. It eliminates the defect of energy consumption imbalance in the network caused by random position of cluster-heads and the problem of premature death of nodes caused by low energy nodes becoming cluster-heads. Simulation results show that compared with LEACH algorithm, the improved algorithm extend the network lifetime.


Sign in / Sign up

Export Citation Format

Share Document