exploitation of path diversity in cooperative multi-hop wireless networks dissertation committee...

Exploitation of Path Diversity in Cooperative Multi-Hop Wireless Networks

Dissertation Committee

Department of Electrical and Computing EngineeringUniversity of Delaware

Dr. CiminiDr. CottonDr. ShenDr. Morris

(ECE Department)(ECE Department)(CIS Department)(CERDEC)

CandidateChair

: Jonghyun Kim: Dr. Bohacek

Introduction and challenges Aggressive path quality monitoring

BSP Efficient path quality monitoring

LBSP Opportunistic forwarding

LBSP2, LOSP, LMOSP Conclusion and future work

Outline

Introduction and challenges

Mobility Modeling2004 ~ 2009

4 papers

Mobility Modeling2004 ~ 2009

4 papers

CooperativePath Diversity

2005 ~ present4 papers

CooperativePath Diversity

2005 ~ present4 papers

Channel Activity Analysis

2007 ~ 20091 paper

Channel Activity Analysis

2007 ~ 20091 paper

User Perceptual Quality

Evaluation2008 ~ 2009

0 paper

User Perceptual Quality

Evaluation2008 ~ 2009

0 paper

Application Traffic Identification & Modeling

2008 ~ 20111 paper

Application Traffic Identification & Modeling

2008 ~ 20111 paper

ResearchResearch

Routing Technique

Proactive(e.g., OLSR)

Reactive(e.g., AODV)



: Routing control packet transmission

: No transmission

Proactive


: Routing control packet transmission

: No transmission

Reactive


: data packet from transport layer

Reactive


Routing Technique



Single path(e.g., AODV)

Multiple paths(e.g., AOMDV)


Single path

B

A


Multiple paths

B

A


Routing Technique



Single path(e.g., AODV)

Multiple paths(e.g., AOMDV)

Cooperative path diversity

(BSP, LBSP, LOSP, LMOSP)


BA



BA

One possible path



BA

Another possible path



B

Many possible paths

A



B

Best path

A



Nodes are moving

Link quality varies

Best path varies

Path quality varies



Challenges How to define the path quality

based on channel conditions? How to monitor the time-varying

path quality to determine the best path cooperatively?

Overview


(BSP, LBSP, LOSP, LMOSP)

Aggressivepath qualitymonitoring

(BSP)

Efficientpath qualitymonitoring

(LBSP)


Opportunisticforwarding with

path qualities(LOSP, LMOSP)





Outline

Aggressive path quality monitoring

Objectives Define path quality Monitor path quality aggressively/ideally to

investigate maximally possible benefits offered by path diversity routing

Protocol proposed : BSP (best-select protocol)

Path quality Depends on channel conditions

(e.g., channel loss, SNR, transmit power)


Depends on protocol designer’s routing objectives Maximize the minimum SNR along the path

(max-min SNR) Maximize delivery probability Maximize throughput Minimize end-to-end delay Minimize total power Minimize total energy

Dynamic programming Achieves routing objectives

Jn,i = cost-to-go from node (n,i) to destination




Relay-set 3 Relay-set 2 Relay-set 1 Relay-set 0



0,1

1,1

1,2

2,1

2,2

3,1


src dst




src dst

0,1

1,1

1,2

2,1

2,2

3,1




0,1

1,1

1,2

2,1

2,2

3,1


30

20

J(1,1) = 30

J(1,2) = 20



0,1

1,1

1,2

2,1

2,2

3,1


30

20

J(1,1) = 30

J(1,2) = 20

J(2,1) = 2020



0,1

1,1

1,2

2,1

2,2

3,1


30

20

J(1,1) = 30

J(1,2) = 20

J(2,1) = 20

10

J(2,1) = 10

20



0,1

1,1

1,2

2,1

2,2

3,1


30

20

J(2,1) = 20

10

20



0,1

1,1

1,2

2,1

2,2

3,1





Jn,i Sn,in 1,, Jn 1,

Previous step’s cost-to-goStage information





0,1

1,1

1,2

2,1

2,2

3,1

J(1,1) = 30

J(1,2) = 2010

20

Sn,in 1,





0,1

1,1

1,2

2,1

2,2

3,1

J(1,1) = 30

