Toward Reliable Data Delivery For Highly Dynamic Mobile Ad Hoc Networks

paltryboarpigSoftware and s/w Development

Nov 3, 2013 (4 years and 10 days ago)

60 views



Toward Reliable Data Delivery For Highly


Dynamic Mobile Ad Hoc Networks



ABSTRACT



This paper addresses the problem of delivering data packets for highly
dynamic mobile ad hoc networks in a reliable and

timely manner. Most
existing ad

hoc routing protocols are susceptible to node mobility, especially
for large
-
scale networks. Driven by this issue, we propose an efficient
Position
-
based Opportunistic Routing (POR) protocol which takes advantage
of the stateless property of geographic ro
uting and the broadcast nature of
wireless medium. When a data packet is sent out, some of the neighbor
nodes that have overheard the transmission will serve as forwarding
candidates, and take turn to forward the packet if it is not relayed by the
specific

best forwarder within a certain period of time. By utilizing such in
-
the
-
air backup, communication is maintained without being interrupted. The
additional latency incurred by local route recovery is greatly reduced and the
duplicate relaying caused by pac
ket reroute is also decreased. In the case of
communication hole, a Virtual Destination
-
based Void Handling (VDVH)
scheme is further proposed to work together with POR. Both theoretical
analysis and simulation results show that POR achieves excellent
perfo
rmance even under high node mobility with acceptable overhead and
the new void handling scheme also works well.



Architecture





R
R
e
e
a
a
s
s
o
o
n
n
s
s


f
f
o
o
r
r


t
t
h
h
e
e


p
p
r
r
o
o
p
p
o
o
s
s
a
a
l
l
:
:


T
T
r
r
a
a
d
d
i
i
t
t
i
i
o
o
n
n
a
a
l
l


t
t
o
o
p
p
o
o
l
l
o
o
g
g
y
y
-
-
b
b
a
a
s
s
e
e
d
d


M
M
A
A
N
N
E
E
T
T


r
r
o
o
u
u
t
t
i
i
n
n
g
g


p
p
r
r
o
o
t
t
o
o
c
c
o
o
l
l
s
s


(
(
e
e
.
.
g
g
.
.
,
,


D
D
S
S
D
D
V
V
,
,


A
A
O
O
D
D
V
V
,
,


D
D
S
S
R
R
)
)


a
a
r
r
e
e


q
q
u
u
i
i
t
t
e
e


s
s
u
u
s
s
c
c
e
e
p
p
t
t
i
i
b
b
l
l
e
e


t
t
o
o


n
n
o
o
d
d
e
e


m
m
o
o
b
b
i
i
l
l
i
i
t
t
y
y
.
.


O
O
n
n
e
e


o
o
f
f


t
t
h
h
e
e


m
m
a
a
i
i
n
n


r
r
e
e
a
a
s
s
o
o
n
n
s
s


i
i
s
s


d
d
u
u
e
e


t
t
o
o


t
t
h
h
e
e


p
p
r
r
e
e
d
d
e
e
t
t
e
e
r
r
m
m
i
i
n
n
a
a
t
t
i
i
o
o
n
n


o
o
f
f


a
a
n
n


e
e
n
n
d
d
-
-
t
t
o
o
-
-
e
e
n
n
d
d


r
r
o
o
u
u
t
t
e
e


b
b
e
e
f
f
o
o
r
r
e
e


d
d
a
a
t
t
a
a


t
t
r
r
a
a
n
n
s
s
m
m
i
i
s
s
s
s
i
i
o
o
n
n
.
.


O
O
w
w
i
i
n
n
g
g


t
t
o
o


t
t
h
h
e
e


c
c
o
o
n
n
s
s
t
t
a
a
n
n
t
t
l
l
y
y


a
a
n
n
d
d


e
e
v
v
e
e
n
n


f
f
a
a
s
s
t
t


c
c
h
h
a
a
n
n
g
g
i
i
n
n
g
g


n
n
e
e
t
t
w
w
o
o
r
r
k
k


t
t
o
o
p
p
o
o
l
l
o
o
g
g
y
y
,
,


i
i
t
t


i
i
s
s


v
v
e
e
r
r
y
y


