Energy Efficient Scheme for Large

Scale Wireless
Sensor Networks with Multiple Sinks
 ABSTRACT
we proposed a simple and efficient
approach for the placement of multiple
sinks within large-scale WSNs.
The objective is to determine optimal
sinks’ positions that maximize the network
lifetime by reducing energy consumption
related to data transmissions from sensor
nodes to different sinks.
 INTRODUCTION
• A sensor network is a static ad hoc network
composed of hundreds or thousands of
sensor nodes.
• Each sensor node is equipped with a sensing
device, a low computational capacity
processor, a short-range wireless transmitter-
receiver and a limited battery-supplied
energy.
• It collects data from the surrounding
environment and forward it towards a “close”
base station.
 EXISTING SYSTEM
The existing protocols and mechanisms are
not scalable.
They are mostly conceived and adapted to
relatively small networks.
In particular, centralised approaches, where
data from each sensor is sent to a central
base station, are not efficient and can not
scale for large wireless sensor networks.
 PROPOSED SYSTEM
• The use of multiple base stations is one
possible solution for large-scale WSNs.
• The idea is to shorten the path between
each sensor node and the nearest base
station, to save energy consumption for
transmission operations.
• To achieve this efficiency, the multiple
base stations should be optimally placed
within the sensed area.
• Graph theory technique is used to partition
the network.
 SYSTEM REQUIREMENTS
SOFTWARE REQUIREMENTS
• Java 1.5

HARDWARE REQUIREMENTS

• Windows 2000,Xp
• 4gb RAM
• 20gb hard disk/ ROM
 SYSTEM ANALYSIS
Model formulation
-- The objective is to partition the
connected graph into connected balanced
subgraphs(in terms of number of nodes).
-- This partitioning technique should be
applied as much as required according to
the targeted size for the sub-networks and
taking into account the number of available
sinks to be placed.
Problem resolution
-- we used the polynomial
pproximation
algorithm.
-- we adapted the algorithm by
sorting the list of candidates for each
partition according to their distance.
 start

Model formulation
(Nodes creation)

Problem resolution
Graph partitioning (partitioning the
approach network)

Collecting data from

node to sink

stop
DFD
 MODULES
Nodes Creation.
Dividing the network into subnetworks
based on Graph Partitioning Approach.
Sink placement technique.
Downloading data from nodes to sink.
Results.
 MODULES DESCRIPTION
NODES CREATION:
- The Sensor Nodes were created for
visual representation according to the user
wish (based on co-ordinates).
- The data can be uploaded for the
nodes from the database.
- We can also upload different values to
different nodes.
GRAPH PARTITIONING APPROACH:
- Maximally Balanced Connected Partition
problem (MBCP) is used here.
- Sub-networks are formed in terms of
number of sensors.
- This technique should be applied
according to the size for the sub-networks
and no.of sinks to be placed on the network.
- The final result should be pow(2,n)
where n is the no.of partitioning iterations.
SINK PLACEMENT TECHNIQUE:
- The sinks are deployed according to
each sub-network.
- polynomial approximation concept is
used.
- To select the neighbouring nodes within
the same sub-network the sorting list of
nodes is calculated based on the distance
of nodes.
- The sinks are placed in such a way
that,they are movable around its partition.
DOWNLOADING DATA FROM NODES TO
SINK:
- To collect the data from the nodes,in
existing concepts the data will pass through
their parent nodes to reach the sink.
- Thus the parent nodes will lose their
energy very soon compare to leaf nodes.
- In proposed the sink will move to the nodes
place to collect the data with in the partition.
- Thus we can avoid the energy of each
node in the network.
RESULTS:
- To prove that our proposed approach is
efficient the results are calculated and
compared for the energy loss of the
nodes.
 ALGORITHMIC DESIGN
MBCP problem:
Bw (V1, V2) = min ( w(V1), w(V2))
Subject to
1. (V1, V2) is a partition of V into non-empty
disjoints sets V1 and V2 such that sub-
graphs of G induced by V1 and V2 are
connected.
2. w(V1)=sum(Vs) in the the partition.
 TESTING PLAN
