giao thuc dinh tuyen trong wsn

7/23/2019 Giao thuc dinh tuyen trong WSN

1/21

Routing Protocols for SensorRouting Protocols for Sensor

NetworksNetworks

Presented by

Siva Desaraju

Computer Science

WM

An Application Specific Protocol Architecture for WirelessMicrosensor Networks

by

Anantha Chandrakasan, Wendi Rabiner Heinzelman, and HariBalakrishnan


2/21


3/21

%utline%utline &ntroduction

'ackground

#rc(itecture

%peration

#nalysis and Simulation

Results

Comparisions

Conclusion


4/21

&ntroduction&ntroduction

Sensor Network C(allenges) !imited communication bandwidt(

) !imited energy

Parameters *Design goals+)"ase of deployment

)System lifetime

)!atency

),uality)Neig(boring nodes may (ave same data

)"nd user cares about a (ig(er-level description of events


5/21

!"#C$ *!ow-"nergy #daptive

Clustering $ierarc(y+ .ec(ni/ues *to ac(ieve t(e design goals+

) Randomi0ed1 adaptive1 self-configuring cluster formation2

) !ocali0ed control of data transfers) !ow energy media access control *M#C+

) #pplication specific data processing1 suc( as data aggregation

and compression2


6/21

'ackgroundSome application specific protocols developed for MSN

Minimum .ransmission "nergy *M."+

)3or 4 nodes #1 ' and C1 # would transmit to node C t(roug( '

iff *".5 ) total transmit energy+

".5*d6d#'+ 7 ".5*d6d'C+ 8 ".5*d6d#C+)%nly consider transmitter energy1 neglects energy dissipation

of t(e receivers

Clustering

)Nodes send data to central cluster (ead

)Cluster (ead forwards data

)Cluster (ead (as to be (ig( energy node

)3i9ed &nfrastructure


7/21

!"#C$ Protocol #rc(itecture

#ssumptions

) #ll nodes can transmit wit( enoug( power to reac( t(e base

station if needed

) "ac( node (as computational power to support different

M#C protocols

) Nodes always (ave data to send

) Nodes located to eac( ot(er (ave correlated data


8/21

!"#C$ in brief #ll non-cluster (ead nodes transmit data to t(eir cluster (ead

Cluster (ead receives t(is data and performs signal processing

functions on t(e data and transmits data to t(e remote 'S

Nodes organi0e t(emselves into local clusters1 wit( one node as

cluster (ead


9/21

%peration

Divided into rounds

) Set-up p(ase

) Clusters are organized

) Steady p(ase

) Data transferred from nodes to cluster and on to BS


10/21

!"#C$ Step by Step

Cluster $ead Selection

) "ac( sensor elects itself to be cluster (ead at t(e beginning

of a round

) Nodes t(at (ave not already been cluster (eads recently1

may become cluster (eads

) Probability of becoming a cluster (ead is set as a function ofnodes: energy level relative to t(e aggregate energy

remaining in t(e network

) Average energy of nodes in each cluster X Number of

nodes in the network


11/21

!"#C$ Step by Step contd; Cluster Formation

) "ac( cluster (ead node broadcasts an advertisement message

*#D


12/21

3lowc(art


13/21

!"#C$ step by step contd; Steady State P(ase

) Nodes send data during t(eir allocated time slot

) %nce t(e cluster (ead receives all data it performs data

aggregation

) Resultant data is sent from cluster (ead to 'S *a (ig(

energy transmission+) ses transmitter based code assignment to reduce inter-

cluster interference

) Cluster (ead senses t(e c(annel before transmission

Steady p(ase complete


14/21

!"#C$-C>'S Cluster 3ormation ses a central control algorit(m to form clusters

) During setup p(ase eac( node sends its location and

energy level to 'S

) 'S assigns cluster (eads and clusters

) 'S broadcasts t(is information


15/21

#nalysis and Simulation sing ns

"9periment setup

) ?@@-node network) Nodes randomly distributed between *@1@+ and *?@@1?@@+

) 'S at location *A@1?BA+

) 'andwidt( of t(e c(annel ?Mbps

) "ac( data message A@@ bytes long

) Packet (eader A bytes

) Simple radio model


16/21

Results>!imited energy Simulations

!"#C$ distributes more data per unit energy t(an M." !"#C$-C delivers @E more data per unit energy t(an !"#C$


17/21

Results contd;

!"#C$ can deliver ?@ times t(e amount of effective data to 'Sas M." for t(e same number of node deat(s

'enefits of rotating cluster (eads is seen


18/21

Conclusions #dvantages

) %utperforms conventional routing protocols

) !"#C$ is completely distributed1 re/uiring no control

information from t(e base station

) Nodes do not need global topology information

Disadvantages

) Nodes must (ave data to send in t(e allotted time

) Perfect correlation is assumed1 w(ic( mig(t not be true always


19/21

ComparisionsSP&N !"#C$

DirectedDiffusion

%ptimal

Route No No Fes

Network!ifetime

Good


20/21

References An Application Specific Protocol Architecture for

Wireless Microsensor Networks by AnanthaChandrakasan, Wendi Rabiner Heinzelan, andHari !alakrishnan

"ner#y$efficient Counication Protocol forWireless Sensor Networks by AnanthaChandrakasan, Wendi Rabiner Heinzelan, andHari !alakrishnan %&""" 'ransactions on wireless

counications, (ol) *, no) +, ct -..-/


21/21

,uestions=CommentsH

.(anks

giao thuc dinh tuyen trong wsn

Documents