d
d
i
i
f
f
f
f
i
i
c
c
u
u
l
l
t
t


t
t
o
o


m
m
a
a
i
i
n
n
t
t
a
a
i
i
n
n


a
a


d
d
e
e
t
t
e
e
r
r
m
m
i
i
n
n
i
i
s
s
t
t
i
i
c
c


r
r
o
o
u
u
t
t
e
e
.
.


T
T
h
h
e
e


d
d
i
i
s
s
c
c
o
o
v
v
e
e
r
r
y
y


a
a
n
n
d
d


r
r
e
e
c
c
o
o
v
v
e
e
r
r
y
y


p
p
r
r
o
o
c
c
e
e
d
d
u
u
r
r
e
e
s
s


a
a
r
r
e
e


a
a
l
l
s
s
o
o


t
t
i
i
m
m
e
e


a
a
n
n
d
d


e
e
n
n
e
e
r
r
g
g
y
y


c
c
o
o
n
n
s
s
u
u
m
m
i
i
n
n
g
g
.
.


O
O
n
n
c
c
e
e


t
t
h
h
e
e


p
p
a
a
t
t
h
h


b
b
r
r
e
e
a
a
k
k
s
s
,
,


d
d
a
a
t
t
a
a


p
p
a
a
c
c
k
k
e
e
t
t
s
s


w
w
i
i
l
l
l
l


g
g
e
e
t
t


l
l
o
o
s
s
t
t


o
o
r
r


b
b
e
e


d
d
e
e
l
l
a
a
y
y
e
e
d
d


f
f
o
o
r
r


a
a


l
l
o
o
n
n
g
g


t
t
i
i
m
m
e
e


u
u
n
n
t
t
i
i
l
l


t
t
h
h
e
e


r
r
e
e
c
c
o
o
n
n
s
s
t
t
r
r
u
u
c
c
t
t
i
i
o
o
n
n


o
o
f
f


t
t
h
h
e
e


r
r
o
o
u
u
t
t
e
e
,
,


c
c
a
a
u
u
s
s
i
i
n
n
g
g


t
t
r
r
a
a
n
n
s
s
m
m
i
i
s
s
s
s
i
i
o
o
n
n


i
i
n
n
t
t
e
e
r
r
r
r
u
u
p
p
t
t
i
i
o
o
n
n
.
.


H
H
e
e
n
n
c
c
e
e


a
a


m
m
e
e
t
t
h
h
o
o
d
d


f
f
o
o
r
r


R
R
e
e
l
l
i
i
a
a
b
b
l
l
e
e


D
D
a
a
t
t
a
a


D
D
e
e
l
l
i
i
v
v
e
e
r
r
y
y


f
f
o
o
r
r


H
H
i
i
g
g
h
h
l
l
y
y


D
D
y
y
n
n
a
a
m
m
i
i
c
c


M
M
o
o
b
b
i
i
l
l
e
e


A
A
d
d


H
H
o
o
c
c


N
N
e
e
t
t
w
w
o
o
r
r
k
k
s
s


i
i
s
s


r
r
e
e
q
q
u
u
i
i
r
r
e
e
d
d
.
.


E
E
X
X
I
I
S
S
T
T
I
I
N
N
G
G


S
S
Y
Y
S
S
T
T
E
E
M
M
:
:


T
T
w
w
o
o


k
k
n
n
o
o
w
w
n
n


s
s
y
y
s
s
t
t
e
e
m
m
s
s


a
a
r
r
e
e
:
:


G
G
e
e
o
o
g
g
r
r
a
a
p
p
h
h
i
i
c
c


r
r
o
o
u
u
t
t
i
i
n
n
g
g


(
(
G
G
R
R
)
)


u
u
s
s
e
e
s
s


l
l
o
o
c
c
a
a
t
t
i
i
o
o
n
n


i
i
n
n
f
f
o
o
r
r
m
m
a
a
t
t
i
i
o
o
n
n


t
t
o
o


f
f
o
o
r
r
w
w
a
a
r
r
d
d


d
d
a
a
t
t
a
a


p
p
a
a
c
c
k
k
e
e
t
t
s
s
,
,


i
i
n
n


a
a


h
h
o
o
p
p
-
-
b
b
y
y
-
-
h
h
o
o
p
p


