Unequal Clustering Energy Efficient Sensitive Election Protocol in Wireless Sensor

Networks

Guided By Presented ByProf. Yogesh Rai Virendra Lahoriya

0125CS13MT16

Contents Introduction to Sensor & WSN Architecture of Wireless Sensor Networks Theoretical Background & Literature Survey Problem Statement Solution Approach & Proposed Algorithm Implementation Methodology Performance & Analysis Result Conclusion & Future Work References

2

Introduction to Sensor[4] Sensor - A device which detects or measures a physicalproperty, records & converts it into a signal which can beread out by an observer.

Modern sensors are tiny electromechanical devices. Modern MEMS (Micro Electronics Mechanical System). Low- cost, low-power, multi-functional & bi-directional. Sensor sense - light, motion, temperature, magneticfields, gravity, humidity, moisture, vibration, pressure,electrical fields, sound, radiation & other physical aspectsof the external environment.

Sensor selection criteria accuracy, environmentalcondition, range, resolution, repeatability & cost.

3

Introduction to Wireless Sensor Network

WSN wireless network of spatially distributedautonomous sensor nodes, monitors physical orenvironmental conditions.

Applications- Military, Industrial & Scientific. Examples- environmental monitoring, battle field

surveillance, industry process control, healthcareapplications, traffic control & home automation.

WSN has limited energy (battery power). Once WSN is deployment & it continuously works

till battery dead without human manipulation.

4

Architecture of Wireless Sensor Network

Internet BS

Radio Transceiver Processor Storage Sensor ADC Mobilizer Position Finding System

Power Unit (Battery)

Sensing Unit Processing Unit Transmission Unit User

Sensor node

Figure 1: Architecture of Wireless Sensor Network [4] 5

Architecture of Wireless Sensor Network

Major components of WSN: 1.Sensor Node- main component, (sensing,

processing, data storing, routing, path searching &data transmission).

2.Clusters- sensor nodes are grouped into clusters, (organizational unit for WSNs).

3.Cluster Heads- leader of a cluster. 4.Base Station- communication link between the

sensor network and the end-user. 5.End User- user of data gathered from WSN.

6

Theoretical Background & Literature Survey

Previous Study was based on Energy optimization strategies (Energy efficiency).

We reviewed and analyzed some modern energy

efficient protocols [6][11] :-

LEACH

SEP

ESEP

TEEN

7

LEACH[88] (Low Energy Adaptive Clustering Hierarchy)

proactive routing protocol. even distribution of load among nodes. To distribute the burden or work among nodes, to

improve network life, clusters are formed. Sensor nodes are made to become CHs on turns. Nodes randomly elect themselves as CHs & it is done in a

way that each node becomes CH once in the time periodof 1/ round.

CHs selection is done on probabilistic basis, each sensornode generates a random number inclusive of 0 and 1,if generated value is less than threshold computed bythe next formula & then this node becomes CH.

8

LEACH[88] (Low Energy Adaptive Clustering Hierarchy)

= .

where, = Threshold P = desired change (probability) of being CH r = current round number G = set of nodes which are not became CH in

1/P round9

Advantages of LEACH LEACH strategy is completely distributed, it reduces en

ergy consumption 4 to 8 times lower in case where packets are relayed in multi-hop transmission, and at last, all the nodes in the network die at about the same time due to LEACH fair distribution of CH role.

In LEACH method, the control information from the base station is not required for sensor nodes.

LEACH reduces 7 to 8 times low overall energy dissipation as compared to direct transmissions and minimum transmission energy routing.

In completely distributed network, sensor nodes do not require knowledge of global network.

10

SEP (Stable Election Protocol ) SEP is an improvement over LEACH. SEP is based on two levels of heterogeneity

(normal & advanced). advanced nodes are high energy nodes & the

probability of advanced nodes to become CHs ismore as compared to normal nodes.

Let, m = fraction of total no. of nodes n, whichare deployed with times more energy than theothers.

These powerful nodes are as advanced nodes.

11

SEP (Stable Election Protocol ) Remaining (1 m) n as normal nodes. Probability of normal nodes to become CHs is

= 1 + Probability of advanced nodes to become CHs is

= . 1 + 1 + where, = optimal probability of each node

to become CH.12

SEP (Stable Election Protocol ) Advantage of SEP: In SEP strategy, sensor nodes do not need any

global knowledge of energy at each selectionround.

Limitations of SEP: The limitation of SEP strategy is that the

cluster head selection among sensor nodes is notdynamic, which results that the sensor nodesthat are far away from the powerful nodes willdie first.

