Session 2012-2014

Information Technology
Presentation On

SECURE ENERGY-EFFICIENT CLUSTER-BASED

DATA AGGREGATION IN WIRELESS SENSOR NETWORKS

Under Guidance of: Co-Guided by: Presented by:

Dr. R. C. Jain Rashmi Nagwani Akanksha Upadhyay
I.T. Department [Link].
0108CS12MT26
 Contents
• Introduction
• Literature Survey
• Problem Statement
• Proposed Solution
• Concepts Used
• Proposed Technique
• Simulations and its Analysis
• Conclusion
• References
 Introduction
WSNs consists of numerous sensor nodes
• with limited resources.
• those are prone to failures
• those utilize the broadcast communication
pattern and possess severe bandwidth restraint.
 Clustering in WSN
• Organization of sensor nodes
• Reduces number of transmissions
• Reduces energy consumption
• Enhances network lifetime
 Data Aggregation in WSN
• Mining information from collection of data of
all the source nodes [1]
• Reduces network traffic
• Data confidentiality and integrity are major
security challenges
 Literature Survey
• Congestion control in wireless sensor networks
based on bird flocking behavior [5]
P. Antoniou, A. Pitsillides, T. Blackwell, A. Engelbrecht, L. Michael

 PSO in WSN for congestion control and minimal

information exchange.
 Performance is evaluated by dynamically
balancing the offered load.
 Achieves robustness and increases the scalability
of the network.
 Literature Survey
• Energy aware optimal cluster head selection in
wireless sensor networks [6]
M. Natarajan, R. Arthi, K. Murugan

 PSO in LEACH protocol.

 Organizing nodes and aggregating data at CH,
expands lifespan of the network.
 Produces energy aware clusters with optimal
selection of CHs.
 Literature Survey
• Secure and energy-efficient data aggregation
in wireless sensor networks [7]
J. Sen

 Enhanced and improved cluster-based private data

aggregation (CPDA) protocol.
 Results in dispersed overhead.
 Problem Statement
• In paper [3] Bhasker proposed genetically
derived secure cluster-based data aggregation
in WSNs
• CH selected as aggregator based on node
connectivity, clustering using GA then an
encryption algorithm
• GA is discrete and entity cant communicate
globally
 Proposed Solution
• This is solved using inherently continuous
PSO
• PSO employs gbest and lbest to find best-fit
particle
• PSO reaches solution faster and with less
computation
 Concepts Used
• LEACH Cluster-based Protocol
• PSO
• RSA Cryptosystem
LEACH Cluster-based Protocol
 LEACH
• Low-Energy Adaptive Clustering Hierarchy [8]
• The nodes organize themselves into local clusters, with one
node acting as the local base station or cluster-head.
• Cluster-head nodes broadcast their status to the other
sensors in the network.
• Each sensor node determines to which cluster it wants to
belong by choosing the cluster-head.
• Each cluster-head creates a schedule for the nodes in its
cluster.
• Once the cluster-head has all the data from the nodes in its
cluster, the cluster-head node aggregates the data and then
transmits the compressed data to the base station.
 LEACH Operation
• The operation of LEACH is broken up into
rounds.
• Each round comprises 2 phases
1. Set-up phase: when the clusters are organized,
2. Steady-state phase: when data transfers to the
base station.
 PSO
• Inspired by nature and behavior of natural
habitat [4].
• Basic idea is [2]
 To create a swarm of particles (potential solution
to the problem) which move in the space around
them (the problem space) searching for their goal
(optimum solution), the place which best suits
their needs given by a fitness function.
 Each particle is moving and hence has a velocity.
 The particles in the swarm co-operate. A particle
knows the fitness of those in its neighborhood, and
uses the position of the one with best fitness.
 How PSO works
Initialize particles

Calculate fitness values for each particle

Is current
YES fitness value NO
better than
pBest

Assign current fitness as new pBest Keep previous pBest

Assign best particle’s pBest value to

gBest

Update data value by obtaining velocity