The test cases should be planned before
testing begins. Then as the testing
progresses, testing shifts focus in an attempt
to find errors in integrated clusters of
modules and in the entire system.
- Each module is tested seperately by unit
testing.
- The purpose is to exercise the different
parts of the module code to detect the errors.
Sensor Networks
 Outline

Introduction and Issues

Architecture and Applications
Localization
Routing and Intercommunication
MAC Layer Issues
Security Issues

12/09/21 Prasant Mohapatra 20

 What are Sensor Networks?
A group of wireless nodes or embedded devices
Collectively the nodes sense, collect, and
analyze data
The sensor nodes are small, low power,
inexpensive, and have high SNR.
The network usually consists of a large number
of dense nodes distributed at random
They can be deployed in any kind of terrain with
hostile environment; places where traditional
wired network cannot be deployed

12/09/21 Prasant Mohapatra 21

 Sensor Network Architecture

SINK
Internet/
Satellite

TASK
MANAGER

12/09/21 Prasant Mohapatra 22

 Sensor Node Architecture
Sensor nodes include a combination of
– Microelectromechanical systems (MEMS)
such as sensing devices, actuators, RF
components, and CMOS building blocks
– Low power computing and wireless
networking support

12/09/21 Prasant Mohapatra 23

 Architecture of a Sensor Node

Software

Processor
Sensing Trans-
A/D ceiver
Unit Memory

Battery Power

12/09/21 Prasant Mohapatra 24

 Applications of Sensor
Networks
Surveillance and security
Environmental monitoring
Transport monitoring
Precision agriculture
Smart spaces
Manufacturing and inventory control
Other specialized tasks

12/09/21 Prasant Mohapatra 25

 Operational Challenges
Ad hoc deployment: should be able to
discover the topology and self-configure
for intercommunication
Dynamically adapt to changes in topology
due to node failures and environmental
conditions
Automatic configuration/reconfiguration
Untethered for energy and communication

12/09/21 Prasant Mohapatra 26

 Localization Issues
What is Localization?
Why is it important?
Categorization
Some Localization Mechanisms
– GPS
– Beacon based ranging
– Range free methods

12/09/21 Prasant Mohapatra 27

 What is Localization?

A mechanism for discovering

spatial relationships between
objects

12/09/21 Prasant Mohapatra 28

 Why is Localization Important?
Sensor Network Data is typically
interpreted based on a sensor’s location
– report event origins
– giving raw sensor readings a physical context
Temperature readings  temperature map
– objects tracking
Enables data-centric network design
– assist with routing
– evaluate network coverage

12/09/21 Prasant Mohapatra 29

 Categorization [Bulusu’00]
Coarse-grained Localization
– Proximity to a given reference point
– E.g., Active Badge
Fine-grained Localization
– Coordinates estimation
E.g., Distance to a given reference point

12/09/21 Prasant Mohapatra 30

 Fine-Grained Localization
Ranging based methods
– Timing
– Signal Strength
– Directionality Based
Ranging free methods
– E.g.: Centroid based, DV-hop, APIT

12/09/21 Prasant Mohapatra 31

 Ranging (Distance Measuring)
Techniques
Time based methods
– Time of Arrival (ToA), TDoA
– Used with radio, IR, acoustic, ultrasound
Signal Strength
– Uses received signal strength indicator (RSSI)
readings and wireless propagation model
Directionality based
– Angle of Arrival (AoA) measured with directional
antennas or arrays

12/09/21 Prasant Mohapatra 32

 Timing
Time of flight of communication signal
Signal Pattern
– Global Positioning System
– Local Positioning System
– Pinpoint’s 3D-iD
Different modalities of communication
– Active Bat

12/09/21 Prasant Mohapatra 33

 Signal Strength
Attenuation of radio signal increases with
increasing distance
RADAR
– Wall Attenuation Factor based Signal
Propagation Model
– RF mapping

12/09/21 Prasant Mohapatra 34

 Directionality Based Fine-
Grained Localization
Small Aperture Direction Finding
– Used in cellular networks
– Requires complex antenna array
Disadvantages
– Costly
– Not a receiver based approach

12/09/21 Prasant Mohapatra 35

 Basic Concepts in Ranging
Trilateration

Triangulation
A B C
Sines Rule  
B sin a sin b sin c
b
a c C 2  A2  B 2  2 AB cos(c)
A C
Cosines Rule B 2  A2  C 2  2 BC cos(b)