13

ESEP (Enhanced Stable Election Protocol)

ESEP is the extension and improvement of SEP. ESEP has three levels of heterogeneity, (normal

nodes, intermediate nodes & advance nodes).

Advantage of ESEP: The advantage of ESEP is that, the power saving

is little enhanced due to three levels of heterogeneity as compared to SEP.

The limitation of ESEP is same as in SEP.

14

TEEN (Threshold Sensitive Energy Efficient sensor Network protocol)

TEEN is reactive routing network protocol which is usedfor time critical applications.

In TEEN, nodes sense the medium continuously, but thedata are transmitted less frequently.

Data are transmitted only when there is an only change occurs in their environment.

TEEN is threshold sensitive protocol based on two levelsof threshold, hard threshold & soft threshold.

In the hard threshold mode, the nodes transmit data ifthe sensed data value is in the range, thus it minimizesthe no. of data transmissions.

In soft threshold mode, the nodes transmit data ifthere are any changes in the value of the sensed data.

15

TEEN (Threshold Sensitive Energy Efficient sensor Network protocol)

Advantages of TEEN: TEEN is well suited for time critical applications. It is quite efficient in terms of energy consumption &

response time. Soft threshold can be varied, depending on sensed data

value & application. A smaller soft threshold value gives amore accurate result of the sensor network.

Limitations of TEEN: If the threshold values are not reached, the nodes will

never communicate. The user will not get any data fromnetwork & it will not come to know even if all nodes die.

Cluster heads always wait for data packets from their nodes by keeping its transmitter on.

16

Problem Statement In LEACH, SEP, ESEP, TEEN, clusters are formed

of equal size. When cluster heads cooperate with other cluster

heads to forward their data to the base station,cluster heads nearer to base station are loadedwith high data transmission traffic & tend to dieearly, leaving areas of the network uncovered &causing network partition.

Cluster head selection is completely based onprobability basis, less depend on current energylevel.

17

Solution Approach & Proposed Algorithm

We proposed a UCEESEP (Unequal ClusteringEnergy Efficient Sensitive Election Protocol) toovercome previous problem.

UCEESEP is based on unequal clustering. UCEESEP groups the sensor nodes into clusters of

unequal size, & clusters closer to the base stationhave smaller in size than those farther away fromthe base station.

Cluster heads nearer to base station can preservesome energy for the inter-cluster data packetforwarding.

18

Formation of Cluster

Figure 1: Formation of Cluster

Cluster Member

Cluster Head

Base Station

19

Solution Approach & Proposed Algorithm

In cluster formation phase, base stationbroadcasts a signal at a fixed power level. Eachnode can compute its approximate distance fromBS based on the received signal strength.

Unequal clusters are produced on the basis ofthe unequal clustering formula:

= 1 where,

= range of competition radius in the network for cluster20

Solution Approach & Proposed Algorithm

= maximum distance from the sensor node to the base station in the network

= minimum distance from the sensor node to the base station in the network,

= distance from node i to the base station in the network,

c = weighted factor, value is between 0 to 1, = maximum value of competition radius.

21

Solution Approach & Proposed Algorithm

UCEESEP is a reactive routing protocol, astransmission of data consumes more energy thansensing & transmission is done only when specificthreshold limit is reached & it has three levels ofheterogeneity.

For three levels of heterogeneity, sensor nodeswith different energy levels are:

1) Advanced Nodes 2) Intermediate Nodes 3) Normal Nodes

22

Solution Approach & Proposed Algorithm

Energy for normal nodes = Energy for advance nodes = 1 + Energy for intermediate nodes = 1 + where, = 2 = factor for advanced nodes which has times m

ore energy than normal nodes.

n = total number of nodes, m = proportion of advanced nodes, = proportion of intermediate nodes,

23

Solution Approach & Proposed Algorithm

The optimal probability for normal nodes to be selected as cluster head (CH) is calculated as

= 1 + . + . The optimal probability for intermediate nodes

to be selected as cluster head (CH) is calculated as

= (1 + )1 + . + . 24

Solution Approach & Proposed Algorithm

The optimal probability for advanced nodes tobe selected as cluster head (CH) is calculated as

= (1 + )1 + . + . where, = optimal probability UCEESEP improvement over previous method.

We have taken threshold level as a parameterfor consideration.

25

Solution Approach & Proposed Algorithm Each node generates a random number between 0 & 1, if

generated value is less than threshold then this nodebecomes cluster head (CH).

The threshold level for normal nodes is calculated as