vi,d = vi,d + C1 * Rnd(0,1) * [pbi,d - xi,d] + C2 * Rnd(0,1) * [gbd - xi,d]
xi,d = xi,d + vi,d

Target or
YES NO
maximum
epochs reached

Stop
 RSA Cryptosystem
Sender Receiver

Receiver’s Receiver’s
public key private key

Encryption Decryption
Program Program

Sender’s Sender’s public

private key key

Secure

Insecure
Message + Message +
Sender’s Sender’s
Signature Transmission Signature
 Proposed Technique
• It proceeds in 3 steps:
 Selection of nodes as CHs or Aggregator
 Cluster formation
 Encryption
 CHs and DAG (Selection)
• PSO is used to optimize the data aggregator
selection process.
• PSO computes best possible combination of
the nodes to obtain a cluster head node as data
aggregator.
 Clustering
• According to LEACH protocol
 We broadcast the list of CHs.
 Each CH then announces and nodes can join
cluster-heads based on signal strength.
 Secure Data Transmission
1

Encrypts data Decrypts data

Generates using the
using the key
public key private key
2 generated

End User

CH as Data Aggregator
n Base Station

Scattered Cluster nodes

 Simulations
Simulation Parameters Value
Simulator NS2.34
No. of nodes 20,40, 60, 80 and 100

Search area size 750X750

MAC 802.11

Simulation time 50 s

Traffic source CBR

Packet size 512

Transmission power 0.660 w

Receiving power 0.0395 w

Idle power 0.035 w

Initial energy 10.1 J

Transmission rate 250 m

Routing protocol GDSDA

 Performance Evaluation
• Performance of the proposed work is
compared to GDSDA.
• Network Size was varied from 20 to 100 nodes
and results were analyzed on the basis of that.
Performance Comparison between
Proposed Work and GDSDA
Performance Comparison between
Proposed Work and GDSDA
Performance Comparison between
Proposed Work and GDSDA
 Conclusion
• The obtained solution is optimal as PSO is
employed in LEACH.
• This also results in solution with less
computation compared to GDSDA.
• The energy consumption is minimized and the
network lifetime is increased.
• The utilization of RSA cryptosystem ensures
confidentiality, authentication and integrity of
the data being transmitted.
 References
[1] N.S. Patil, P.R. Patil, “Data aggregation in wireless sensor network”, IEEE Int. Conf.
Computational Intelligence and Computing Research, 2010.
[2] A.P. Engelbrecht, Computational intelligence: An introduction, Wiley, 2007.
[3] L. Bhasker, "Genetically derived secure cluster-based data aggregation in wireless sensor
networks”, Information Security, IET , vol.8, no.1, pp.1,7, Jan. 2014
[4] M. Clerc and J. Kennedy, “The particle swarm - explosion, stability, and convergence in a
multidimensional complex space”, IEEE Trans. Evolutionary Computation, 6(1):58-73, 2002
[5] P. Antoniou, A. Pitsillides, T. Blackwell, A. Engelbrecht, L. Michael, “Congestion control in
wireless sensor networks based on bird flocking behavior”, Computer Networks, vol. 57, Issue
5, pp. 1167-1191, 7 April 2013
[6] M. Natarajan, R. Arthi, K. Murugan, "Energy aware optimal cluster head selection in wireless
sensor networks", Computing, Communications and Networking Technologies (ICCCNT),
2013, vol., no., pp.1,4, 4-6.
[7] J. Sen, “Secure and energy-efficient data aggregation in wireless sensor networks”, Proc.
Second National Conf. Computational Intelligence and Signal Processing (CISP 2012), 2012
[8] W. R. Heinzelman, A. Chandrakasan, and H. Balakrishnan, “Energy-Efficient Communication
Protocol for Wireless Microsensor Networks”, Proc. of 33rd Hawaii International Conference
on System Sciences, 2000, pp. 1–10.
[9] B. A. Forouzan, D. Mukhopadhyay, Cryptography and Network Security, 2nd ed., New Delhi :
Tata Mcgraw Hill Education Private Ltd., 2011.