Channel Aware Routing in MANETs with Route Handoff

Sandra Chen, Haley Jones and Dhammika Jayalath

Ad-hoc On-demand Distance Vector (AODV) Routing Protocol

On-demand/reactive route discovery Single path identified RREQ contains:
Source IP address (constant) Source sequence number (freshness indicator) Broadcast ID (unique) Destination IP address (constant) Destination sequence number (last known) Hop-count (incremented at each intermediate node)

RREQ uniquely identified by Source Sequence Number and broadcast ID. Duplicate RREQs discarded.

AODV cont.
RREP generated when intermediate node has recent enough path to destination, or from destination node, itself. RREP contains: Source IP address (constant) Destination IP address (constant) Destination sequence number (last known) Hop-count (incremented at each node) Route expiration time (time for new route discovery) Duplicate RREPs discarded, except if same Destination Sequence Number but smaller Hop-Count.

AODV cont.
RERR packet generated by up-link node when link in active route breaks. RERR has:
Source IP address (constant) Destination IP address (constant) Destination sequence number (incremented from RREP) Hop-count =

New route discovery process required by source if it has remaining packets for destination

Ad-hoc On-demand Multipath Distance Vector (AOMDV) Routing Protocol

Similar to AODV, but with Multiple paths identified on each route discovery. Paths are loop-free and link-disjoint. Routing Table Entries: AODV:
Destination IP address Destination sequence number Next hop IP address Hop-count Entry expiration time

AOMDV:
Destination IP address Destination sequence number Advertised hop-count Route list: Next hop IP 1, hop-count 1 Next hop IP 2, hop-count 2 Entry expiration time

Multiple Link-Disjoint Paths

Shortcomings of AOMDV
Paths chosen based only on hop-count
Path stability and channel quality measures are ignored Tends towards paths with few, but long, hops close to breaking point

Channel fading conditions ignored and, therefore, unable to be exploited

Mobile-to-Mobile Channel Model

Required because both nodes in a link may be moving Simple: Uses individual node speeds rather than relative speeds Has a Rayleigh envelope Can define average fading duration (AFD) and average non-fading duration (ANFD)

Fading
6

Threshold

0 3

AFD & ANFD

AFD = fT
2 1 e q

ANFD = fT

2(1 + 2)

1 2(1 + 2)

Rth = = ratio of signal threshold to RMS power Rrms

fT

= maximum Doppler shift of transmitter

vR = = ratio of receiver velocity to transmitter velocity vT

ANFD as a Link Selection Metric

Decreases with increasing normalised threshold (indication of channel quality and node separation distance) Decreases with increasing (indication of node mobility) ANFD is a good indicator of link reliability use as METRIC

LMMSE Channel Prediction

x(n + k) =
i=1 M X

w(i)x(n i)

x(n + k) is the predicted signal at time n+k based on M incoming signal sample values up until time interval n w(i) is the prediction weight for the ith previous input signal sample value

x(n i) is the incoming signal sample value at time

interval n-i

Precalculate and tabulate w(i) indexed by Doppler shift and discrete time shift

Channel-Aware AOMDV Protocol

Use ANFD as measure of path lifetime/duration Path duration is defined as the minimum ANFD over all hops in the path

D , min ANFDh
1hH
Implemented by including node speed and direction in RREQ header

CA-AOMDV cont.
Comparison of Routing Table Entries:
AOMDV:
Destination IP address Destination sequence number Advertised hop-count Route list:
Next hop IP 1, hop-count 1 Next hop IP 2, hop-count 2

CA-AOMDV:
Destination IP address Destination sequence number Advertised hop-count Dmin Route list:
Next hop IP 1, hop-count 1, D1 Next hop IP 2, hop-count 2, D2

Entry expiration time

Entry expiration time Handoff dormant time

CA-AOMDV cont.
RREPs processed on basis of Destination sequence number, Advertised hop-count and Dmin Handoff dormant time
Amount of time a path should be marked as unusable after handoff Set equal to maximum AFD over all links in path

Path Handoff
Triggered by prediction of a forthcoming fade on one of the path links The node at the receiving end of the fading link initiates a handoff request via a HREQ packet HREQ includes: AFD, Source IP address, Destination IP address and Source sequence number

Path Handoff cont.

Avoidance of repeat HREQ via maintenance of a handoff table at each node, similar to routing table
Includes expiration time field to indicate when path is expected to again be available for use (out of fade)

A node forwards a valid HREQ unless it has an alternative path to the destination When a path has come out of its fade, it may be used again, saving on route discovery overhead, unless it has reached its expiry time

CA-AOMDV Summary
Route Discovery
ANFD and hop-count used to select stable, but reasonable length paths AOMDV chooses on hop-count only

Route Maintenance
Predicted signal strength used for handoff initiation AFD used to choose when to bring path out of dormancy

Theory
Average number of hops between 2 nodes, with transmission range R: S( 2 + ln(1 + 2)) = H . 3R Average number of hops before encountering broken link is N nodes in network

(H + 1)/2
With C connections at any time, and n neighbours, average number of connections over a given link is 2C H B= . nN

Single Link and Path Lifetimes

Link lifetime, Zl, has exponential distribution

