POWER EFFICIENCY ROUTING ALGORITHMS OF WIRELESS SENSOR NETWORKS. Presented by - S.ATCHUTHAN. Supervised by – Prof Klaus Moissner. Major Achievements. Investigated energy conservation algorithms for WSN and identify clustering is promising technique for energy saving
POWER EFFICIENCY ROUTING ALGORITHMS OF WIRELESS SENSOR NETWORKS
Presented by - S.ATCHUTHAN
Supervised by – Prof Klaus Moissner
What is a wireless sensor network ?
- Data Acquisition network
-Data Distribution network
Applications of wireless sensor network
- Environmental monitoring
- Battle field surveillance
- Transportation traffic monitoring
Architecture of a wireless sensor network
What happens in a monitoring sensor network
What are the common problems in a wireless networking ?
What is network lifetime ?
How to prolong the network lifetime ?
How energy is consumed in a sensor node ?
Energy conservation – Major challenge
How to conserve energy in a wireless sensor network ?
What is Clustering ?
Promising technique for lifetime extension
Choosing LEACH, DEEC and HEED for investigation
LEACH– Basic clustering mechanism
DEEC - Energy consideration for threshold
HEED - Competitive method
Can apply for Single hop networks.
Cluster head threshold
T(n) = p/(1-p*(r mod(1/p))) if n ε G
T(n) = 0 Otherwise
Distributed Energy – Efficient Clustering Algorithm
Can apply for Single hop networks
Cluster head threshold
T(Si) = Pi /(1-Pi (r mod (1/Pi))) if Si ε G
T( Si ) = 0 Otherwise
Pi = Popt (1+a) Ei (r) / (1+a*m) Ē (r) if normal node
Pi = Popt Ei (r) / (1+a*m) Ē (r) if advanced node
Residual Energy Calculation
ETx (l, d) = l*Eelec +l*єfs *d^2 if d < d0 ETx (l, d) = l*Eelec +l*єmp*d^4 if d >= d0
Average Energy Calculation
Ē (r) = (1/N) * Etotal (1- r/R)
- Node residual energy
- Node degree
Probability to be a cluster head
CHprob = Cprob *(Eresidual /Emax )
Clustering Energy: HEED >> DEEC
DEEC Clustering for multi hop networks
Pseudo code (DEEC Clustering for multi hop networks)
For i = 1:1: n
For j = 1:1: n
If ( d( i, j) =< Tr )
join ( node j joins with cluster head i );
K = rand ();
If (DEEC clustering threshold probability < k)
S ( i ). Cluster = TRUE;
Pseudo code (Shortest path routing)
While ((i =< n) & ((d.sink – d.cluster (i, sink)) >= 100))
While (j =< n)
If (d.cluster (i, j) =< 100)
Cluster (i) = cluster (j);
hop = hop +1; End End