Multi-lateration C 2  B 2  C 2  2 BC cos(a )

– Considers all available beacons

12/09/21 Prasant Mohapatra 36

 Localization Mechanisms
GPS
Beacon based ranging
Range free methods

12/09/21 Prasant Mohapatra 37

 Global Positioning System (GPS)
[Getting’93]
Started in 1973, built in 1993
Wide-area radio positioning system
Ranging-based method
– Using Timing of Arrival (ToA)

12/09/21 Prasant Mohapatra 38

 GPS System Architecture
Constellation of 24
NAVSTAR satellites
made by Rockwell
– Altitude: 10,900 nautical
miles
– Orbital Period: 12 hours
At least five satellites in
view from every point in
the Globe

12/09/21 Prasant Mohapatra 39

 How GPS Works
The basis of GPS is “trilateration" from satellites
Distance measuring based on ToA
– accurate timing is important
Along with distance, you need to know exactly
where the satellites are in space
– High orbits and careful monitoring are the secret
Finally you must correct for any delays the signal
experiences as it travels through the atmosphere
– A Fourth satellite used for correction purpose

12/09/21 Prasant Mohapatra 40

 GPS Not Always Applicable

Many contexts you cannot have GPS on every

node
– form factor
– energy
– cost
– obstructions

 Beacon based approaches for sensor networks

 Ranging based v.s. ranging free

12/09/21 Prasant Mohapatra 41

 Beacon Based Location Discovery

Known Location
Unknown Location

12/09/21 Prasant Mohapatra 42

 Beacon Based Location Discovery

No need of GPS
No infrastructure support
– Ad hoc deployable
Use RSSI for measuring node separation
– But how should the beacons be placed?
Distributed Localization
– Iterative multilateration

12/09/21 Prasant Mohapatra 43

 Localization Approach

Single hop beaconing

Iterative multilateration
Dynamic estimate the
wireless channel parameters
Beacon
Can be done in conjunction
with routing

12/09/21 Prasant Mohapatra 44

 Advantages
Data packets also act as beacon signals
– Location discovery is almost free
Distributed
– relies on neighborhood information
Fault tolerant

However, Ranging still requires “expensive” circuits!

12/09/21 Prasant Mohapatra 45

 Range Free Methods
Centroid approach [Bulusu’00]
– Adaptive beacon placement [Bulusu’01]
– Self-configuring localization [Bulusu’03]
DV-hop [Niculescu’01]
– AoA approach [Niculescu’03]
APIT [He’03]

12/09/21 Prasant Mohapatra 46

 Centroid Based Approach
[Bulusu’00]
Multiple nodes serve as reference points
(Beacons)
Reference points transmit periodic beacon
signals containing their positions
Receiver node finds reference points in its range
and localizes to the intersection of connectivity
regions of these points

12/09/21 Prasant Mohapatra 47

 Model

12/09/21 Prasant Mohapatra 48

 Centroid Based Localization

 (Xest, Yest) = (avg(Xi1+…+Xik), avg(Yi1+…+Yik))

 k = No. of beacon nodes within connectivity range
 Xi1…Xik Yi1…Yik: Beacon nodes’ locations

Disadvantages
– Design using a idealized radio model with
perfect spherical radio propagation
– Assume a regular grid of nodes with known
location information to serve as Beacons
12/09/21 Prasant Mohapatra 49
 Impact of Beacon Placement

Beacons randomly placed: Beacons uniformly placed:

LARGER mean granularity SMALLER mean granularity

12/09/21 Prasant Mohapatra 50

 CONCLUSION
we proposed the use of graph partitioning
techniques to obtain smaller and balanced
sub-networks over which existing sink
placement techniques that are optimized
for small to medium scale WSNs.
 REFERENCES
S. Tilak, A. Murphy and W. Heinzelman,
"Non-Uniform Information Dissemination
for Sensor Networks,“.
http://users.sdsc.edu/~sameer/pubs/Same
er_Tilak.pdf.
S. R. Gandham et al., “Energy Efficient
Schemes for Wireless Sensor Networks
With Multiple Mobile Base Stations,”.
http://www.eecs.berkeley.edu/~dtse/ton_m
ob_final_3.pdf.