`t fZ` (t) = `e
Assume a path with L i.i.d. links. Path lifetime, Zp, also has exponential distribution

fZp (t) = e

PL

k=1 k

`=1

L X

` = p e

pt

= Le

Lt

Expected Path Lifetime

E{Zp} =

Z
0

ptdt = 1 = 1 tpe p L

AOMDV Multiple Path System Lifetime

Assume all paths have L i.i.d. links. The AOMDV multiple path system lifetime is ZA. System is up as long as any of the Np paths are still up (though once down they are discarded)
Pr{ZA < t} = Pr {(Zp1 < t) (Zp2 < t) (ZpNp < t)} = (1 ept)Np = FZA (t).

Expected lifetime of AOMDV multiple path system ANFD

E{ZA} =
Np 1 Np X

p k=0

(1)Npk1

Np 1 k

1 . 2 (Np k)

Single Link and Path Downtimes

Link downtime, Yl, has exponential distribution

t FY` (t) = 1 e
Assume a path with L i.i.d. links. Path downtime, Yp, also has exponential distribution. The CA-AOMDV multiple path system downtime is

YC

CA-AOMDV Multiple Path System Downtime

The CA-AOMDV system is down only when all paths are down.
Pr{YC > t} = = 1 1 et

i=1 Np Y

Pr {Ypi > t} =

FYC (t) = 1 1 1 et

i=1 L Np

Np Y

k=1

L Y

FY` (t)
k

LNp

Expected System Downtime AFD

Np 1 Np L X E{YC } = (1)Npk1 k=0

Np 1 k

! L(Np k)1 X
i=0

(1)L(Npk)1i

L(Np k) 1 i

1 (L[Np k] i)2

CA-AOMDV Multiple Path System Lifetime

Pr(channel is in a fade) AFD = Level Crossing Rate Pr(channel is not in a fade) ANFD = Level Crossing Rate 1 Pr(channel is in fade) AFD = Pr(channel is in fade)

Probability that a path is down is the probability that at least one link is in a fade. Recall that a link signal strength has Rayleigh distribution, with parameter, .

CA-AOMDV Multiple Path System Lifetime cont.

Based on the Rayleigh distribution of the link gains, probability CA-AOMDV system in fade is
Pr(system in fade) =
Np Y

i=1

`=1

L Y

1e

L2

N p

So, if ZC is CA-AOMDV system lifetime

E{ZC } = 1 1e

L2
2

1 eL

Np

Np

E{YC }

AOMDV vs CA-AOMDV Multiple Path System Lifetimes

N =2
CAAOMDV to AOMDV lifetime ratio
p

N =6
CAAOMDV to AOMDV lifetime ratio
p

2 L=3 L=4 L=5 L=6

2 L=3 L=4 L=5 L=6

1.5

1.5

0.5

0.5

0 5

2 1 (dB)

0 5

2 1 (dB)

AOMDV vs CA-AOMDV Multiple Path System Lifetimes

N =2
CAAOMDV to AOMDV lifetime ratio
p

Np = 2, L = 1
8

2
CAAOMDV to AOMDV LIfetime Ratio

1.5

L=3 L=4 L=5 L=6

7 6 5 4 3 2 1

0.5

0 5

2 1 (dB)

0 25

20

15

threshold, (dB)

10

AOMDV vs CA-AOMDV Multiple Path System Lifetimes

N = 2, L = 1
p

N = 2, L = 1
p

350

20

Multiple Path System Lifetime

Multiple Path System Lifetime

300 250 200 150 100 50 0 25

CAAOMDV AOMDV

18 16 14 12 10 8 6 4 2

CAAOMDV AOMDV

20

15

(dB)

10

0 20

15

10

(dB)

Routing Control Overhead

A C 3H + 2 Nrq + CT NpAB = CT A(N + NpH) + 4 2 = CT C(N + NpH) + CT NpCB I
C = connections in the network T = average connection time = route discoveries per second per node pair N = node degree Np = number of saved paths Nrq = number of RREQ per path repair B = average number of paths over a breaking link
!

= average hop-count

Delay
d T + T Np A(tr + TMAC )(H + 1) A = A 2 + T NpANR(td + TMAC) + T ATMACH

C = dCT + T NpC(th + TMAC)I

+ T CNR(td + TMAC) + T CTMACH

d = delay due to route discovery from failed system tr = one-hop propagation time of RERR td = one-hop propagation time of a data packet th = one-hop propagation time of HREQ TMAC = channel occupation time due to MAC overhead I = expected number of hops to deliver HREQ

Packet Delivery Ratio

T (T C )q C = T

(T A )q =

q = probability that channel is free for transmission

Throughput vs Packet Rate

33% improvement at higher packet rates Choice of stable links in CA-AOMDV, plus handover fewer route discoveries

Throughput vs Mobility

~27% improvement at 7m/s (25km/h)

Delay vs Mobility

About 25% improvement at v = 2.5 m/s

Routing Overhead vs Mobility

18% improvement at v = 2.4m/s

Conclusions

Can improve AOMDV performance by

Taking into account channel conditions in addition to hopcount Using channel prediction to initiate path hand-off