J(1,2) = 2010

20

Jn 1,


Max-min SNR


maxn 1,j

minSNRn,in 1,j

, Jn 1,j


Max delivery probability

Jn,i fSNRn,in 1,In11 , B Jn 1,In11

1 fSNRn,in 1,In11 , B fSNRn,i

n 1,In12 , BJn 1,In12

. . .





n 1,In12 , BJn 1,In12

. . .


Jn 1,1 0. 8

Jn 1,2 0. 9

Jn 1,3 0. 7

In 11 2

In 12 1

In 13 3




n 1,In12 , BJn 1,In12

. . .


n,i

n-1,In-1(1)

n-1,In-1(2)

n-1,In-1(3)




n 1,In12 , BJn 1,In12

. . .


n-1,In-1(1)

n-1,In-1(2)

n-1,In-1(3)

n,i

Max throughput

Jn,i maxjmaxB|fSNR n,in1,j

,B PROB_THRESH minB, Jn 1,j


Min end-to-end delay

Jn,i minB Jn,iB


Jn,iB packet sizeB

Psucc Dn 1 T P fail

Psucc fSNRn,in 1,In11 , B

1 fSNRn,in 1,In11 , BfSNRn,i

n 1,In12 , B

Dn 1 fSNRn,in 1,In11 , BJn 1,In11

1 fSNRn,in 1,In11 , BfSNRn,i

n 1,In12 , BJn 1,In12

P fail 1 fSNRn,in 1,In11 , B1 fSNRn,i

n 1,In12 , B

#

Min total power

Jn,i minn 1,j 10SNR_THRESH Hn,i

n1,jN

10 Jn 1,j


Min total energy

Jn,iB, PTn,i 10PTn,i

10 packet size

B Psucc Dn 1 T P fail


Jn,i minB,PTn,i Jn,iB, PTn,i

Construction of relay-sets

0,1

1,1

1,2

2,1

2,2

3,1

AODV finds a traditional single path


Construction of relay-sets

0,1

1,1

1,2

2,1

2,2

3,1



Path quality monitoring

0,1

1,1

1,2

2,1

2,2

3,1

CIEREQ (channel info exchange request)CIEREP (channel info exchange reply)




0,1

1,1

1,2

2,1

2,2

3,1

CIEREQ

CIEREQ

: data frame



0,1

1,1

1,2

2,1

2,2

3,1

CIEREP

CIEREP

J2,1 , H2,1 3,1

J2,2 , H2,2 3,1

Path qualities between relay-set 3 and 2 are monitored



0,1

1,1

1,2

2,1

2,2

3,1

data

data



0,1

1,1

1,2

2,1

2,2

3,1

CIEREQ

CIEREQ



0,1

1,1

1,2

2,1

2,2

3,1

CIEREP

CIEREP

J1,1 , H1,1 2,1 , H1,1

2,2

J1,2 , H1,2 2,1 , H1,2

2,2




0,1

1,1

1,2

2,1

2,2

3,1

J2,1 J1,1 , J1,2 , H1,1 2,1 , H1,2

2,1

J2,2 J1,1 , J1,2 , H1,1 2,2 , H1,2

2,2 J2,1 J2,2

Assume that



0,1

1,1

1,2

2,1

2,2

3,1

data

data

Path qualities are monitored every packet transmission



0,1

1,1

1,2

2,1

2,2

3,1


Simulation UDelModels :

Urban city, mobility, channel models Numerical analysis

Ideally construct relay-sets and receive CIEREQ/CIEREP Packet level simulation

QualNet network simulator CBR traffic (1024 bytes per second)

Comparison between J

single and J diversity

J single : source’s J along the single path found initially J diversity : source’s J along the best path among all paths


Results : benefits of path diversity


2 4 6 8 100

5

10

15

20

25

30 SparseDense

2

4

6

8

10

2 4 6 8 100

SparseDense

2 4 6 8 100

5

10

15SparseDense

2 4 6 8 100

5

10

15 SparseDense

2 4 6 8 10100

101

102

103

104

SparseDense

2 4 6 8 10100

101

102

103

SparseDense

Max delivery prob. Max throughput

J di

vers

ity /

J si

ngle

Max-min SNR

J di

vers

ity —

J si

