Optimized H-LEACH algorithm for clustering to improve lifetime of WSN

Wireless sensor network (WSN) is one of the most standard selected services for the use of technical field, industrial applications, or in the market. WSN consists basically independent sensors that sense topographical area of implementation. In WSN, the independent nodes sense observe the area which is enclosing us such as observing, sensing of sound, vibration, temperature etc. WSN can transpose the information to the Base Station (BS) and perform different types of processing like data collection, data sensing, data processing and also used for find the best route between nodes and BS to transmit the data. These days, WSNs is being used in many areas like border security, battle field surveillance, motion tracking etc. The main issue associated with a WSN is to enhance its lifetime. Clustering is an approach to increase the network lifetime. H-LEACH is basically a hybrid clustering hierarchy for wireless sensor network. The nodes in H-LEACH get associated with CH in their respective zone. For the long distance CH guild with CH node. In this paper we use extended H-LEACH approach for clustering. In this approach the CH or zones are increased for reducing the distance between one CH to next CH or BS. The CH are selected one in every zone in rotatory using probability same as H-LEACH. When the re-clustering is done the result show minimum energy by normal node during before the transmission of information.