Energy Efficient Fuzzy C-Means and RED_LEACH

Based Clustering Algorithm in Wireless Sensor

Networks
Supervised by : Dr. Khine Thin Zar Ms. Tin Aye Chit
Dr. Nyein Aye Maung Maung Department of CEIT
Yangon Technological University
Myanmar
Date : 26.11.2019
1
 Outlines
What is Wireless Sensor Network(WSN)?
WSN Applications
Why Clustering is needed?
Research Challenge
Radio Energy Dissipation Model
Cluster Head Selection in LEACH Protocol
Cluster Head Selection in RED_LEACH Protocol
Cluster Formation in FCM Protocol
Proposed Hybrid Protocol
Network Setup Parameters
Sum of Energy of Nodes Comparison in Each Round
Number of Dead Nodes Comparison in Each Round
2
 What is Wireless Sensor Network(WSN)?

WSN is composed of a large number of wireless sensors with low processing

power and energy consumption for monitoring a certain environment.

3
 WSN Applications

 In many WSN applications, the

sensor nodes are battery driven
and often it is difficult to
Agricultural management
recharge or replace them.
Military Surveillance

 Energy efficiency is needed

-to prolong the network lifetime
-to ensure network performance

Environmental monitoring Underwater WSN 4

 Why Clustering is needed?
-to avoid traffic
-to reduce time consumption
-to reduce energy consumption
-to perform quick transmission
of information Aggregation
Node

Base Station
Base Station Clustering algorithm provides
an effective way to extend the
network lifetime of WSNs.

5
 Research Challenge
In the scheme of clustering , network is divided into various number
of clusters and every node share the sensed data to their respective
cluster head (CH).

The responsibility of CH is to aggregate and transmit the sensed data

to the base station (BS).

Formation of cluster and election of CH among the member nodes to

optimize energy utilization is a challenging task.
 Radio Energy Dissipation Model

m  E elec  m   fs  d 2,ifd  d 0 • ETX(m,d) = energy dissipation in transmitting m-bits packet

E TX
(m, d)  {
m  E elec  m   mp  d 4,ifd  d 0 with a distance d
• Eelec = energy dissipation per bit to run the transceiver
circuit
 fs • Ɛfs = the amplifier parameters for the free space
d0 
 mp
propagation model
• Ɛmp = the amplifier parameters the two-ray ground
propagation model

E RX (m)  m  E elec • d0
• ERX(m)
= threshold distance
= energy required for receiving m-bits message
7
 Cluster Head Selection in LEACH Protocol
• A node ni generates a random number between 0 and 1.
If random number is less than threshold T(ni) , the node ni is selected
as cluster head.
T(ni) =
P = desired percentage of cluster head
r = current round
N = set of nodes that have not become cluster head

8
Cluster Head Selection in RED_LEACH Protocol
Start

Initialize node ni

The threshold equation of RED_LEACH :

Node ni generates random number Ri
(0<Ri<=1)
P
E r (i),ifnG
Calculate distance between node ni and base
1
station D
1 P(r mod( ))
Calculate mean value of distance Dm T(n)  { P
0,otherwise
Calculate threshold T(ni) as per equation (5)

No
D<=Dm

Yes
No
Node ni waits for
Ri<=T(ni) advertisement message
from CH node

Yes

Elected node ni as CH

Node ni sends advertisement message

declaring itself as CH node

End
9
 Cluster Formation in FCM Protocol
Consider a network of i sensor nodes which is partitioned into j
clusters: C1, C2, ..., Cc.
The purpose of the cluster formation in this protocol is to minimize
the following objective function:
N c
J m =  u ||x i -c j ||
m
ij
2

i=1 j=1

uij = membership value

cj = the cluster center
10
 Proposed Hybrid Protocol
Combines FCM and RED_LEACH protocols
FCM is used for cluster formation and RED_LEACH is used for
cluster heads (CHs) selection
Considers each node’s residual energy and smallest distance to cluster
center for CH selection

11
 Network Setup Parameters
Parameters Value
Initial Energy E0 0.5 J
Electronic Energy Eelec 50nJ/bit
Free Space Model Efs 10pJ/bit/m2
Multipath Model Emp 0.0013pJ/bit/m4
Data Aggregation Energy EDA 5nJ/bit/signal
No. of node 100
No. of round 3000, 5000

12
Sum of Energy of Nodes Comparison in each round

13
Number of Dead Nodes Comparison in Each Round

14
THANK YOU