ngle

J di

vers

ity /

J si

ngle

Min power Min energyMin delay

J di

vers

ity /

J si

ngle

J di

vers

ity /

J si

ngle

J di

vers

ity /

J si

ngle

Results : path selection differences


2 4 6 8 100

0.2

0.4

0.6

0.8

1

Fra

ctio

n o

f re

lays

sh

ared

Minimum relay-set size

max-min SNRmax throughput

min total power min energy

min end-to-end delay max delivery probability

vs.

vs.vs.





Outline

Efficient path quality monitoring

Objectives Monitor path quality efficiently to

reduce overhead J broadcast, J-test, power control

Robust routing function Automatic path stretching and shrinking

Protocol proposed : LBSP (local BSP)

Path quality monitoring : J broadcast

0,1

1,1

1,2

2,1

2,2

3,1

JBC (J broadcast)




0,1

1,1

1,2

2,1

2,2

3,1


J0,10,1


0,1

1,1

1,2

2,1

2,2

3,1


JBC

JBC

J0,11,1 minSNR1.1

0,1, J0,10,1

J0,11,2 minSNR1.2

0,1, J0,10,1



0,1

1,1

1,2

2,1

2,2

3,1


JBC

JBC

J0,12,1 max1,j) min SNR2,1

1,j, J0,1

1,j


1,j, J0,1

1,j



0,1

1,1

1,2

2,1

2,2

3,1


JBC

JBC


2,j, J0,1

2,j



0,1

1,1

1,2

2,1

2,2

3,1


: best path

Next hop best node

arg maxn 1,j) min SNRn,1 n 1,j, J0,1

n 1,j

Path quality monitoring : J broadcast When this J-broadcast occurs?

When current best path quality degradation is experienced.


Jsrcdst Jsrc

dst Jthreshold or Jsrcdst Jmin

0,1

1,22,2

3,1

src dst

Jsrcsrc

Jsrc2,2 Jsrc

1,2Jsrc

dst

Path quality monitoring : J broadcast When this J-broadcast occurs?

When current best path quality degradation is experienced.


Jsrcdst Jsrc


Reference path quality for the first data frame

Path quality for the subsequent data frame


Path quality monitoring : J-test

Jsrcdst Jsrc


n-1,1

n-1,3

n-1,2

JBC

n,iJBCJBC

Jdstn,i maxn 1,j min SNRn,i

n 1,j, Jdst

n 1,j



Jsrcdst Jsrc


n-1,1

n-1,3

n-1,2n,i

Jdstn,i Jsrc

dstIf ,



Jsrcdst Jsrc


n-1,1

n-1,3

n-1,2

broadcast JBC

JBCrelay-set (n+1)

Avoid broadcasting lower path quality than Jsrcdst

n,i


Path quality monitoring : power control

Efficient path quality advertisement

Higher path qualityLower path quality

Higher powerLower power

n,1

n,3

n,2n+1,i

PRn 1,in,1 PRn 1,i

n,2 PRn 1,in,3



Efficient path quality advertisement

Higher path qualityLower path quality

Higher powerLower power

Exploit the “near-far” problem



PTn,i min MAX_POWER, Jdstn,i Jsrc

dst TARGET_POWER




dst TARGET_POWER

n,1

n,3

n,2n+1,i

PTn,1

PTn,2

PTn,3

17dBm

12dBm

10dBm

Jdstn,1 Jdst

n,2 Jdstn,3




dst TARGET_POWER

n,1

n,3

n,2n+1,i

PTn,1

PTn,2

PTn,3

17dBm

12dBm

10dBm

Jdstn,1 Jdst

n,2 Jdstn,3

JBC

JBC

JBC


Automatic path stretching and shrinking Stretching

0,1

1,1

1,2

2,1

2,2

3,1


A

: Current active best path



0,1

1,1

1,2

2,1

2,2

3,1


A



0,1

1,1

1,2

2,1

2,2

4,1


3,1

Relay-set 4


Automatic path stretching and shrinking Shrinking

0,1

1,1

1,2

2,1

2,2

3,1


: Current active best path



0,1

1,1

1,2

2,1

2,2

3,1




0,1

1,1

1,2

2,1

2,2

2,3



Numerical analysis : setting

