Cluster-Head Election Using Fuzzy Logic For
Wireless Sensor Networks
By :- Maj Saurabh Roy
PREVIEW
REFERENCES
INTRODUCTION
PREVIOUS WORK DONE: LEACH
PRESENT WORK DONE: FUZZY LOGIC
PARAMETERS, SIMULATION, RESULTS AND INFERENCES
ANALYSIS
CONCLUSION
REFERENCES
Cluster-head Election using Fuzzy Logic for Wireless
Sensor Networks
• BY Indranil Gupta,Denis Riordan,Srinivas Sampalli
• PUBLISHED IN IEEE 3rd Annual Communication Networks
and Services Research Conference in 2005
INTRODUCTION
WSNs considered to be one of the potential emerging computing technologies
Advances in Micro Electro- Mechanical Systems (MEMS) technology , Low Power Digital Circuitry
and RF Designs
WSNs consist –
• Inexpensive Portable Wireless Nodes
• Limited Power
• Limited Memory
• Computational Capabilities
Energy supply of sensor nodes is one of the main constraints in the design of this type of network
Energy consumption can be reduced by allowing only some nodes to communicate with the base
station
PREVIOUS WORK DONE
• WSN architecture under study
• Aggregated data from nodes
• Transmits data to Base Station(BS)
Cluster-
Head
• Base Station - loc far and immobile
Cluster-Head Election
• Nodes – Homogeneous
Assumption Energy Constrained
s Location Information
Send Respective Energy info
No Mobility or Little
• Communication channel Symmetric
PREVIOUS WORK DONE
Energy-Efficient Communication Protocol for Wireless Micro sensor
Networks
• BY Wendi Rabiner Heinzelman, Anantha Chandrakasan, and Hari Balakrishnan
• PUBLISHED IN IEEE and 33rd Hawaii International Conference on System Sciences – 2000
Fundamentals of Wireless Sensor Networks: Theory and Practice
• BY Waltenegus Dargie, Christian Poellabauer
LEACH
LEACH stands for Low-Energy Adaptive Clustering Hierarchy
It is Dynamic Clustering Method
LEACH has two phases :- The Set-Up Phase and The Steady-State
The Set-Up Phase :- Where Cluster-Heads are chosen
The Steady-State :- The cluster-head is maintained and data is transmitted between
nodes
LEACH
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
LEACH
Disadvantages
Two cluster-heads may be selected in close vicinity as each node
Number of cluster-head nodes not fixed – Some rounds may have more or less
Node selected may be located near the edges of the network – Other nodes will expend
more energy to transmit data to that cluster-head.
Each node has to calculate the threshold and generate the random numbers in each round -
consuming more CPU cycles
SYSTEM MODEL
Cluster-Heads Elected by Base Station each Round
For Selection uses three Fuzzy Description –
node concentration
energy level in each node &
its centrality with respect to the entire cluster
Base Station - Global Knowledge of Network
Fuzzy Cluster-Head election divided into two rounds i.e setup and
steady state phase similar to LEACH
SYSTEM MODEL
Setup Phase - Cluster-Heads determined using fuzzy knowledge and then
cluster is organized
Steady State Phase - Cluster - Heads collect aggregated data and performs
signal processing functions to compress the data into a single signal.
Composite Signal sent to the Base Station
REFERENCES
Artificial intelligence: A Guide to Intelligent Systems
• BY M. Negnevitsky
• PUBLISHED By Addison-Wesley pub. co in 2001
SYSTEM MODEL – FUZZY LOGIC
Fuzzy Inference
Fuzzifier Fuzzy Rules De-Fuzzifier
Engine
SYSTEM MODEL – FUZZY LOGIC
We examine a simple two-input one-output problem
that includes three rules:
Rule: 1 Rule: 1
IF x is A3 IF project_funding is
adequate OR y is B1 OR
project_staffing is small THEN z is C1 THEN
risk is low
Rule: 2 Rule: 2
IF x is A2 IF project_funding is
marginal AND y is B2 AND
project_staffing is large THEN z is C2
THEN risk is normal
Rule: 3 Rule: 3
IF x is A1 IF
SYSTEM MODEL – FUZZIFICATION
The first step is to take the crisp inputs, x1 and y1 (project funding and
project staffing), and determine the degree to which these inputs belong to
each of the appropriate fuzzy sets.
Crisp Input Crisp Input
x1
1 1 B1 B2
A1 A2 A3 0.7
0.5
0.2 0.1
0 0
x1 X y1 Y
(x = A1) = 0.5 (y = B1) = 0.1
(x = A2) = 0.2 (y = B2) = 0.7
SYSTEM MODEL – FUZZY LOGIC
1 1 1
A3 B1 C1 C2 C3
0.1 OR 0.1
0.0
(max)
0 x1 X 0 y1 Y 0 Z
Rule 1: IF x is A3 (0.0) OR y is B1 (0.1) THEN z is C1 (0.1)
1 1 1
0.7
A2 0.2 B2 0.2
C1 C2 C3
AND
(min)
0 x1 X 0 y1 Y 0 Z
Rule 2: IF x is A2 (0.2) AND y is B2 (0.7) THEN z is C2 (0.2)
1 1
A1 0.5 0.5 C1 C2 C3
0 x1 X 0 Z
Rule 3: IF x is A1 (0.5) THEN z is C3 (0.5)
Mamdani - Rule Evaluation
SYSTEM MODEL – FUZZY LOGIC
1 1 1
C1 C2 C3
0.5 0.5
0.2 0.2
0.1 0.1
0 Z 0 Z 0 Z 0 Z
z is C1 (0.1) z is C2 (0.2) z is C3 (0.5)
Aggregation of the rule outputs
Centre of gravity (COG):
EXPERT KNOWLEDGE REPRESENTATION
Expert knowledge or Membership function is represented
• Node Energy - Energy level available in each node, designated by the fuzzy variable energy.
Node energy is divided into three levels: low, medium and high
• Node Concentration - Number of nodes present in the vicinity, designated by the fuzzy
variable concentration. Node concentration is divided into three levels: low, medium and high
• Node Centrality - A value which classifies the nodes based on how central the node is to the
cluster, designated by the fuzzy variable centrality. Node centrality is divided into three levels :
close, adequate and far
EXPERT KNOWLEDGE REPRESENTATION
Fuzzy set for fuzzy variable energy Fuzzy set for fuzzy variable centrality Fuzzy set for fuzzy variable concentration
Fuzzy set for fuzzy variable chance
FUZZY RULE BASE
RESULTS
SAMPLE NETWORK 1
Network consists of 150 nodes.
Randomly distributed over an area of 100X100 meters.
Base station is located at 200 metes.
Ph 1 Simulation:- Each node has a random energy between 0 and 100.
Base Station computes the Concentration, Energy & Centrality
Values are then fuzzified and passed to the Fuzzy Rule for Rule Evaluation
Defuzzification
RESULTS SAMPLE NETWORK 1
Output fuzzy set for fuzzy variable chance Different node parameters
RESULTS SAMPLE NETWORK 1
Network cluster showing the best nodes
RESULTS
SAMPLE NETWORK 2
Network consists of 150 nodes.
Randomly distributed over an area of 100X100 meters.
Base station is located at 200 metes.
Ph 2 Simulation:- Each node has energy 1J.
Base Station computes the Concentration, Energy & Centrality
Values are then fuzzified and passed to the Fuzzy Rule for Rule Evaluation
Defuzzification
RESULTS SAMPLE NETWORK 2
Elected Cluster-heads for
two consecutive rounds
Simulation in progress
2500 rounds for FND
ANALYSIS
COMPARISON
Network consists of 20 nodes.
Randomly distributed over an area of 100X100 meters.
LEACH :- Cluster-Head probability of 0.05.
Ph 3 Simulation:- Each node has energy 1J.
Both algorithms try to optimize the intra-cluster energy consumption and
thus do not influence the energy required to transmit to the base station.
Concentration for fuzzy set is scaled accordingly, with the other parameters
remaining the same as sample network 2.
Defuzzification
ANALYSIS
FND :- SUMMARY TABLE
CONCLUSION
• Cluster-Heads Elected by Base
Station
• Suitable for electing cluster-heads
for medium Sized Clusters
• Substantial increase in network
lifetime as compared to LEACH
• By modifying shape of fuzzy set further
improvement in n/w lifetime and energy
consumption can be achieved.
THANK YOU
