M Tech Presentation
M Tech Presentation
M Tech Presentation
PRESENTATION
www.company.com
Objectives
To study various modifications in LEACH protocol in
wireless sensor network.
To develop an algorithm using swarm intelligence and
design a routing protocol using MATLAB.
To improve the QoS parameters of using new routing
protocol like Packet Delivery Ratio, Packets to BS.
To improve energy efficiency using new routing protocol
in WSN.
www.company.com
Objectives Achieved
To study various modifications in LEACH protocol in
wireless sensor network.
To develop an algorithm using swarm intelligence and
design a routing protocol using MATLAB.
www.company.com
1st Objective
To study various modifications in LEACH protocol in wireless sensor
network.
Protocol
Base Station
HOP
PSO & GA
Ramarks
PEGASIS
FIXED
MULTI
NO
Token passing
HEED
FIXED
SINGLE
NO
www.company.com
LEACH
FIXED
SINGLE
NO
Clustering technique
MLEACH
FIXED
MULTI
NO
LEACHC
FIXED
SINGLE
NO
ELEACH
FIXED
SINGLE
NO
VLEACH
FIXED
MULTI
NO
Base Station
HOP
PSO & GA
Ramarks
MODLEACH
FIXED
SINGLE
NO
IBLEACH
FIXED
MULTI
PSO & GA
LEACHTLCH
FIXED
TWO
PSO & GA
LEACHL
FIXED
LIMITED
PSO
LEACHDE
FIXED
SINGLE
PSO & GA
IELEACH
FIXED
MULTI
PSO & GA
E-OEERP
FIXED
SINGLE
PSO
FEFEBRP
FIXED
MULTI
NO
EELEACH
FIXED
SINGLE
NO
LEACH
with
transmission
www.company.com
optimal
angle
for
2nd Objective
www.company.com
Cont.
4.If Distance of node is greater than or equal to threshhold
Distance and energy of nodes is greater than the threshhold
energy level, assign that node as a Cluster heads and execute
steps 5 & 6.
5. Compare Cluster head with all the neighboring nodes.
6. If associated value of node is greater than associated value of
Cluster head and distance is less then threshhold limit then
change the Cluster head with given node.
Algorithm 1 depicts that number of Clusters in the WSN does not
only depend upon the number of nodes but also on the positions
of nodes in field.
www.company.com
Algorithm 2
Algorithm2 : To find the optimal node for Cluster Head in Cluster
1. Calculate the average energy of neighbor for alive nodes in network.
2. If energy of Cluster heads is less then certain limit calculate with average
energy parameter. execute steps 3 & 4.
3. Compare Cluster head with all the neighbor nodes.
4. If associated value of node is greater than associated value of Cluster head
and distance is less then threshhold limit then change the Cluster head
with given node.
Algorithm 2 is used to find the optimal Cluster Head from the cluster formed
by algorithm 1.
www.company.com
www.company.com
Cont.
www.company.com
Comparison Table
No. of Dead Nodes
1st node
50
90
100
129
817
1417
1637
87
616
1026
1251
Rounds LEACH
89
401
1028
1271
www.company.com
Cont.
www.company.com
No. of Rounds
500
1000
1500
Final
40441
62897
65381
67432
33123
40020
57765
57765
Packet to CH LEACH
32577
40357
41921
41921
www.company.com
www.company.com
Cont
www.company.com
Comparison Table
No. of Rounds
500
1000
1500
Final
4705
10234
13160
13472
3579
4636
6986
6986
Packet to BS LEACH
3646
4651
5116
5116
www.company.com
www.company.com
Cont
www.company.com
THANK YOU
www.company.com