source destination

50m 100m 100m 50m

relay-set 2 relay-set 1relay-set 3 relay-set 0


Numerical analysis : results

25 nodes per relay-set





0 10 20 30 40 50 60 703.5

4

4.5

5

5.5

6

6.5

7

7.5

8

Solid lineDashed line

: optimal: LBSP

Chips per symbol

Impr

ovem

ent

in S

NR

(dB

)

(J di

vers

ity —

J si

ngle)



Chips per symbol

Impr

ovem

ent

in S

NR

(dB

)

no power control and no J-test

no power control but with J-test

with power control but no J-test

with power control and J-test

0 10 20 30 40 50 60 700

1

2

3

4

5

6

7

8



Chips per symbol

Impr

ovem

ent

in S

NR

(dB

)

0 10 20 30 40 50 60 704.5

5

5.5

6

6.5

7

7.5

MAX_POWER – TARGET_POWER

5 dB7 dB

10 dB15 dB*20 dB

Efficient path quality monitoring Packet level simulation : setting

UDelModels : Urban city, mobility, channel models

Simulator : QualNet CBR traffic (1024 bytes per 50 ms for 5 min)

Indoor mobility Outdoor mobility

Scenario number # of nodes Scenario number # of nodes

1 64 1 64

2 128 2 128

3 256 3 256

4 512

5 1024

Efficient path quality monitoring Packet simulation : results

Pa

cke

t d

eliv

ery

rat

io

1 2 3 4 596

96.5

97

97.5

98

98.5

99

99.5

100

AODVAOMDVLBSP

confidence interval

# o

f n

ew

ro

ute

sea

rch

es

1 2 3 4 50

10

20

30

40

50

60

70

AODVAOMDVLBSP

En

d-t

o-e

nd

de

lay

(m

s)

1 2 3 4 55

1015202530354045

AODVAOMDVLBSP

J di

vers

ity —

J si

ngl

e

1 2 3 4 5-0.50

0.51

1.52

2.53

3.5

AODVAOMDV





Outline

Opportunistic forwarding Objectives

Compare opportunistic forwarding (OF) and deterministic forwarding (DF) to see if path diversity is better exploited by OF or DF. Without node mobility With node mobility

Protocol proposed LOSP (local opportunistic-select protocol) LMOSP (local monitoring-added OSP)

Opportunistic forwarding

How it works?

IN1

IN2T

IN3

: data frame

: transmitter: intended node

TIN


How it works?

IN1

IN2T

IN3


How it works?

IN1

IN2T

IN3

Priority : IN1 > IN2 > IN3


Agreement

IN1

IN2T

IN3

ACK

: overhearing


Agreement

IN1

IN2T

IN3

ACKACK

: overhearing


Agreement

IN1

IN2T

IN3

ACK

: overhearing

obstacle


List of priority nodes

pn

tnT

bn

Preferred node

Target node

Backup node

Priority : pn > tn > bnLPN = {pn, tn, bn}


List of priority nodes

T

Jdstpn Jdst

tn , SNRpnT SNRtn

T

Jdstbn Jdst

tn , SNRbnT SNRtn

T

pn

tn

bn

Preferred node

Backup node

Target node


Sequence of nodes Deterministic forwarding

(src, tn, tn, tn, tn, dst) Opportunistic forwarding

(src, tn, pn, pn, tn, dst) (src, tn, bn, pn, tn, dst) …


Bit-rate

bit-rateDF maxB

such that

fSNRTtn

, B THRESH

#

bit-rateOF maxB

such that

1 k pn or tn

1 fSNRTk , B THRESH

#

bit-rateDF bit-rateOF


Protocols to be compared Deterministic forwarding

LBSP (local best-select protocol) Efficient path quality monitoring, automatic path stretching and sh

rinking, route recovery

Opportunistic forwarding LOSP (local opportunistic-select protocol)

One time J broadcast to construct LPN for each route failure, no route recovery

Opportunistic forwarding with the path quality degradation detection LMOSP (local monitoring-added OSP)

Path quality monitoring is added like LBSP, mixture of OF and DF


Sequence of nodes Deterministic forwarding

(src, tn, tn, tn, tn, dst) Opportunistic forwarding

