Академический Документы
Профессиональный Документы
Культура Документы
TamilSelviGnanasekaran1,
I.INTRODUCTION
A wireless sensor networks consists of number
of sensor nodes distributed over the geographical area.
The sensor nodes has the capability to work together
for collecting data, analyze them to avoid redundancy
and route them to the desired destination. The sensor
nodes are operated by battery power. The energy
consumption of the sensor node should be managed
intelligently in order to rise the lifetime of the
network. The collected data should be delivered to the
user with less amount of time delay. All sensor nodes
must forward the collected data to the base station
either directly or indirectly through the gateway by
means of routing algorithm. The routing protocols aim
on minimum energy consumption, low redundancy
and delay. Routing protocols are particularly intended
to concentrate on the mobile networks. It is of two
categories namely proactive routing protocol and
reactive routing protocol. The proactive routing
protocols keep track on routes to all destination. The
reactive routing protocols obtain routes on demand.
The failure of sensor nodes should not affect the
overall task of the whole network. Sensor network
routing protocols should be scalable ample to react to
its changing environment.
Architecture of sensor network is shown in
Fig.1. The sensor field consists of number of sensor
nodes. The node depicts high quality information on
Acoustic detection
2014 International Conference on Computer Communication and Informatics (ICCCI -2014), Jan. 03 05, 2014, Coimbatore, INDIA
Seismic Detection
Military surveillance
Inventory tracking
Medical monitoring
Smart spaces
Process Monitoring
Biomedical
Infrastructure security.
III ROUTING PROTOCOLS IN WIRELESS
SENSOR NETWORK
2014 International Conference on Computer Communication and Informatics (ICCCI -2014), Jan. 03 05, 2014, Coimbatore, INDIA
2014 International Conference on Computer Communication and Informatics (ICCCI -2014), Jan. 03 05, 2014, Coimbatore, INDIA
Routing
Prot
ocol
s
LEACH
SPIN
Energy
Aware
SPAN
Rumor
Routing
GAF
Classification
Energy
Consumption
Data
Aggregati
on
Scalabili
ty
Overhead
Data Delivery
Model
Network
lifetime
Optimal
Route
Hierarchical
,Destination
Initiated & Node
Centric
Flat , Source
Initiated & Data
Centric
Event Driven
High
Yes
Good
Low
Complex
query
Very Good
No
Limited
Yes
Limited
Low
Event Driven
Good
No
Low
Yes
Good
Moderate
Event Driven
Very Good
No
Hierarchical
&
Location Based
Flat&
Data
Centric
Hierarchical
&
Location Based
Flat/
Mobility
Based
Limited
Yes
Limited
High
Continuously
Good
No
Low
Yes
Good
Low
Good
Yes
Limited
No
Good
Moderate
Demand
Driven
Virtual Grid
Good
No
High
No
Limited
High
Event Driven
Limited
Yes
Hierarchical
Hierarchical
Limited
High
No
No
Limited
Good
High
Moderate
Cluster based
Chain Based
Limited
Very Good
Yes
Yes
Active
Threshold
Weight Based
Layered
approach
Continuously
Good
No
Good
Good
No
Yes
Moderate
No
Joint
Mobility
&
Routing
SMECN
PEGASI
S
APTEE
N
HEED
SEAD
Hierarchical
High
Yes
Good
High
Hierarchical
Hierarchical
Limited
Limited
Yes
Yes
Low
Moderate
CADR
Flat
N to 1
Multipat
h
Routing
SAR
Multipath
Limited/
Data Centric
Limited
Good
Moderat
e
Limited
Yes
Moderat
e
High
Convergecast
traffic model
Moderate
Yes
High
Yes
Limited
High
Continuously
Good
Yes
Limited
Yes
Limited
Low
Demand
Driven
Good
Yes
Directed
Diffusio
n
Low
2014 International Conference on Computer Communication and Informatics (ICCCI -2014), Jan. 03 05, 2014, Coimbatore, INDIA
2014 International Conference on Computer Communication and Informatics (ICCCI -2014), Jan. 03 05, 2014, Coimbatore, INDIA
[17]
[18]
[19]
[20]
[21]
[22]
[23]
[24]
[25]
[26]
[27]