Indonesi
an
Journa
l
of El
ect
ri
cal Engineer
ing
an
d
Comp
ut
er
Scie
nce
Vo
l.
9
, No
.
2
,
Febr
ua
ry
201
8
,
pp.
306
~
310
IS
S
N:
25
02
-
4752
, DO
I: 10
.11
591/
ijeecs
.
v9.i
2
.
pp
306
-
310
306
Journ
al h
om
e
page
:
http:
//
ia
es
core.c
om/j
ourn
als/i
ndex.
ph
p/ij
eecs
Ex
t
re
m
ely Vib
rant Routi
ng Schem
e
f
or M
obile Ad
hoc N
etwork
S.
S
yes Ab
dul
Sy
ed
1
,
T.
Senthi
l Kum
aran
2
1
Resea
r
ch
Scho
l
ar,
D
epa
rtment
o
f
Inform
at
ion
Techn
olog
y
,
AM
ET
Univer
si
t
y
,
Ch
enna
i
2
As
socia
te Prof
essor,
Depa
r
tment
of
Com
pute
r
Scie
nc
e,
ACS
Co
ll
eg
e
of
Engi
n
eering,
B
angalore
Art
ic
le
In
f
o
ABSTR
A
CT
Art
ic
le
history:
Re
cei
ved
Oct
23
, 201
7
Re
vised
Dec
2
9
, 2
01
7
Accepte
d
Ja
n
20
, 2
01
8
Thi
s
pape
r
ai
m
s
to
improve
t
he
per
form
anc
e
of
the
tra
dit
io
nal
routi
n
g
protoc
ol
for
M
AN
ET
such
as
DS
R
and
AODV
in
te
rm
s
o
f
del
a
y
and
over
hea
d
.
The
proposed
routi
n
g
sche
m
e
is
calle
d
as
Ex
tre
m
e
l
y
Vibra
n
t
Routi
ng
(EVR)
which
adopt
s
with
the
highly
d
y
n
amic
envi
r
onm
ent
of
MA
NET.
The
link
residua
l
li
fe
i
s
esti
m
a
te
d
to
red
uce
the
li
nk
f
ailure
bef
or
e
forwardi
ng
data
through
a
nod
e.
Th
e
vel
o
ci
t
y
of
the
m
oving
m
ode
is
conside
red
whi
l
e
choosing
th
e
n
ext
forward
er
no
de.
Th
is
ena
b
le
s
the
EVR
to
dec
re
ase
the
d
ela
y
in
the
ne
twork.
Th
e
propose
d
routi
ng
sche
m
e
red
uc
es
routi
ng
over
he
a
d
and
red
uce
s
the
del
a
y
.
Thi
s
sche
m
e
red
uce
s
th
e
li
nk
fai
lur
e
too.
Th
e
per
form
anc
e is e
val
u
at
e
d
b
y
using t
h
e
sim
ula
ti
on
result
s
obta
in
ed
b
y
using NS2 sim
ula
tor.
Ke
yw
or
d
s
:
D
el
ay
L
ink
F
ai
lur
e
L
ink
R
esi
dual
L
ife
O
ve
r
head
V
el
ocity
Copyright
©
201
8
Instit
ut
e
o
f Ad
vanc
ed
Engi
n
ee
r
ing
and
S
cienc
e
.
Al
l
rights re
serv
ed
.
Corres
pond
in
g
Aut
h
or
:
S.
Syes
A
bdul
Syed,
Re
search
Sc
hola
r,
Dep
a
rtm
ent o
f
Inform
at
ion
Tec
hnol
og
y,
AMET
Un
i
versi
ty
,
Chen
nai
.
1.
INTROD
U
CTION
MANET
is
us
e
d
to
exc
ha
ng
e
the
in
f
or
m
at
ion
betwee
n
t
he
node
s
in
m
ov
i
ng
m
od
e.
The
m
ob
il
e
nodes
are
co
nnect
ed
by
wireless
li
nks
is
cal
le
d
as
m
ob
il
e
adh
oc
netw
ork.
T
he
node
s
in
MA
NE
T
are
aut
onomou
s
or
ind
e
pende
nt
node
.
T
he
m
ob
il
e
nodes
a
re
tra
ns
fe
rr
i
ng
t
he
in
f
orm
ation
with
ou
t
the h
el
p
of any
exter
nal
de
vices
su
c
h
as ro
uters
. Each
a
nd ev
e
ry nod
e i
n
MA
NET
is a
utonom
ou
s n
odes.
T
hey are act as re
la
y no
de
s to
s
uppor
t
the
tra
ns
m
issio
n
of
oth
e
r
nodes.
The
no
de
s
it
sel
f
act
as
transm
itter,
re
cei
ver
a
nd
r
ou
te
rs.
S
o,
the
node
s
in
MANET
cal
le
d
as
aut
onom
ou
s
no
des.
As
the
to
po
l
og
y
of
the
MANE
T
changes
dynam
i
cal
ly
,
the
MANET
is
cal
le
d
as
inf
ras
tructu
re
le
ss
ne
twork
.
The
li
nk
betwee
n
th
e
nodes
al
s
o
c
hanges
dynam
i
cal
ly
.
So
,
it
is
hard
t
o
transm
it
the
da
ta
to
the
no
de
in
a
hi
gh
l
y
dynam
ic
env
ir
on
m
ent.
T
rad
i
ti
on
al
ly
,
there
are
se
ve
ral
r
ou
ti
ng
protoc
ols
dev
el
op
e
d specific
al
ly
f
or MA
NET
su
c
h
as
DSR
, AO
D
V,
a
nd
D
SDV.
In
t
hat
the
Dy
nam
ic
So
ur
ce
Rou
ti
ng
(
DS
R
)
is
outpe
rform
s
than
the
A
dhoc
On
dem
a
nd
Dista
nc
e
vecto
r
(
A
ODV)
r
ou
ti
ng
protoc
o
l
in
te
rm
s
of
th
rou
ghput.
But
it
is
not
su
it
a
ble
f
or
the
highly
dy
nam
ic
env
i
ronm
ent.
In
T
hak
a
re
et
al.,
(20
10),
th
e
auth
or
c
om
par
ed
a
nd
eval
uated
the
pe
rfor
m
ance
of
D
SR
a
nd
AOD
V
by
us
i
ng
t
he
rand
om
way
m
ob
il
it
y
m
od
el
as
a
m
ob
il
it
y
m
od
el
[1]
.
The
beh
a
vior
of
the
A
ODV
a
nd
DS
R
ha
s
stu
died
in
Kh
at
ta
k
et
al.,
(
2008)
[
2]
.
I
n
this
pa
pe
r,
the
a
uthor
analy
ses
the
pe
rfor
m
ance
ov
er
TCP
(Tr
a
ns
m
issi
on
Con
tr
ol
Protoc
ol)
com
m
un
ic
at
ion
prot
oco
l
and
Co
ns
ta
nt
Bi
t
Rate
(CBR)
traff
ic
m
od
el
.
The
ob
ta
ine
d
resu
lt
s
showe
d
that,
the
Packet
delivery
rati
o
is
hig
he
r
w
he
n
usi
ng
TC
P
an
d
C
BR
wh
il
e
the
de
la
y
is
high
f
or
TC
P
and
l
ow
for
C
BR
.
W
it
h
hi
gh
sp
eed
t
he
P
D
R
of
AODV
is
lower
t
han
t
he
PD
R
of
D
S
R.
The
auth
or
s
ha
ve
con
cl
ud
e
d
t
hat
the
AOD
V
a
nd
D
SR
is
ou
tperfo
rm
s
than
each
oth
e
r
w
it
h
d
if
fer
e
nt
tr
aff
ic
patte
rn
s
.
The
perform
ance
of
A
O
DV
a
nd
D
SR
is
ana
ly
sed
in
the
hi
gh
ly
dynam
ic
env
i
ronm
ent
lik
e
VANE
T
in
So
m
et
al
.,
(2
01
2)
[
3]
.
The
authors
detect
ed
that,
the
A
ODV
pro
vid
e
s
bette
r
throu
ghpu
t
tha
n
the
D
SR
bu
t
the
pac
ket
loss
is
high
f
or
A
D
OV.
I
n
Sa
pna
et
al.,
(
2009
),
t
he
aut
hor
a
nal
yse
s
the
pe
rform
ance
of
A
ODV
an
d
DS
R
by
us
i
ng
Networ
k
sim
u
la
tor
NS2
with
Ra
ndom
way
po
i
nt
m
ob
il
ity
m
od
el
[4]
.
Th
e
AODV,
DSR
an
d
Evaluation Warning : The document was created with Spire.PDF for Python.
Ind
on
esi
a
n
J
E
le
c Eng &
Co
m
p
Sci
IS
S
N:
25
02
-
4752
Ext
remely Vi
br
an
t
Ro
utin
g Sc
hem
e
for
Mobi
le
Adho
c
Net
work (S
. Syes A
bdul
Sye
d)
307
DSDV
r
ou
ti
ng
protoc
ols
are
analy
sed
a
nd
di
ff
ere
nt
pa
ram
et
ers
are
c
om
par
ed
i
n
Ta
ks
a
nde
e
t
al.
,
(
2011)
[5
]
.
In
that,
t
he
aut
hor
sai
d
that,
al
l
the
ro
utin
g
protoc
ols
are
pe
rfor
m
ed
well
unde
r
TCP
co
nn
ect
io
n
rat
her
than
UDP
be
cause
of
retra
ns
m
iss
ion
is
not
ava
il
able
in
U
DP.
Sec
ur
e
a
nd
Eff
ic
ie
nt
Dista
nce
E
ff
ect
R
outi
ng
Algorithm
fo
r
Mob
il
it
y
(S
E_
D
REAM
)
in
MANET
s
is
descr
ibe
d
in
[6
]
.
In
or
der
to
pr
ov
i
de
the
secu
red
dat
a
transm
issi
on
a
nd to red
uce
bl
ack
ho
le
att
ack
s
Pr
e
ve
ntion o
f
Co
-
operati
ve
Bl
ack Hole at
ta
ck
in
Manet
on
DS
R
protoc
ol
us
in
g
Crypto
gr
a
phic
Algorithm
is
pr
op
os
ed
in
[7
]
.
Ach
ie
vi
ng
E
E
wit
hout
sacrif
ic
ing
the
qual
it
y
of
serv
ic
e
(
Q
oS)
is
increasin
gly
im
po
rtant
for
m
ob
il
e
de
vices.
We
first
der
i
ve
the
data
rate
thr
ough
zer
o
f
orci
ng
(ZF) an
d
t
hr
ee
li
near
pr
ec
od
i
ngs: m
axi
m
u
m
r
at
io tran
sm
issio
n (MR
T)
, ze
r
o
f
orci
ng (ZF)
,
and m
ini
m
u
m
m
ean
sq
ua
re
e
r
r
or
(
MM
SE).
Pe
rfo
rm
ance
EE
can
be
achie
ve
d
when
al
l
a
vaila
ble
anten
nas
are
us
ed
an
d
whe
n
ta
kin
g
acc
ount
of
the
c
onsum
pt
ion
ci
rc
uit
powe
r
igno
red
becau
se
of
hi
gh
tra
ns
m
it
po
wer.
The
ai
m
of
thi
s
work
is
t
o
de
m
on
strat
e
how
to
obta
in
m
axi
m
u
m
EE
wh
il
e
m
ini
m
izin
g
powe
r
co
nsum
ed,
wh
ic
h
achi
eves
a
high
data
rate
by
der
i
ving
th
e
op
ti
m
al
nu
m
ber
of
ante
nna
s
in
the
dow
nlink
m
assive
MIM
O
syst
em
.
This
syst
e
m
includes
no
t
on
ly
th
e
transm
itted
powe
r
but
al
so
the
f
undam
ental
op
e
rati
on
ci
rcu
it
powe
r
at
the
transm
itter sig
nal
[
8].
2.
PROP
OSE
D WOR
K
The
MA
NET
consi
sts
of
a
ut
onom
ou
s
m
ob
il
e
no
des
c
on
nected
by
wir
el
ess
li
nk
to
e
xch
a
nge
the
inf
or
m
at
ion
.
A
s
the
to
polo
gy
of
t
he
netw
ork
cha
ng
es
dy
na
m
ic
al
l
y,
the
li
nk
bet
ween
th
e
nodes
al
so
c
hanges
fr
e
qu
e
ntly
.
Th
e
node
tra
ns
m
i
ts
the
inf
or
m
ation
to
t
he
in
de
nted
destinat
io
n
di
rectl
y
if
the
destinat
io
n
is
in
th
e
transm
issi
on
ra
ng
e
of
t
he
sour
ce
node.
If
the
destinat
io
n
is
present
ou
t
of
t
he
tran
sm
issi
o
n
ra
ng
e
i
n
the
sense
the
s
ource
node
transm
it
via
interm
ediat
e
relay
nodes.
The
m
ob
il
e
node
i
tse
lf
act
s
as
re
la
y
n
ode.
The
r
e
are
m
any
routing
protoc
ols
are
avail
able
f
or
MANET
.
All
the
tra
diti
on
al
routin
g
prot
oc
ols
are
bu
il
t
the
r
oute
befor
e
tra
ns
m
itti
ng
the
data
to
the
destinat
ion.
So
,
the
re
is
a
chan
ce
to o
cc
ur
a
li
nk
fail
ur
e in
MANE
T.
D
ue
to
li
nk
fail
ure
in
t
he
net
wor
k,
th
e
data
ne
ver
re
aches
the
destinat
ion.
A
fter
t
hat,
the
s
ource
node
r
eco
ns
tr
uc
ts
the
route
to
tra
nsm
it
the
data.
I
t
causes
delay
and
r
ou
ti
ng
over
hea
d
in
M
AN
E
T.
T
o
overco
m
e
this,
this
pa
pe
r
pro
po
ses
a
no
vel
r
ou
ti
ng
sc
hem
e
is
cal
le
d
as
Extrem
el
y
Vibran
t
Ro
utin
g
sc
hem
e
(EV
R).
T
he
E
VR
schem
e
add
it
io
nally
u
s
es the li
nk
resi
du
al
li
fe
to
c
on
struct the
ro
ute.
T
he
E
VR
sel
ec
t
the
ne
xt
f
orw
ard
e
r
node
bas
ed
on
the
li
nk
resid
ual
li
fe
a
nd
the
vel
ocity
of
t
he
node
.
In
EVR,
the
s
ource
node
fin
ds
the
li
st
of
nei
ghbor
node
.
A
nd
t
he
n
ch
oose
s
the
nex
t
forwarde
r
node
bas
ed
on
the
li
nk
resid
ua
l
li
fe
an
d
t
he
distance
t
o
t
he
destinat
io
n.
T
he
s
ource
no
de
it
sel
f
does
not
know
the
e
ntire
r
out
to
reach
the
destinat
io
n.
I
n
the
propose
d
schem
e,
the
interm
ediat
e
relay
node
is
al
so
respo
ns
ible
to
reconstr
uct
the
ro
ute
fail
ure.
Moreover,
th
ere
is
no
cha
nce
of
li
nk
fa
il
ur
e
in
the
propose
d
schem
e
wh
y
because
the
li
nk
resid
ual
li
fe
is
al
so
con
si
der
e
d
w
hile
con
st
ru
ct
in
g
the
route.
The
de
la
y
is
red
uced
in
th
e
routin
g
schem
e
by
con
side
ri
ng
the
dista
nce
between
the
c
urren
t
no
de
an
d
the
destinat
ion
node.
T
he
pro
posed
routin
g
schem
e
prov
i
des
the
cho
ic
e
of
ne
xt
fo
r
warder
no
de.
T
he
reli
abi
li
ty
is
ensu
re
d
by
reducin
g
the
li
nk
fail
ur
e i
n
t
he n
et
work. T
he fo
ll
ow
in
g bloc
k diag
ram
ex
plains t
he pr
opos
e
d
sc
hem
e v
ery
well
.
Figure
1
e
xp
la
ins
the
c
oncep
t
of
pro
posed
r
ou
ti
ng
sc
hem
e
that
is
the
i
nterm
ediat
e
pr
oc
ess
bet
wee
n
the
s
ource
node
an
d
destinat
i
on
no
de
t
o
tra
nsm
it
the
data.
I
n
Fi
gure.
1,
the
so
urce
node
in
te
nd
s
to
t
rans
m
it
the
data
to
the
destinat
ion
no
de.
S
o,
init
ia
ll
y,
the
so
urce
no
de
fi
nd
s
out
the
no
des
w
hich
a
re
in
their
tra
ns
m
i
ssio
n
range
to
f
or
m
the
neig
hbor
li
st.
First,
it
check
s
that,
w
het
her
the
destina
ti
on
node
is
pr
esent
in
the
ne
ighbor
li
st
or
not.
I
f
it
is
pr
esent
i
n
the
se
ns
e
,
it
will
forw
a
rd
the
data
to
t
he
destinat
io
n
directl
y.
Othe
r
wise,
it
searche
s fo
r
th
e b
est
for
ward
er
node
i
n
the
neig
hbor li
st b
y usin
g
t
he
f
ollow
i
ng w
ay
.
The
li
nk
resid
ua
l
li
fe
is
de
fine
d
as
t
he
durati
on
at
w
hich
th
e
li
nk
e
xists
be
tween
t
he
node
s.
T
he
LR
L
is cal
culat
ed
by
u
sin
g
t
he
f
ollow
i
ng for
m
ula:
=
(1)
Dista
nce
ind
ic
at
es
that
the
neighbor
(r
el
ay
)
node
needs
to
m
ov
e
to
get
ou
t
of
ra
ng
e
of
the
so
urce
node
.
The
relat
ive v
el
ocity
is u
se
d
to
f
i
nd the
d
i
recti
on
of the m
ov
in
g node.
T
he
relat
ive v
el
ocity
is cal
culat
ed by
=
⁄
(2)
The
distance
be
tween
th
e
no
de
an
d
th
e
dest
inati
on
s
houl
d
be
in
th
e
dec
re
asi
ng
m
ann
er
to
bec
om
e
a
nex
t
f
orwa
rd
e
r
node.
T
he
pr
opos
e
d
r
ou
ti
ng
schem
e
red
uc
es
the
routin
g
ov
e
r
head
by
r
edu
ci
ng
li
nk
f
ai
lure.
The
r
ou
ti
ng
de
la
y
al
so
red
uc
ed
in
the
net
work.
This
ha
ve
bee
n
analy
sed
by
us
i
ng
t
he
sim
ulatio
n
resu
lt
s
ob
ta
ine
d by t
he
n
et
w
ork
sim
ulator
NS2
.
Evaluation Warning : The document was created with Spire.PDF for Python.
IS
S
N
:
2502
-
4752
Ind
on
esi
a
n
J
E
le
c Eng &
Co
m
p
Sci,
Vol
.
9
,
No.
2
,
Fe
br
uary
201
8
:
306
–
310
308
Figure
1
.
Bl
oc
k
Diag
ram
of
the
P
r
opos
e
d
S
chem
e
EVR
3.
RESU
LT
A
N
D DIS
CUSSI
ON
The
sim
ulati
on
is
done
by
us
in
g
the
sim
ulator
NS2.
N
et
work
sim
ula
tor
is
a
discre
te
even
t
ti
m
e
dr
i
ven
sim
ulato
r
.
NS2
is
op
e
n
source
s
of
t
w
are
w
hich
us
e
s
C+
+
and
To
ol
Com
m
and
Lan
gu
a
ge
(TC
L)
f
or
si
m
ulati
on
.
C+
+
is
us
e
d
f
or
pack
et
process
ing
a
nd
fast
t
o
run.
TCL
is
use
d
f
or
sim
ula
ti
on
descr
i
p
ti
on
a
nd
us
e
d
to
m
anipu
la
te
existi
ng
C+
+
ob
j
e
ct
s.
I
t
is
faster
to
ru
n
an
d
cha
ng
e
.
NS2
is
widely
us
ed
to
sim
ul
at
e
the
netw
orkin
g
c
oncepts
. T
he
si
m
ula
ti
on
para
m
et
er u
sed
in
the sim
ulati
on
is tab
ulate
d below
:
21
node
s
are
di
stribu
te
d
in
th
e
si
m
ulati
on
a
rea
10
70
m
×746m
.
The
m
ob
il
es
are
m
ov
in
g
within
t
he
si
m
ulati
on
are
a
by
us
in
g
the
rand
om
way
mo
bili
ty
m
od
el
with
the
s
peed
5m
/s.
Each
and
eve
ry
node
ha
s
the
direct
li
nk
with
the
no
des
w
it
hin
the
ra
ng
e
250m
.
The
C
on
sta
nt
Bi
t
Ra
te
(CBR
)
tra
ffi
c
m
od
el
is
use
d
t
o
con
t
r
ol
the
tr
aff
ic
flo
w
in
the
netw
ork.
The
pe
rfo
rm
a
nce
or
the
pr
opos
e
d
sch
em
e
is
analy
sed
by
the
par
am
et
ers
thro
ug
hput,
Lin
k
durati
on
an
d
de
la
y.
An
d
the
perform
ance
is
evaluated
by
changin
g
the
m
ob
il
i
ty
m
od
el
su
ch
as
Ra
ndom
w
ay
point a
nd cit
y sec
ti
on
m
ob
il
it
y
m
od
el
.
The
th
rou
ghpu
t
ind
ic
at
es
that
the
a
m
ount
of
work
done
pe
r
unit
tim
e.
In
the
pro
posed
s
chem
e,
the
thr
oughput
in
dicat
es
that,
the
am
ou
nt
of
data
delivere
d
per
un
it
ti
m
e.
Figu
re
2
dem
on
strat
e
that
the
thr
oughput
of
EV
R
schem
e
i
n
MAN
ET.
T
he
End
to
E
nd
de
la
y
is
the
avera
ge
tim
e
ta
ken
by
the
data
pac
ket
to
reach
the
desti
nation.
Fig
ur
e
3
s
hows
the
grap
h
plo
tt
ed
be
tween
the
del
ay
s
occ
ur
in
t
he
destinat
io
n
ver
se
s
si
m
ulati
on
tim
e. L
ow
e
r
the
del
ay
ind
ic
at
es that t
he hig
h pe
rfor
m
ance of t
he pr
opos
e
d sc
hem
e.
Evaluation Warning : The document was created with Spire.PDF for Python.
Ind
on
esi
a
n
J
E
le
c Eng &
Co
m
p
Sci
IS
S
N:
25
02
-
4752
Ext
remely Vi
br
an
t
Ro
utin
g Sc
hem
e
for
Mobi
le
Adho
c
Net
work (S
. Syes A
bdul
Sye
d)
309
Fig
ure
2
.
Th
r
ough
pu
t
Fig
ure
3
.
En
d
t
o
E
nd
Delay
4.
CONCL
US
I
O
N
In
t
his
stu
dy,
a
novel
routin
g
sc
hem
e
is
pr
op
os
ed
to
a
dopt
t
he
r
outi
ng
protoc
ol
f
or
the
hi
gh
ly
dynam
ic
MAN
ET.
T
he
li
nk
r
esi
du
al
li
fe
an
d
velocit
y
of
t
he
m
ov
in
g
node
play
s
a
ve
ry
i
m
po
rtant
r
ole
wh
il
e
const
ru
ct
in
g
th
e
path
to
reac
h
the
destinat
io
n.
T
he
pro
pose
d
schem
e
ou
tp
erfor
m
s
than
the
existi
ng
sch
e
m
e
in
te
rm
s o
f
r
ou
ti
ng
ov
e
r
head,
delay
, r
el
ia
bili
ty
an
d l
ink fail
ure.
REFERE
NCE
S
[1]
A.
N.
Tha
k
are
a
nd
M.
Y.
Jos
hi,
“
Perform
anc
e
Anal
y
sis
o
f
AO
DV
&
DS
R
Routi
ng
Proto
col
s
in
Mobil
e
Ad
h
oc
Networks
,”
Ind
i
an
Journal
o
f
Co
mputer
Applicati
on
(
IJCA
)
,
2010
.
[2]
M.
A.
Khatt
ak
,
et
al
.
,
“
Chal
l
eng
ing
Ad
-
Hoc
Networks
under
Rel
ia
bl
e
&
Unrel
iable
Tr
ansport
with
Vari
able
Nod
e
Densit
y
,
”
Journ
al
of
Theoretical
and
App
li
ed
Inf
orm
ati
on
Techn
ology
,
2008.
[3]
D.
S.
Som
and
D.
Singh
,
“
Perform
anc
e
Anal
y
sis
and
Sim
ula
ti
on
of
AO
DV
,
DS
R
and
TORA
Routi
ng
Protocol
s
in
MA
NETs
,”
.
Int
e
rnational
Journ
al
of
Rece
n
t
Tec
hnology
and
En
gine
ering
(
IJR
T
E)
,
vol/
issue:
1(
3),
pp.
2277
-
387
8,
201
2
.
[4]
Sapna
S.
K
.
and
P.
R.
Desm
ukh
,
“
Com
par
ison
of
eff
e
ct
iv
ene
ss
o
f
AO
DV
,
DS
D
V
and
DS
R
Routi
ng
Protoco
ls
i
n
Mobile
AD
-
hoc
Networks
,”
Inte
rnational
Jour
nal
of
Information
Technol
ogy
and
Knowle
dge
Manage
ment
,
p
p.
499
-
502
,
2009
.
0
100
200
300
400
500
600
0
2
4
6
8
10
12
No.
of pa
ckets
received
Simulation
Time (ms)
Thr
oughp
ut Analy
sis
EVR
0
0,5
1
1,5
2
2,5
0
20
40
60
80
Dela
y (ms
)
Simulation
Time (ms)
End t
o End Dela
y
EVR
Evaluation Warning : The document was created with Spire.PDF for Python.
IS
S
N
:
2502
-
4752
Ind
on
esi
a
n
J
E
le
c Eng &
Co
m
p
Sci,
Vol
.
9
,
No.
2
,
Fe
br
uary
201
8
:
306
–
310
310
[5]
Ta
ksande
V.
K.
and
K.
D.
Kulat
,
“
Pe
rform
anc
e
Com
par
ison
of
DS
DV
,
DS
R,
A
OD
V
Protocol
with
IEEE
802
.
11
MA
C
for
Chai
n
Topol
og
y
for
Mobile
Ad
-
hoc
net
work
using
NS
-
2
IJC
A
,
”
2nd
Nati
onal
Conf
ere
nce
-
Comput
i
ng,
Comm
unic
ati
on
and
Sensor Ne
tw
ork
,
CCSN
,
201
1
.
[6]
Shanthi
H.
J
.
and
E
.
M.
An
it
a
,
“
Secur
e
an
d
Eff
i
ci
en
t
Dis
ta
nc
e
Eff
ect
R
outi
ng
Algori
th
m
fo
r
Mobili
t
y
(SE_DREAM
)
in
MA
NETs
,”
i
n
Proceedi
ngs
of
the
3rd
Inter
nati
onal
Symp
osium
on
Bi
g
Data
and
Clou
d
Computing
Chal
le
nges
,
pp.
65
-
8
0,
2016
.
[7]
Vennil
a
G
.
,
et
a
l.
,
“
Preve
nt
ion
o
f
Co
-
oper
ative
Bla
ck
Hole
a
t
ta
c
k
in
Mane
t
on
D
SR
protoc
ol
using
Cr
y
ptogr
aphic
Algorit
hm
,”
Inter
nati
onal Journal
of
Engi
n
ee
ring
and
Technol
og
y (
IJE
T)
,
vol/
issue:
6
(5),
pp.
2401
,
2014
.
[8]
A.
Salh,
et
a
l.
,
“
Maximizi
ng
E
ner
g
y
Eff
i
cienc
y
for
Consum
pt
ion
Circ
u
it
Pow
er
in
Dow
nli
nk
Mass
ive
MIM
O
W
ire
le
ss
Networks,
”
Indone
sian
Journal
of
E
lectric
al
Engi
n
ee
r
ing
and
Computer
Scienc
e
,
vol
/i
ss
ue:
7(2)
,
p
p
.
2977
-
2985
,
201
7
.
Evaluation Warning : The document was created with Spire.PDF for Python.