An Efficient Cluster Head Selection Algorithm for Wireless Sensor Networks –Edrleach

Abstract

The Cluster-head Gateway Switch Routing protocol (CGSR) uses a hierarchical network topology. CGSR organizes nodes into clusters, with coordination among the members of each cluster entrusted to a special node named cluster-head. The cluster head selection is done with the help of any of the algorithm for cluster head selection. Energy is the primary constraint on designing any Wireless Networks practically. This leads to limited network lifetime of network. Low-Energy Adaptive Clustering Hierarchy (LEACH) and LEACH with deterministic cluster head selection are some of the cluster head algorithms that enable to optimize power consumption of WSN. There are various factors like density & distance, threshold based, power efficient. Load balancing and scalability are the other factors which plays important role in the selection of Cluster head. Algorithms based on load balancing reduce communication cost to a great extent. The algorithms that this study is focused are A Density and Distance based Cluster Head, An Energy Efficient Algorithm for Cluster-Head Selection in WSNs, Consumed Energy as a Factor for Cluster Head. These three algorithms are analyzed and studied in this paper. The analysis of these algorithms gave birth to a new algorithm called EDRLEACH, which is proposed through this paper. Keywords-Cluster head,energy efficient algorithms,selection head algorithms, wireless sensor,networks.