= 1 1 0 = set of normal nodes that have not became cluster

head in the previous round. = Energy of node at current time. = Energy of node at initial time.

26

Solution Approach & Proposed Algorithm The threshold level for intermediate nodes is calculated as

= 1 1 0 = set of intermediate nodes that have not became cluster head in the previous round. The threshold level for advanced nodes is calculated as

= 1 1 0 = set of advanced nodes that have not became cluster head in the previous round.

27

Solution Approach & Proposed Algorithm

Average total number of cluster heads per round= . 1 . + . . + ..= . UCEESEP has better aspect of energy

consumption and network lifetime improvementdue to energy heterogeneity & ratio of currentenergy to initial energy of the nodes.

28

Implementation Methodology Hardware: Intel Core 2 duo processor 2 GB RAM

Software: Windows 7 Ultimate 32-bit (Operating System) MATLAB 2012a 32-bit (Unix version)

29

Result In our MATLAB simulation, we considered the

same parameter setting to compare UCEESEPwith LEACH, SEP, ESEP and TEEN.

After comparison of UCEESEP with LEACH,SEP, ESEP and TEEN, we evaluated that usingour proposed protocol UCEESEP, better energyefficiency, enhanced network lifetime &throughput.

Santosh Ahirwar, MTech (Digital Communication) Radharaman Institute of Technology & Science, Bhopal 30

Conclusion & Future Work UCEESEP as reactive routing protocol is proposed

where nodes with 3 different levels of energies. The concept of unequal clustering is used & cluster

head selection is threshold as well as energy levelbased, due to three levels of heterogeneity, itproduces increase in energy efficiency & enhancednetwork lifetime.

In comparison with SEP, LEACH, ESEP & TEEN, itcan be concluded that our protocol UCEESEP willperform well in small as well as large sized network& best suited for time critical applications.

31

Conclusion & Future Work However UCEESEP is not suitable where

frequent information is received from wirelesssensor network.

Our future direction will be to overcome thislimitation in this protocol.

Finally, in future, the concept & implementationof mobile base station can be introduced inUCEESEP to perform the next level oftechnology of wireless sensor network.

Santosh Ahirwar, MTech (Digital Communication) Radharaman Institute of Technology & Science, Bhopal 32

References[1] I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, "A Survey

on Sensor Network", IEEE Communication Magazine 40, 8 (August2004), pp. 102-114.

[2] Ningbo Wang, Hao Zhu, An Energy Efficient Algorithm Based onLEACH Protocol, International Conference on Computer Science and Electronics Engineering (ICCSEE), 2012, pp. 339-342.

[3] Islam, M M, Matin, M A, Mondol, T K, Extended Stable ElectionProtocol (SEP) for three-level hierarchical clustered heterogeneous W

SN, IET Conference on Wireless Sensor Systems (WSS 2012), pp. 1-4.[4] Kashaf, A, Javaid, N., Khan, Z.A, Khan, I.A., TSEP: Threshold-Sensitive Stable Election Protocol for WSNs, 10th International Conference on Frontiers of Information Technology (FIT), 2012, pp. 164 - 168.

33

Questions ???and

THANK YOU !!

34

Unequal Clustering Energy Efficient Sensitive Election Protocol in Wireless Sensor NetworksContentsIntroduction to Sensor[4]Introduction to Wireless Sensor NetworkArchitecture of Wireless Sensor NetworkArchitecture of Wireless Sensor NetworkTheoretical Background & Literature SurveyLEACH[88] (Low Energy Adaptive Clustering Hierarchy)LEACH[88] (Low Energy Adaptive Clustering Hierarchy)Advantages of LEACHSEP (Stable Election Protocol )SEP (Stable Election Protocol )SEP (Stable Election Protocol )ESEP (Enhanced Stable Election Protocol)TEEN (Threshold Sensitive Energy Efficient sensor Network protocol)TEEN (Threshold Sensitive Energy Efficient sensor Network protocol)Problem StatementSolution Approach & Proposed AlgorithmFormation of ClusterSolution Approach & Proposed AlgorithmSolution Approach & Proposed AlgorithmSolution Approach & Proposed AlgorithmSolution Approach & Proposed AlgorithmSolution Approach & Proposed AlgorithmSolution Approach & Proposed AlgorithmSolution Approach & Proposed AlgorithmSolution Approach & Proposed AlgorithmSolution Approach & Proposed AlgorithmImplementation MethodologyResultConclusion & Future WorkConclusion & Future WorkReferencesSlide Number 34