Krishna Insititute Engineering and Technology, Ghaziabad (U.P.) India

Energy efficient Cluster Head Selection in LEACH protocol

Presented by-Mehul Goel

Shiva Bhardwaj

Under Guidance OfMrs. Twinkle Tiwari

(Assistant Professor)

Department of Information Teachnology

Overview

§ Wireless Sensor Network§ Introduction of LEACH§ Phases of LEACH § Working of LEACH§ Variations of LEACH§ Proposed LEACH§ Conclusion§ References

• WSN.

• Base Station.

• Transceiver.

Wireless Sensing Network

ProblemLimited energy of the sensor.

An Introduction

v LEACH stands for Low-Energy Adaptive Clustering Hierarchy.

v This WSN is considered to be a dynamic clustering method.

v Randomized rotation of cluster heads among the sensors .

v All non-cluster head nodes transmit data to their cluster head.

v CH receives this data and performs signal processing functions on the data and transmits data to the BS.

Cluster Head :

v The reason we need network protocol such as LEACH is due to the fact that a node in the network is no longer useful when its battery dies.

v This protocol allows us to space out the lifespan of the nodes, allowing it to do only the minimum work it needs to transmit data.

The Problem

Cluster Head

The LEACH Network is made up of nodes, some of which are called cluster-heads….

Ø The job of the cluster-head is to collect data from their surrounding nodes and pass it on to the base station

Ø LEACH is dynamic because the job of cluster-head rotates

LEACH’s two phases

The LEACH network has two phases:§ The set-up phase § The steady-state

The Set-Up Phase

• Where cluster-heads are chosen• None cluster head get involved

The Steady-State

• The cluster-head is maintained• When data is transmitted between nodes

Stochastic Threshold Algorithm

Cluster-heads can be chosen stochastically (randomly based) on this algorithm:

If n < T(n), then that node becomes a cluster-head The algorithm is designed so that each node becomes a cluster-

head at least once

Weakness in LEACH

LEACH assumes that

§ It is only suitable for small size networks.

§ All nodes have data to send and so assign a time slot for a node even though some nodes might not have data to transmit.

§ Overhead of clustering after certain period of time.

§ System stop situation at the time of cluster head failure.

§ LEACH requires CHs to transfer their aggregated data to the sink node over a single-hop link.

Variations of LEACH§ LEACH-E§ LEACH-C§ TL-LEACH§ MULTIHOP LEACH§ LEACH-F§ LEACH-ME§ LEACH-B§ LEACH-M§ LEACH-H

• Energy Consumption:-

• Energy consumption is the main issue for any data transmission setup in wireless sensing network.

• System Efficiency:-

• Improvement in cluster head selection can improve system efficiency.

Our area of work

Conclusion

• On the basis of traditional LEACH protocol, this project

proposes an energy balance algorithm optimizing cluster-

head selection.

• considering the residual energy and distance factors,

improves cluster-head election.

• Improves strategy of non-cluster head node selecting the

optimal cluster-head.

• It balance the network energy consumption, heighten system

data transmission, and prolong the nodes and network life.

References

• L Xiang, J Luo, A Vasilakos, Compressed data aggregation for energy efficient wireless sensor networks, in 2011 8th Annual IEEE Communications

• Yang Jing , Li Zetao , Lin Yi proposed paper on "AN Improved Routing Algorithm Based on LEACH for WSN" , in 2013 IEEE Communication.

• ] Hu Junping , Jin Yuhui , Dou Liang proposed paper on "A Time-based Cluster-Head Selection Algorithm for LEACH " in 2008 IEEE Communication

• Chenmin Li , Guoping Tan , Jingyu Wu , Lizhong Xu Analyzing Cluster-Head Selection Mechanism and improving the LEACH at 2011 IEEE Communication .

Thanks for your attention…