(src, tn, pn, pn, tn, dst) (src, tn, bn, pn, tn, dst) …


Radio modelP

acke

t er

ror

pro

bab

ilit

y

nominal

steepsteepest

shallowest

shallower

shallow

SNR (dB)-5 0 5 10 15 20 25

10-4

10-3

10-2

10-1

100

2 Mbps

Opportunistic forwarding Packet level simulation : setting

UDelModels : Urban city, mobility, channel models

Simulator : QualNet CBR traffic (512bytes per 50 ms for 5 min)

Outdoor mobility

Scenario number # of nodes

1 64

2 128

3 256

4 512

5 1024


Results : performance of the first data packet

1 2 3 4 51.5

2

2.5

3

3.5

4LBSPv2 LOSP LMOSP

nominalsteepsteepest

shallowershallow shallowest

1 2 3 4 51.5

2

2.5

3

3.5

4

1 2 3 4 51.5

2

2.5

3

3.5

4

scenario number

bit-

rate

(M

bps)

(no node mobility)


Results : performance of the first data packet



1 2 3 4 522

23

24

25

26

27

scenario number1 2 3 4 5

22

23

24

25

26

27

1 2 3 4 522

23

24

25

26

27

SN

R (

dB)

LBSPv2 LOSP LMOSP

(no node mobility)


Results : performance before the first route failure (node mobility involved)



scenario number

LBSPv2 LOSP LMOSP

1 2 3 4 51.5

2

2.5

3

3.5

1 2 3 4 51.5

2

2.5

3

3.5

bit-

rate

(M

bps)

1 2 3 4 51.5

2

2.5

3

3.5


Results : performance before the first route failure (node mobility involved)



scenario number

LBSPv2 LOSP LMOSP

SN

R (

dB)

1 2 3 4 522

24

26

28

30

1 2 3 4 522

24

26

28

30

1 2 3 4 522

24

26

28

30


Results : performance during the connection lifetime



scenario number

LBSPv2 LOSP LMOSP

pack

et d

eliv

ery

ratio

1 2 3 4 50.985

0.99

0.995

1

1 2 3 4 50.985

0.99

0.995

1

1 2 3 4 50.985

0.99

0.995

1





LBSPv2 LOSP LMOSP

Rou

te f

ailu

re r

ate


0

0.05

0.1

0.15

0.2

0.25

0.3

1 2 3 4 50

0.05

0.1

0.15

0.2

0.25

0.3

1 2 3 4 50

0.05

0.1

0.15

0.2

0.25

0.3





LBSPv2 LOSP LMOSP

Eff

icie

ncy


0.88

0.9

0.92

0.94

0.96

0.98

1

1 2 3 4 5

0.88

0.9

0.92

0.94

0.96

0.98

1

1 2 3 4 5

0.88

0.9

0.92

0.94

0.96

0.98

1

duration that user data packets are transmittedduration that any packet including overhead is transmittedEfficiency =


Conclusion Without mobility (e.g., stationary mesh network)

Opportunistic forwarding is preferred except for the overhead

With mobility Deterministic forwarding is preferred Path diversity is better exploited by deterministic

forwarding





Outline

Conclusions The significant benefits of path diversity are

possible using aggressive path quality monitoring.

Reducing overhead and advertising path quality efficiently are possible using the proposed novel techniques, still maintaining high benefits.

Path diversity is better exploited by deterministic forwarding with node mobility.

Conclusions and future work

Future work Estimate the dynamics of channel by observing

ongoing channel activity. Achieve fast estimation of link/path qualities

from the channel dynamic estimation. i.e., given the estimated current channel state,

estimate link/path qualities. Develop models of channel evolution.


Schedule


Date Task11/11/2011 11/20/2011∼ Packet level simulation11/21/2011 12/31/2011∼ Real channel measurement12/16/2011 12/31/2011∼ Develop models of channel

evolution01/01/2012 01/15/2012∼ Writing up all findings12/01/2011 01/31/2012∼ Proofreading the whole

thesis

Thanks

exploitation of path diversity in cooperative multi-hop wireless networks dissertation committee...

Documents

possible path introduction

exploitation of path

challenges single path

aodv single path

path qualities losp

lmosp slide

timevarying path quality

aomdv slide