Optimize the Cluster-head Election Technique in Wireless Sensor Network

Abstract

Wireless Sensor Networks (WSN) is mainly characterized by it's limited power supply. Hence the need for energy efficient infrastructure is becoming increasingly more important since it impacts to network lifetime. Here the focus of this thesis on Hierarchy clustering because Multi-hop short range communication between wireless sensor node is energy efficient compared to Single-hop long range communication. In Hierarchy clustering there are many Protocol but this paper talk about the well known Low-Energy Adaptive Clustering Hierarchy (LEACH)\cite{heinzelman2000energy}.Centralized Low-Energy Adaptive Clustering Hierarchy (LEACH-C) and Advanced Low-Energy Adaptive Clustering Hierarchy(ALEACH) are energy efficient clustering routing protocol and they are belongs to hierarchy routing. In this thesis we proposed Modified LEACH-C to upgraded the execution of existing Leach-C in such sort of Topology where Leach-C perform not all that well. By Applying Method of Distance calculation between CH (cluster-head) to Member node and BS(base-station) to Member node. Making non-overlapping cluster using assigning proper ID while creating cluster. Which makes the routing protocol more energy effective and delays life time of a wireless sensor network. Simulation results demonstrate that Modified LEACH-C enhances network life time contrasted with LEACH-C algorithm.