r
r
o
o
u
u
t
t
i
i
n
n
g
g


f
f
a
a
s
s
h
h
i
i
o
o
n
n
.
.


N
N
o
o


e
e
n
n
d
d
-
-
t
t
o
o
-
-
e
e
n
n
d
d


r
r
o
o
u
u
t
t
e
e
s
s


n
n
e
e
e
e
d
d


t
t
o
o


b
b
e
e


m
m
a
a
i
i
n
n
t
t
a
a
i
i
n
n
e
e
d
d
,
,


l
l
e
e
a
a
d
d
i
i
n
n
g
g


t
t
o
o


G
G
R
R


s
s


h
h
i
i
g
g
h
h


e
e
f
f
f
f
i
i
c
c
i
i
e
e
n
n
c
c
y
y


a
a
n
n
d
d


s
s
c
c
a
a
l
l
a
a
b
b
i
i
l
l
i
i
t
t
y
y
.
.


G
G
r
r
e
e
e
e
d
d
y
y


f
f
o
o
r
r
w
w
a
a
r
r
d
d
i
i
n
n
g
g


i
i
s
s


u
u
s
s
e
e
d
d


t
t
o
o


s
s
e
e
l
l
e
e
c
c
t
t


n
n
e
e
x
x
t
t


h
h
o
o
p
p


f
f
o
o
r
r
w
w
a
a
r
r
d
d
e
e
r
r


w
w
i
i
t
t
h
h


t
t
h
h
e
e


l
l
a
a
r
r
g
g
e
e
s
s
t
t


p
p
o
o
s
s
i
i
t
t
i
i
v
v
e
e


p
p
r
r
o
o
g
g
r
r
e
e
s
s
s
s


t
t
o
o
w
w
a
a
r
r
d
d


t
t
h
h
e
e


d
d
e
e
s
s
t
t
i
i
n
n
a
a
t
t
i
i
o
o
n
n


w
w
h
h
i
i
l
l
e
e


v
v
o
o
i
i
d
d


h
h
a
a
n
n
d
d
l
l
i
i
n
n
g
g


m
m
e
e
c
c
h
h
a
a
n
n
i
i
s
s
m
m


i
i
s
s


t
t
r
r
i
i
g
g
g
g
e
e
r
r
e
e
d
d


t
t
o
o


r
r
o
o
u
u
t
t
e
e


a
a
r
r
o
o
u
u
n
n
d
d


c
c
o
o
m
m
m
m
u
u
n
n
i
i
c
c
a
a
t
t
i
i
o
o
n
n


v
v
o
o
i
i
d
d
s
s
.
.


G
G
P
P
S
S
R
R


(
(
a
a


v
v
e
e
r
r
y
y


f
f
a
a
m
m
o
o
u
u
s
s


g
g
e
e
o
o
g
g
r
r
a
a
p
p
h
h
i
i
c
c


r
r
o
o
u
u
t
t
i
i
n
n
g
g


p
p
r
r
o
o
t
t
o
o
c
c
o
o
l
l
)
)
,
,


t
t
h
h
e
e


M
M
A
A
C
C
-
-
l
l
a
a
y
y
e
e
r
r


f
f
a
a
i
i
l
l
u
u
r
r
e
e


f
f
e
e
e
e
d
d
b
b
a
a
c
c
k
k


i
i
s
s


u
u
s
s
e
e
d
d


t
t
o
o


o
o
f
f
f
f
e
e
r
r


t
t
h
h
e
e


p
p
a
a
c
c
k
k
e
e
t
t


a
a
n
n
o
o
t
t
h
h
e
e
r
r


c
c
h
h
a
a
n
n
c
c
e
e


t
t
o
o


r
r
e
e
r
r
o
o
u
u
t
t
e
e
.
.




D
D
e
e
m
m
e
e
r
r
i
i
t
t
s
s
:
:


H
H
o
o
w
w
e
e
v
v
e
e
r
r
,
,


G
G
R
R


i
i
s
s


v
v
e
e
r
r
y
y


s
s
e
e
n
n
s
s
i
i
t
t
i
i
v
v
e
e


t
t
o
o


t
t
h
h
e
e


