ad hoc routing for multilevel power saving protocols matthew j. miller, nitin h. vaidya ad hoc...

Ad hoc Routing for Ad hoc Routing for Multilevel Power Saving Multilevel Power Saving ProtocolsProtocols

Matthew J. Miller, Nitin H. VaidyaMatthew J. Miller, Nitin H. Vaidya

Ad Hoc Networks 2008 January

University of Illinois at Urbana-Champaign, United States

OutlineOutline IntroductionIntroduction Relate WorksRelate Works Protocol DesignProtocol Design SimulationSimulation ConclusionsConclusions

IntroductionIntroduction The tradeoff between latency and The tradeoff between latency and

energy consumptionenergy consumption

IntroductionIntroduction GoalsGoals

– To design a routing protocolTo design a routing protocol Satisfy latency requirementSatisfy latency requirement Use Use kk power saving levels power saving levels

ContributionContribution– The ideal of heterogeneous power The ideal of heterogeneous power

saving protocols to support multiple saving protocols to support multiple power save statespower save states

Related WorksRelated Works

Related WorksRelated Works GAFGAF

– The node have location information The node have location information and form virtual gridsand form virtual grids

– The discovery processThe discovery process Most of the time one node remains Most of the time one node remains

activeactive The rest enter low power modeThe rest enter low power mode

Related WorksRelated Works SpanSpan

– All node enter power saving mode All node enter power saving mode except for elected coordinators.except for elected coordinators.

Related WorksRelated Works All related worksAll related works

– The node only be placed one or two The node only be placed one or two power saving statepower saving state

– This paper placed the node in This paper placed the node in kk power saving statespower saving states

Protocol DesignProtocol Design Multiple power saving levelMultiple power saving level

– To achieve an acceptable latency, To achieve an acceptable latency, while reducing the energy consumptionwhile reducing the energy consumption

k k power levelpower level– PSPS00…..…..PSPSk-1k-1

– PSPS00 means always power on means always power on– Provides different energy-latency Provides different energy-latency

tradeofftradeoff

Protocol DesignProtocol Design

Reference point Reference point

Protocol DesignProtocol Design AssumptionsAssumptions

– Each node is initialized with the time Each node is initialized with the time of previous reference point of previous reference point

– The node is added to the network, it The node is added to the network, it can learn the time of the previous can learn the time of the previous reference pointreference point

Protocol DesignProtocol Design The node keeps track of its power The node keeps track of its power

state as followstate as follow On every data and ACK packet a On every data and ACK packet a

node send, it attaches its current node send, it attaches its current power save statepower save state

Protocol DesignProtocol Design

PS0

PS1

PS2

PS3

A

B

C

DData arrival

Routing ProtocolRouting Protocol In NetworksIn Networks

– ((FF11,F,F22…..,F…..,Fmm) m flow) m flow– ((LL11,,LL22…..,…..,LLmm) Desired latency for flow) Desired latency for flow– Finding routes that minimize the Finding routes that minimize the

overall energy consumption is NP-overall energy consumption is NP-CompleteComplete

– Heuristics to address the problemHeuristics to address the problem Modify DSR (Dynamic Source Routing)Modify DSR (Dynamic Source Routing)

Routing ProtocolRouting Protocol Why DSR?Why DSR?

– AODVAODV The node have to collect the power The node have to collect the power

saving state on the pathsaving state on the path– OLSROLSR

The flooding is neededThe flooding is needed– Power save state changePower save state change– Link breakLink break

High overhead High overhead

Routing ProtocolRouting Protocol

B

A

S EF

H

J

D

C

G

IK

Z

Y

Represents a node that has received RREQ for D from S

M

N

L


B

A

S EF

H

J

D

C

G

IK

Represents transmission of RREQ

Z

YBroadcast transmission

M

N

L

node power_state S 1 E 2node power_state S 1 B 3


B

A

S EF

H

J

D

C

G

IK

Z

Y

M

N

L

node power_state S 1 B 3 A 0

node power_state S 1 E 2 F 4

node power_state S 1 B 3 H 0


B

A

S EF

H

J

D

C

G

IK

Z

Y

M

N

L

node power_state S 1 E 2 F 4 J 0

Delay Tdelay


B

A

S EF

H

J

D

C

G

IK

Z

Y

M

N

L

node power_state S 1 E 2 F 4 J 0

After Tdelay

node power_state S 1 C 3 G 0 K 2

node power_state S 1 B 3 C 0 G 5 K 3

Pick a better path

Routing ProtocolRouting ProtocolInput RREQ LIST

Latency

Output RREQ LIST

Latency Send RREP

Find the min cost in RREQ list

Routing ProtocolRouting ProtocolInput RREQ

LIST Latency

do when latency not

satisfy

decrease power save state on

the path The energy

cost if decrease power save

state

Route ReplyRoute Reply

B

A

S EF

H

J

D

C

G

IK

Z

Y

Represents links on path taken by RREP

M

N

L

SimulationSimulation Compare withCompare with

– Always OnAlways On– 802.11 PSM802.11 PSM– CS-ATIMCS-ATIM

ATIM Windows will be dynamically ATIM Windows will be dynamically extendedextended

– Multilevel PSMMultilevel PSM– Multilevel CS-ATIMMultilevel CS-ATIM

Simulation parameterSimulation parameter Ns-2Ns-2 ATIM windows 20msATIM windows 20ms BI 100msBI 100ms 1000m X1000m1000m X1000m CBR trafficCBR traffic

SimulationSimulation

Proposed protocol


Proposed protocol

Data transmission


k=2

Proposed protocol


k=2


k=3

ConclusionsConclusions The contributions of this paperThe contributions of this paper

– Handle Handle kk level power save state level power save state– Latency aware routing protocol Latency aware routing protocol

強力推薦 !!

ad hoc routing for multilevel power saving protocols matthew j. miller, nitin h. vaidya ad hoc...

Documents