0% found this document useful (0 votes)
57 views37 pages

Energy Aware Routing Protocol For Sensor Networks: Sheetal Agarwal

This document proposes an energy aware routing protocol called EGEAR for sensor networks. It summarizes that EGEAR creates a virtual grid to minimize the number of active sensor nodes. It forms hierarchical clusters within this grid and uses cluster heads to route queries to and collect data from targeted regions, improving energy efficiency and scalability compared to other protocols like GEAR. The document outlines the key components of EGEAR, including grid formation, cluster head selection, query dissemination and data collection.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
57 views37 pages

Energy Aware Routing Protocol For Sensor Networks: Sheetal Agarwal

This document proposes an energy aware routing protocol called EGEAR for sensor networks. It summarizes that EGEAR creates a virtual grid to minimize the number of active sensor nodes. It forms hierarchical clusters within this grid and uses cluster heads to route queries to and collect data from targeted regions, improving energy efficiency and scalability compared to other protocols like GEAR. The document outlines the key components of EGEAR, including grid formation, cluster head selection, query dissemination and data collection.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 37

Energy Aware Routing

Protocol for Sensor


Networks
Sheetal Agarwal
Agenda
Introduction to Sensor Networks
Sensor Network Vs Fixed and Ad-Hoc
Networks
Routing Protocols for Sensor Networks
Proposed Routing Protocol
Performance Metrics

Introduction to Sensor Networks
What is a Sensor?
A sensor is a device the produces a
measurable response to a change in
physical condition such as temperature or
chemical condition such as concentration

Types of Sensors - Temperature, Pressure,
Humidity, Image etc
Sensor Network Architecture
Sensor Nodes
Sink
Internet/Satellite
Task Manager
User
Sensors
Berkeley Mote
EmbedSense - Wireless
Sensor and Data
Acquisition System
Applications of Sensor Networks
Monitoring Applications
Military
Security
Intrusion Detection
Habitat Monitoring
Environment Observation and Forecasting

Sensor Vs Ad-Hoc Networks
Network topology is not fixed
Power is an expensive resource in
these networks
Nodes are connected by wireless links
Sensor Vs Ad-Hoc Networks
Large number of sensors
Addressing scheme for sensor nodes
Sensor network used for data gathering
Ad - Hoc network used for distributed
computing


Sensor Vs Ad - Hoc Networks

Data flows from multiple sources to a
single destination
Redundancy in data traffic
Sensor nodes are prone to failure



Classification of Routing Protocols
Data Centric Protocols
SPIN , Directed Diffusion
Hierarchical Protocols
LEACH , TEEN
Location Based Protocols
GAF , GEAR
Data Centric Routing
Address Centric Routing
Finding short routes between pairs of
addressable end nodes
Data Centric Routing
Perform in-network consolidation of
redundant data while routing from
source to the sink
Data Aggregation
Methods of Aggregation
Duplicate suppression
Aggregate functions like Avg,Min,Max etc

Data Aggregation Trees
Center At Nearest Source
Shortest Path Tree
Greedy Incremental Tree
Data Distribution
Flooding
Data packet is broadcasted by each node
to all its neighbors
Causes Implosion, Overlap & Resource
Blindness
Gossiping
Each receiving node sends the packet to a
randomly selected neighbor
No Implosion but takes more time
Hierarchical Protocols
When sensor density increases single
tier networks cause
Gateway overloading
Increased latency
Large energy consumption
Clustered Network allow coverage of large
area of interest and additional load without
degrading the performance
Hierarchical Protocols
Hierarchical routing
Uses Multi - hop communication within a
cluster
Performs data aggregation and fusion on
data to reduce number of transmitted
messages to the sink
Maintain the energy reserves of nodes
efficiently
Example - LEACH, PEGASIS
Location Based Protocols
Location information can be used to
Find shortest path to the sink
Form a virtual grid and keep only few
nodes active at a time
Example
GAF
GEAR
SPAN

Determining Location
Location of a node can be determined using
Global Positioning System
Ultrasonic Systems using trilateration
Beacons
Location based protocols assume that each
node knows its location in the network
GAF(Geographic Adaptive Fidelity)
Forms a virtual grid of the covered area
Each node associates itself with a point in the
grid based on its location
Nodes associated with same point in grid are
considered equivalent
Some nodes in an area are kept sleeping to
conserve energy
Nodes change state from sleeping to active
for load balancing
GAF
A node remains active for time Ta
Ta of a node in the grid is broadcasted to
other equivalent nodes
The sleeping time of a node is adjusted
depending on Ta
In the discovery state each node broadcasts
discovery messages periodically (Td)
State Transition for GAF
Sleeping
Discovery
Active
After Ts
After Ts
After Td
Routing in GAF
Base Station
GAF
Not very scalable. As the network size
increases distance to the base station
increases
Only the active nodes sense and report data.
Hence data accuracy is not very high.
GEAR (Geographically and Energy
Aware Routing)
Queries
Contain location information
Disseminated to only the specified region of the
network
Neighbors are selected probabilistically to
forward the query to the target location
Query is flooded only in the target region

GEAR
Each node maintains a neighbor table
Energy levels and locations of each neighbor
Cost to transmit to each neighbor
Packet is forwarded to neighbor with
smallest cost

GEAR
Base Station
Region of Interest
GEAR
Not Scalable

All nodes are active even though only a part
of the network is queried

Enhanced - GEAR (EGEAR)
Many applications require data on
demand
Not all nodes need to be active and
sensing data continuously
Few nodes can be active to keep the
network connected
Remaining nodes are activated when
data is required
Creating a Virtual Grid
Use location information to create a virtual
grid
All nodes in a grid are equivalent
Only one node from a grid point is active at a
time
Each node in a grid point is within the radio
range of nodes in adjacent grids
Once the virtual grid is created, hierarchical
clusters of these grids are created

Cluster Formation
Let N be the number of clusters that are
formed. For a given round a node becomes
cluster head if
Each node chooses a random number
between 0 and 1. Node becomes cluster
head if number less than
T(n) = P/((1-P * (r mod 1/P))) if n E G
= 0 otherwise
P - desired % of cluster heads, r round, G set of
nodes
that have not been cluster head for last 1/P rounds


Cluster Formation
Each cluster head broadcasts its
location information
Nodes join associate themselves with
the closest cluster head and inform the
cluster head of their decision
Query Dissemination
Each query consists of location
information
Base station forwards the query to the
cluster head closest to the target region
Each cluster head forwards the query to
the closest cluster head
Cluster head activates all nodes in the
in the target region
Data Collection
Each node transmits data to the cluster
head
The data is aggregated by the cluster
head
The aggregated data is then sent to the
base station using reverse path
Region of Interest
Base Station
EGEAR
Keeps minimum number of nodes active in
the network
Reduces the number of query packets
disseminated
Improves quality of data delivered
Scalable
Suitable for demand driven applications


Testing
Use Network Simulation tools like
Glomosim
Test with networks of 400-5000 nodes
Consider static sensor networks only
Determine optimal number of clusters
for a given network size

Performance Metrics
Average Energy Consumption
Impact of localization errors
Energy and time expended for cluster
formation
Network lifetime


Questions?

You might also like