i
i
n
n
a
a
c
c
c
c
u
u
r
r
a
a
c
c
y
y


o
o
f
f


l
l
o
o
c
c
a
a
t
t
i
i
o
o
n
n


i
i
n
n
f
f
o
o
r
r
m
m
a
a
t
t
i
i
o
o
n
n
.
.


I
I
n
n


t
t
h
h
e
e


o
o
p
p
e
e
r
r
a
a
t
t
i
i
o
o
n
n


o
o
f
f


g
g
r
r
e
e
e
e
d
d
y
y


f
f
o
o
r
r
w
w
a
a
r
r
d
d
i
i
n
n
g
g
,
,


t
t
h
h
e
e


n
n
e
e
i
i
g
g
h
h
b
b
o
o
r
r


w
w
h
h
i
i
c
c
h
h


i
i
s
s


r
r
e
e
l
l
a
a
t
t
i
i
v
v
e
e
l
l
y
y


f
f
a
a
r
r


a
a
w
w
a
a
y
y


f
f
r
r
o
o
m
m


t
t
h
h
e
e


s
s
e
e
n
n
d
d
e
e
r
r


i
i
s
s


c
c
h
h
o
o
s
s
e
e
n
n


a
a
s
s


t
t
h
h
e
e


n
n
e
e
x
x
t
t


h
h
o
o
p
p
.
.


I
I
f
f


t
t
h
h
e
e


n
n
o
o
d
d
e
e


m
m
o
o
v
v
e
e
s
s


o
o
u
u
t
t


o
o
f
f


t
t
h
h
e
e


s
s
e
e
n
n
d
d
e
e
r
r


s
s


c
c
o
o
v
v
e
e
r
r
a
a
g
g
e
e


a
a
r
r
e
e
a
a
,
,


t
t
h
h
e
e


t
t
r
r
a
a
n
n
s
s
m
m
i
i
s
s
s
s
i
i
o
o
n
n


w
w
i
i
l
l
l
l


f
f
a
a
i
i
l
l
.
.




H
H
o
o
w
w
e
e
v
v
e
e
r
r
,
,


t
t
h
h
e
e


m
m
e
e
t
t
h
h
o
o
d
d
o
o
l
l
o
o
g
g
y
y


G
G
P
P
S
S
R
R


r
r
e
e
v
v
e
e
a
a
l
l
s
s


t
t
h
h
a
a
t
t


i
i
t
t


i
i
s
s


s
s
t
t
i
i
l
l
l
l


i
i
n
n
c
c
a
a
p
p
a
a
b
b
l
l
e
e


o
o
f
f


k
k
e
e
e
e
p
p
i
i
n
n
g
g


u
u
p
p


w
w
i
i
t
t
h
h


t
t
h
h
e
e


p
p
e
e
r
r
f
f
o
o
r
r
m
m
a
a
n
n
c
c
e
e


w
w
h
h
e
e
n
n


n
n
o
o
d
d
e
e


m
m
o
o
b
b
i
i
l
l
i
i
t
t
y
y


i
i
n
n
c
c
r
r
e
e
a
a
s
s
e
e
s
s
.
.


P
P
R
R
O
O
P
P
O
O
S
S
E
E
D
D


S
S
Y
Y
S
S
T
T
E
E
M
M
:
:


I
I
n
n


t
t
h
h
i
i
s
s


p
p
a
a
p
p
e
e
r
r
,
,


a
a


n
n
o
o
v
v
e
e
l
l


P
P
o
o
s
s
i
i
t
t
i
i
o
o
n
n
-
-
b
b
a
a
s
s
e
e
d
d


O
O
p
p
p
p
o
o
r
r
t
t
u
u
n
n
i
i
s
s
t
t
i
i
c
c


R
R
o
o
u
u
t
t
i
i
n
n
g
g


(
(
P
P
O
O
R
R
)
)


p
p
r
r
o
o
t
t
o
o
c
c
o
o
l
l


i
i
s
s


p
p
r
r
o
o
p
p
o
o
s
s
e
e
d
d
,
,


i
i
n
n


w
w
h
h
i
i
c
c
h
h


s
s
e
e
v
v
e
e
r
r
a
a
l
l


f
f
o
o
r
r
w
w
a
a
r
r
d
d
i
i
n
n
g
g


c
c
a
a
n
n
d
d
i
i
d
d
a
a
t
t
e
e
s
s


c
c
a
a
c
c
h
h
e
e


t
t
h
h
e
e


p
p
a
a
c
c
k
k
e
e
t
t


t
t
h
h
a
a
t
t


h
h
a
a
s
s


b
b
e
e
e
e
n
n


r
r
e
e
c
c
e
e
i
i
v
v
e
e
d
d


u
u
s
s
i
i
n
n
g
g


M
M
A
A
C
C


i
i
n
n
t
t
e
e
r
r
c
c
e
e
p
p
t
t
i
i
o
o
n
n
.
.


I
I
f
f


t
t
h
h
e
e


b
b
e
e
s
s
t
t


f
f
o
o
r
r
w
w
a
a
r
r
d
d
e
e
r
r


d
d
o
o
e
e
s
s


n
n
o
o
t
t


f
f
o
o
r
r
w
w
a
a
r
r
d
d


t
t
h
h
e
e


p
p
a
a
c
c
k
k
e
e
t
t


i
i
n
n


c
c
e
e
r
r
t
t
a
a
i
i
n
n


t
t
i
i
m
m
e
e


s
s
l
l
o
o
t
t
s
s
,
,


s
s
u
u
b
b
o
o
p
p
t
t
i
i
m
m
a
a
l
l


c
c
a
a
n
n
d
d
i
i
d
d
a
a
t
t
e
e
s
s


w
w
i
i
l
l
l
l


t
t
a
a
k
k
e
e


t
t
u
u
r
r
n
n


t
t
o
o


f
f
o
o
r
r
w
w
a
a
r
r
d
d


t
t
h
h
e
e


p
p
a
a
c
c
k
k
e
e
t
t


a
a
c
c
c
c
o
o
r
r
d
d
i
i
n
n
g
g


t
t
o
o


a
a


l
l
o
o
c
c
a
a
l
l
l
l
y
y


f
f
o
o
r
r
m
m
e
e
d
d


o
o
r
r
d
d
e
e
r
r
.
.


I
I
n
n


t
t
h
h
i
i
s
s


w
w
a
a
y
y
,
,


a
a
s
s


l
l
o
o
n
n
g
g


a
a
s
s


o
o
n
n
e
e


o
o
f
f


t
t
h
h
e
e


c
c
a
a
n
n
d
d
i
i
d
d
a
a
t
t
e
e
s
s


s
s
u
u
c
c
c
c
e
e
e
e
d
d
s
s


i
i
n
n


r
r
e
e
c
c
e
e
i
i
v
v
i
i
n
n
g
g


a
a
n
n
d
d


f
f
o
o
r
r
w
w
a
a
r
r
d
d
i
i
n
n
g
g


t
t
h
h
e
e


p
p
a
a
c
c
k
k
e
e
t
t
,
,


t
t
h
h
e
e


d
d
a
a
t
t
a
a


t
t
r
r
a
a
n
n
s
s
m
m
i
i
s
s
s
s
i
i
o
o
n
n


w
w
i
i
l
l
l
l


n
n
o
o
t
t


b
b
e
e


i
i
n
n
t
t
e
e
r
r
r
r
u
u
p
p
t
t
e
e
d
d
.
.


P
P
o
o
t
t
e
e
n
n
t
t
i
i
a
a
l
l


m
m
u
u
l
l
t
t
i
i
p
p
a
a
t
t
h
h


a
a
r
r
e
e


e
e
x
x
p
p
l
l
o
o
i
i
t
t
e
e
d
d


o
o
n
n


t
t
h
h
e
e


f
f
l
l
y
y


o
o
n
n


a
a


p
p
e
e
r
r


p
p
a
a
c
c
k
k
e
e
t
t


b
b
a
a
s
s
i
i
s
s
,
,


l
l
e
e
a
a
d
d
i
i
n
n
g
g


t
t
o
o


P
P
O
O
R
R


s
s


e
e
x
x
c
c
e
e
l
l
l
l
e
e
n
n
t
t


r
r
o
o
b
b
u
u
s
s
t
t
n
n
e
e
s
s
s
s
.
.






MODULES
:


1.

Design of Mobile Ad hoc network


2.
Implementation of Position

based Opportunistic Routing


3.
Selection of opportunistic forwarding Node



4.

Virtual Destination

based Void Handling (VDVH) scheme
.


Module Description:


1.

Design of Mobile Ad hoc network

A
mobile ad
-
hoc network

(
MANET
) is a self
-
configuring infrastructure

less
network

of mobile devices connected by
wireless
.
Ad hoc

is Latin and
means "for this purpose. Each device
in a MANET is free to move
independently in any direction, and will therefore change its links to other
devices frequently. Each must forward traffic unrelated to its own use. The
primary challenge in building a MANET is equipping each device to
continuous
ly maintain the information required to properly route traffic.
Such networks may operate by themselves or may be connected to the larger
Internet
. MANETs are a kind of
wireless ad hoc networks

that usually has a
routable networking environment on top of a
Link Layer

ad hoc network.



2.

Implementation of Position

based Opportunistic Routing

The design of POR is based on geographic routing and opportunistic
forwarding. The nodes are assumed to be aware of their own location and
the positions of their direct
neighbors.

When a source node wants to transmit
a packet, it gets the location of the destination first and then attaches it to the
packet header. Due to the destination node’s movement, the multihop path
may diverge from the true location of the final des
tination and a packet
would be dropped even if it has already been delivered into the
neighborhood of the destination. To deal with such issue, additional check
for the destination node is introduced. At each hop, the node that forwards
the packet will che
ck its neighbor list to see whether the destination is within
its transmission range.


3.

Selection of opportunistic forwarding Node

A node located in the forwarding area satisfies the following two conditions:
1) it makes positive progress toward the destin
ation; and 2) its distance to
the next hop node should not exceed half of the transmission range of a
wireless node .so that ideally all the forwarding candidates can hear from
one another. The priority of a forwarding candidate is decided by its distance
to the destination. The nearer it is to the destination, the higher priority it
will get. When a node sends or forwards a packet, it selects the next hop
forwarder as well as the forwarding candidates among its neighbors. The
forwarding table is constructe
d during data packet transmissions and its
maintenance is much easier than a routing table.


4.

Virtual Destination

based Void Handling (VDVH) scheme


In order to enhance the robustness of POR in the network where nodes are
not uniformly distributed and larg
e holes may exist, a complementary void
handling mechanism based on virtual destination is proposed. To handle
communication voids, almost all existing mechanisms try to find a route
around. In order to enable opportunistic forwarding in void handling, whi
ch
means even in dealing with voids, we can still transmit the packet in an
opportunistic routing like fashion, virtual destination is introduced, as the
temporary target that the packets are forwarded to.



SYSTEM CONFIGURATION:


H/W Sy
stem Configuration:



Processor
-

Pentium

III




Spee
d

:

1.1
GHz



RAM

:

256 MB(min)



Har
d Disk :


20 GB



Floppy Drive
:

1.44 MB



Ke
y Board

:

Standard Windows Keyboard



Mous
e

:

Two or Three Button Mouse



Monit
or :

SVGA



S/W System Configuration:




Operating System


:

Windows XP



Front End



:

JAVA, RMI, SWING


CONCLUSION


In this paper, we address the problem of reliable data delivery in highly
dynamic mobile ad hoc networks. Constantly changing network topology
makes conventional ad hoc routing protocols incapable of providing
satisfactory performance. In the face of frequ
ent link break due to node
mobility, substantial data packets would either get lost, or experience long
latency before restoration of connectivity. Inspired by opportunistic routing,
we propose a novel MANET routing protocol POR which takes advantage of

th
e stateless property of geographic routing and broadcast nature of wireless
medium. Besides selecting the next hop, several forwarding candidates are
also explicitly specified in case of link break. Leveraging on such natural
backup in the air, broken rout
e can be recovered in a timely manner. The
efficacy of the involvement of forwarding candidates against node mobility,
as well as the overhead due to opportunistic forwarding is analyzed.
Through simulation, we further confirm the effectiveness and efficie
ncy of
POR: high packet delivery ratio is achieved while the delay and duplication
are the lowest.