Internati
o
nal
Journal of Ele
c
trical
and Computer
Engineering
(IJE
CE)
V
o
l.
6, N
o
. 2
,
A
p
r
il
201
6, p
p
.
78
5
~
79
1
I
S
SN
: 208
8-8
7
0
8
,
D
O
I
:
10.115
91
/ij
ece.v6
i
2.9
110
7
85
Jo
urn
a
l
h
o
me
pa
ge
: h
ttp
://iaesjo
u
r
na
l.com/
o
n
lin
e/ind
e
x.ph
p
/
IJECE
Designing and Simulation of
Surrounding Supporting Multicast
Routing Protocol
Shai
k
M
a
h
a
b
o
o
b
Ja
ni
, S
y
e
d
Um
ar,
P.
V.
R.
D Pr
as
ad
a
Ra
o,
Sri
d
e
v
i
Gut
t
a
Dept of CSE, K
L University
, Guntur, AP, India
Article Info
A
B
STRAC
T
Article histo
r
y:
Received Sep 30, 2015
Rev
i
sed
D
ec 20
, 20
15
Accepte
d Ja
n
9, 2016
In the Wireless sensor network
s
ha
ving of m
u
lti-hop transm
ission in the
Adhoc network
s
. These Adho
c networ
ks hav
i
ng advan
t
ages
of limited
bandwidth and
m
obilit
y which
i
s
m
o
re
useful fo
r the
chang
i
ng o
f
and usag
e
of various pro
t
ocols, so that these Adho
c networks hav
i
ng energ
y
conservation, simple to construct, robus
tness. In
this paper we ar
e proposing
a new proto
c
ol
cal
led Surroun
ding supporting
m
u
lticast
routi
ng protoco
l
[SSMR
P
]
.
This protocol uses th
e mesh
networks to enhance th
e resilience
against
chang
e
o
f
node.
This SSMRP u
tilizes the node lo
cal
it
y
w
h
ich redu
ces
the overhead of the route maintenance and it als
o
reduces the ro
ute for good
data tr
ansm
issions. In this paper we cl
ear
ly
ex
plains how the data will be
deliv
ered effi
ci
e
n
tl
y
b
y
redu
cing the
ov
erhe
ads
Keyword:
Netwo
r
k
lifeti
m
e
R
out
i
n
g pr
ot
oc
ol
s
W
i
reless tech
no
log
y
Copyright ©
201
6 Institut
e
o
f
Ad
vanced
Engin
eer
ing and S
c
i
e
nce.
All rights re
se
rve
d
.
Co
rresp
ond
i
ng
Autho
r
:
Sh
aik Mah
a
boo
b Jan
i
Dept
o
f
C
S
E
,
K L
U
n
i
v
e
r
si
t
y
, G
u
nt
u
r
,
AP,
I
ndi
a.
Em
a
il: sh
aik
2
s
ig
n
i
n@g
m
ai
l.co
m
1.
INTRODUCTION
In
th
e
W
i
reless sen
s
or n
e
twork
s
th
e Ad
ho
c network
s
will p
l
ay a
maj
o
r ro
le in
th
e co
llecti
o
n
o
f
th
e
m
obi
l
e
nodes
wi
t
h
t
h
e s
u
pp
o
r
t
of
fi
xe
d i
n
fr
ast
r
uct
u
re
whi
c
h co
nt
ai
ns sel
f
-
o
r
g
a
n
i
s
ed
no
des a
nd
pr
o
v
i
d
es bes
t
com
m
uni
cat
i
on p
r
ot
ocol
s
bet
w
een t
h
e n
ode
s i
n
any
en
vi
r
o
nm
ent
s
. The A
d
h
o
c
net
w
or
ks
are m
o
re im
p
o
rt
a
n
t
in classroom
s
because these
can sh
a
r
e the inform
ation dy
nam
i
cally
to
all the nodes
or com
puting de
vices.
Each
no
d
e
in
t
h
e
Adho
c
n
e
two
r
k
s
will acts as ro
u
t
er
wh
ich
can
estab
lish
t
h
e en
d to
end
co
mm
u
n
i
catio
n
s
. To
say th
at p
a
rticular n
e
two
r
k
is Adho
c n
e
t
w
ork
th
en
it h
a
s to satisfy th
e some u
n
i
qu
e ch
aracteristics lik
e d
e
sign
sh
ou
l
d
b
e
simp
le, rob
u
s
t
n
ess, go
od
m
e
m
o
ry cap
ab
ilities,
en
erg
y
con
s
ervatio
n
wh
en
it is u
s
ed
in
b
a
tteries. In
th
e Adho
c n
e
t
w
ork
t
h
e to
po
l
o
g
y
is in
h
e
ren
tly v
o
l
atile a
n
d
rou
ting
alg
o
rith
m
s
an
d
it sh
ou
ld
be robu
st ag
ain
s
t
t
h
e t
o
pol
ogy
w
h
ene
v
e
r
c
h
an
g
e
s.
The r
o
ut
i
ng
p
r
ot
ocol
s i
n
t
h
e Ad
h
o
c net
w
or
ks are
br
oa
dl
y
cat
egori
z
e
d
as t
h
ree t
y
p
e
s:
pr
oact
i
v
e
p
r
o
t
o
c
o
l
s,
activ
e p
r
o
t
o
c
o
l
s an
d
h
y
b
r
i
d
Pro
t
o
c
o
l
s. Th
e proactiv
e ro
u
t
i
n
g
p
r
o
t
o
c
o
l
s will
co
n
tinuo
usly
make
i
mmed
i
ate d
e
cisio
n
s
on
rou
tin
g to transmit th
e d
a
ta
to
th
e
nod
es. So
m
e
o
f
pro
t
o
c
o
l
s in which
th
is
im
pl
em
ent
e
d i
s
DS
D
V
[1]
,
WR
P
[2]
,
DB
F
[
3
]
.
R
eact
i
v
e
pr
ot
oc
ol
s a
r
e s
e
t
s
t
h
e
ro
ut
es
o
n
basi
s
of
nee
d
s som
e
of
t
h
e
pr
ot
oc
ol
s are R
D
M
A
R
[4]
,
A
O
D
V
[5]
,
AB
R
[6]
,
D
S
R
[7]
,
TOR
A
[
8
]
.
As base
d on
t
h
e di
rect
i
o
n o
f
t
h
e
r
o
ut
i
n
g
pr
ot
oc
ol
s
a
r
e of
t
w
o
t
y
pes
one
o
s
uni
cast
an
d ot
he
r
i
s
m
u
lt
i
cast
rout
i
ng
fo
r t
h
e ad
h
o
c net
w
o
r
ks
. I
n
t
h
i
s
p
r
o
p
o
sal
we use
d
t
h
e
m
u
lt
i
cast
rout
i
ng
pr
ot
oc
ol
[
9
]
,
[10]
.
These are a
g
ai
n cl
assi
fi
ed as
t
r
ee base
d an
d m
e
sh base
d pr
ot
oc
ol
s. I
n
t
h
i
s
we use
d
t
h
e
m
e
sh base
d ne
t
w
o
r
ks
whi
c
h i
s
a new
on dem
a
nd m
u
l
t
i
cast
rout
i
n
g
pr
ot
oc
ol
cal
l
e
d Su
rr
o
udi
ng S
u
p
p
o
rt
M
u
l
t
i
cast
R
out
i
ng P
r
ot
oco
l
.
Wh
ile sim
u
lati
n
g
th
ese in
t
h
e no
rm
al an
d
p
e
riod
ic m
e
sh
main
tain
an
ces toward
s t
h
e
forward
i
n
g
nod
es an
d its
n
e
igh
bors to tran
sm
it th
e co
ntro
l m
e
ssag
e
s
so
n
e
w selected
n
o
d
e
s will be u
s
ed
i
n
th
e ro
u
t
e
wh
ich
u
s
es the
SSMR pro
t
o
c
ol, so we can main
tain
th
e b
e
tt
er
route efficiency fo
r r
e
du
cing
th
e nod
es.
Evaluation Warning : The document was created with Spire.PDF for Python.
I
S
SN
:
2
088
-87
08
IJEC
E V
o
l
.
6, No
. 2, A
p
ri
l
20
16
:
78
5 – 7
9
1
78
6
2.
BRIEF
VIEW ABOUT THE SSMR
PROTOCOL
A so
ft
state ap
pro
ach is
u
s
ed
i
n
th
e SSMR p
r
o
t
o
c
o
l
t
o
bu
ild
t
h
e
routes m
a
in
tain
ed with b
a
sic
i
n
f
o
rm
at
i
on l
i
k
e r
o
ut
e di
sc
o
v
ery
et
c.,
an
d
i
t
rob
u
st
a
n
d
e
ffi
ci
ent
Ad
h
o
c
m
u
l
t
i
cast
rout
i
ng.
SSM
R
pr
ot
oc
ol
perform
s
the flooding techni
que
to
find the
path
from
the source t
o
de
st
ination
occasi
o
nally. To t
h
e
node
s
which are connected as long
lived will have to m
a
intain
the route pat
h
, so by th
is route efficacy will be
main
tain
ed
an
d th
e m
u
lticasti
n
g
w
ill b
e
done, it is w
e
ll
k
now
n as t
h
e m
e
sh
str
u
ct
u
r
e or
tr
ee str
u
ct
u
r
e
A.
Crea
tio
n
of M
u
lticas
t Mesh Netw
o
r
k
In
th
is
n
e
two
r
k
th
e
n
o
d
e
o
f
so
urce
will sen
d
t
h
e FLOOD_
REQ to
t
h
e n
o
d
e
s
wh
ich
is set as an
upst
r
eam
node. This re
que
st will be receive
d by the inte
rm
ediate node
s
whic
h will upda
tes the bit fields the
n
it sends the re
ply packet to the node
t
h
at it receives the packets and th
e
s
e are called as forwa
r
di
ng
node
s.
If
th
ese nod
es are o
f
m
u
lti cars mesh
n
e
twork
called
m
e
sh
n
o
d
e
s
wh
ich
is sh
own
in
b
e
low Figu
re
1
a
shows th
e
in
itial
m
o
d
e
o
f
th
e creation
of th
e m
u
lt
icast
n
e
two
r
k
.
Figu
re 1
b
sho
w
s th
e fin
a
l creation
o
f
t
h
e m
e
sh
mu
lticast
net
w
or
k.
Fig
u
re
1
a
. Sh
ows the in
itial m
o
d
e
o
f
th
e creatio
n
o
f
th
e m
u
lticast n
e
two
r
k
Fig
u
re
1b
.
Shows the fi
n
a
l creatio
n
o
f
th
e m
e
sh
m
u
lticast n
e
twork
B.
Main
ten
a
nce
of
the
M
u
ltica
s
t Mesh Ne
tw
ork
In th
is stag
e
we u
s
e certain tech
n
i
q
u
e
s to fi
nd
the rou
t
e is
disco
v
e
ring
o
f
l
o
cal rou
t
e
with send
ing
a
message CAL_REQ pac
k
et
to the m
e
sh
node
s a
n
d the i
n
term
ediate nodes
will receive and se
nd
re
ply as
LO
CAL_
REQ and
t
h
e FLOO
OD_
REQ w
i
ll also
b
e
tr
an
smit b
y
th
e nodes. Th
ese ar
e
sh
own
in th
e Fi
g
u
r
e
2
Main
ten
a
n
c
e of th
e m
u
lticast
m
e
sh
lin
k
fail
u
r
e and
recov
e
r
y
of
lo
cal. If
A
nnu
rou
t
e or p
a
th f
a
ilur
e
occu
r
s
th
en
lo
cal
rou
t
e d
i
scov
ery ensu
res t
h
e co
n
t
ro
l on
ov
erh
e
ad
bu
t it d
o
e
s no
t rep
a
ir it lin
k
failure so
wi
th
th
e
n
e
two
r
k
co
nn
ectiv
ity, th
e lo
cally reco
v
e
rab
l
e lin
k
failure
o
ccurs with
less
frequ
en
tly
th
an
t
h
e link
failu
res.
The
D
i
scov
ery o
f
Floo
ding
ro
ute
is
u
s
ed in th
e SSMR proto
c
o
l
to
se
nd the m
e
ssage FL
OOD_REQ to
creat
e
Evaluation Warning : The document was created with Spire.PDF for Python.
IJECE
ISS
N
:
2088-8708
Design
ing
an
d S
i
mu
la
tion
o
f
Su
rro
und
ing
S
u
p
p
o
r
ting
Mu
ltica
s
t
Ro
u
ting
Pro
t
o
c
o
l
(Sh
a
i
k Mah
abo
ob
Jani
)
78
7
a m
e
sh t
o
p
o
l
o
gy
am
ong
t
h
e
n
ode
s, t
h
en
t
h
e
no
des
j
o
i
n
e
d
i
n
t
h
e
t
o
pol
ogy
re
pl
y
as
LOC
A
L_R
E
Q
pac
k
et
.
An
ot
he
r m
e
t
h
o
dol
ogy
i
s
t
h
e
R
out
e e
ffi
ci
e
n
cy
im
provem
e
nt
pl
ay
a
vi
t
a
l
r
o
l
e
i
n
t
h
e
r
out
e m
a
i
n
t
e
nance i
n
t
h
e
sel
ect
ed pat
h
wi
t
h
m
o
re
num
ber
o
f
fo
rwa
r
di
ng
n
o
d
es.
Th
is
factor plays a
major role
in the
route efficiency.
Fig
u
re 2
.
Mainten
a
n
ce of
th
e m
u
l
ticast
m
e
sh
lin
k
failu
re
and
recov
e
ry of
l
o
cal
3.
SSM
R P
R
OTOCOL
A
NAL
YSIS
&
SIM
U
LATIO
N
The
Fi
g
u
re
3
sh
ow
s t
h
e
p
acket
he
ade
r
of
t
h
e
SSM
R
p
r
ot
ocol
.
Wh
i
l
e
ro
ut
i
n
g
f
r
o
m
source t
o
destination a routing table
will be
m
a
in
tained at each
node
whic
h is shown
in the
Figure
4.
The routing table
co
nsists of co
l
u
m
n
s lik
e fo
rward
i
ng
flag used
for t
h
e
forward
i
ng
no
d
e
s wh
ich will set
th
e
g
r
ou
p n
e
i
g
hbo
ur
fl
ag w
h
e
n
t
h
e
no
de i
s
i
n
a g
r
ou
p.
In eac
h a
nd e
v
ery
no
de
of t
h
e
gr
o
up
o
f
m
e
sh t
opol
og
y
net
w
o
r
k m
a
int
a
i
n
s
the data cac
he
and a
cache t
o
avoi
d the
dupli
cation
of
da
ta
whic
h is s
h
own in
Figure
5.
And the
source
node
will h
a
v
e
a source ad
dress
of
th
e gro
u
p
.
After requ
esting
stag
e of t
h
e
n
odes co
m
p
letio
n
s
th
en th
e
rep
l
y stag
e
will in
itiates, after th
e p
a
t
h
ex
tab
lis
h
m
en
t fro
m
so
urce to
d
e
stin
ation
and
in th
e sam
e
way rev
e
rse path
also
estab
lish
e
d in
t
h
e
u
p
s
t
r
eam
f
i
eld
of
th
e REQ_
CA
C
H
E.
W
h
en
ev
er
the nodes f
a
ils th
en
i
mmed
i
ate w
ill
set th
e
path and send
the
m
e
ssage REP to the upst
r
eam
node
m
eans after the initiation of
the path if any failure
o
ccurs t
h
en immed
i
ately alter
n
ate nod
e
will co
m
e
in
to
ex
isten
ce b
y
relay
mech
an
ism
.
Before th
at
th
e
n
o
d
e
s
has t
o
u
nde
rst
a
nd t
h
at
w
h
ere i
s
t
h
e gr
ou
p nei
g
h
b
o
u
r
an
d h
o
w
t
o
bec
o
m
e
the m
e
m
b
er of t
h
e nei
g
hb
o
u
r
gr
o
up
i
f
i
t
i
s
non m
e
sh net
w
o
r
k t
h
ey
by
usi
n
g t
h
e
Upst
ream
fi
el
d a ro
ut
e i
s
di
sc
ove
re
d wi
t
h
a
packet
whi
c
h c
ont
ai
n
s
the s
o
urce a
d
dress field of the
pack
et
.
T
h
e Ta
bl
e 1
s
h
o
w
s t
h
e be
havi
ou
r
of
t
h
e r
o
ut
e di
sc
o
v
ery
pac
k
et
s.
Type
Sequence
num
ber
Gr
ou
p
address
Source
address
upst
r
eam
FC
NC
Fi
gu
re
3.
SSM
R
pac
k
et
hea
d
e
r
Fi
gu
re
4.
R
o
ut
i
n
g
t
a
bl
e
use
d
a
t
t
h
e n
o
d
es
of
SSM
R
Gr
ou
p
address
For
w
a
r
di
ng
flag
For
w
a
r
di
ng
Tim
e
out
G
r
o
u
p
n
e
i
g
hbou
r
flag
G
r
o
u
p
n
e
i
g
hbou
r
t
i
m
e
out
…………
….
…………
…..
…………
…..
…………
……
.
…………
……
Evaluation Warning : The document was created with Spire.PDF for Python.
I
S
SN
:
2
088
-87
08
IJEC
E V
o
l
.
6, No
. 2, A
p
ri
l
20
16
:
78
5 – 7
9
1
78
8
S
o
urce
address
Gr
oup
address
Se
que
nce
num
ber
……
…………
..
…
…………
…
……
……
…………
…
(a)
S
o
urce a
d
dr
ess
G
r
oup a
d
dr
ess
Se
que
nce
n
u
m
ber
U
p
strea
m
……
………
…………
..
……
………
…………
..
…
………
…
…………
…
…
…
…………
(b
)
Figure
5. a)
Da
ta cache
b) Re
q Cac
h
e
used un SSMR
Tabl
e
1.
N
o
de
be
havi
ou
r
w
h
en a
n
ode
di
sc
ove
rs t
h
e
ro
ut
e
Route discovery
Source
Receiver
Forw
ading node
Group neighbor
Other node
Flooding
Update sour
ce table
Relay
Send REP
Relay
Relay
*
Relay
**
Relay
L
o
cal
Update sour
ce table
Relay
Send REP
Relay
Relay
*
Relay
**
*Gr
oup Neighbor
tim
e
out is r
e
fr
eshe
d
if Sour
ce Addr
ess
=
Upstr
e
a
m
.
**T
he node beco
m
e
s a gr
oup neighbo
ur
if Sour
ce Addr
ess= Upstr
e
a
m
.
4.
1. Si
mul
a
ti
o
n
A
n
al
ysi
s
For
si
m
u
l
a
t
i
on o
f
t
h
i
s
SSM
R
p
r
ot
ocol
we
u
s
ed
ns
2 si
m
u
l
a
t
o
r i
n
w
h
i
c
h
w
e
use
t
h
e
s
o
m
e
pa
ram
e
t
e
r
l
i
k
e FLO
O
D
_
PER
I
O
D
use
d
fo
r t
h
e
del
i
v
er
ers t
i
m
e
rat
i
on
and t
h
e co
nt
r
o
l
ove
rh
ead
of t
h
e SSM
R
pr
ot
o
c
ol
. I
n
the fig 6
we c
a
n clearly obs
e
rve a
n
alyse the
pack
et delivery ratio
inc
r
eases
wh
en
the FLOOD
_PERI
OD
reduces from
1
00 to
20 s and the deliv
ery ra
tio increases to 6% and we ca
n also re
duce the from
20 s to 2
s
fr
om
t
h
e fi
g 6 we can al
s
o
ex
pl
ai
ns t
h
e t
r
a
n
sm
i
ssi
on ra
nge
i
s
very
sh
ort
e
st
. So t
o
st
udy
t
h
e im
pact
fact
or
o
f
t
h
e p
r
efe
rri
ng
no
des
w
h
i
c
h
c
a
n est
a
bl
i
s
h a
r
e
verse
r
o
ut
e wi
l
l
be u
s
ed
a
bel
o
w
f
u
n
c
t
i
o
n
Metric=(1
-
a)*FC+a*NC,
0
<
=a & a<=1
Evaluation Warning : The document was created with Spire.PDF for Python.
I
J
ECE
I
S
SN
:
208
8-8
7
0
8
Design
ing
an
d S
i
mu
la
tion
o
f
Su
rro
und
ing
S
u
p
p
o
r
ting
Mu
ltica
s
t
Ro
u
ting
Pro
t
o
c
o
l
(Sh
a
i
k Mah
abo
ob
Jani
)
78
9
Fig
u
re 6
.
Ratio
Data d
e
liv
ery with
d
i
fferen
t
FLOOD_
PERIOD
B
y
vary
i
n
g t
h
e
val
u
e
o
f
‘a
’
f
r
om
0.4
t
o
0.
5
an
d 0
.
6
t
h
e
n
we ca
n see t
h
e
pac
k
et
del
i
v
e
r
y
rat
i
o
an
d
gr
o
up si
ze i
n
t
h
e bel
o
w Fi
g
u
r
e 7 an
d
we can clearly examines
that the
packet deliv
ery w
ill
n
o
t
show
an
y
im
pact on the
group size. T
h
e ratio
of
d
a
ta
p
ack
ets and
t
h
e to
tal d
a
ta
p
a
ck
ets
d
e
liv
ered is called
t
h
e
fu
n
c
tion
of t
h
e g
r
ou
p si
ze. From
t
h
i
s
we can
say that as the group
size increases
th
en
th
e redu
ces
m
o
re sig
n
i
fican
tly
wh
ich
is sho
w
n
in th
e
Figu
re
8
an
d th
e
red
u
c
tio
n
ratio
n will b
e
of
1
%
Fig
u
re 7
.
Data d
e
liv
ery ratio
with
d
i
fferen
t
weigh
t
Evaluation Warning : The document was created with Spire.PDF for Python.
I
S
SN
:
2
088
-87
08
IJEC
E V
o
l
.
6, No
. 2, A
p
ri
l
20
16
:
78
5 – 7
9
1
79
0
Fi
gu
re 8.
Tra
n
s
m
i
ssi
on
o
f
Dat
a
pac
k
et
s wi
t
h
di
ffe
re
nt
wei
g
h
t
4.
2. C
o
mp
ari
s
on Stu
d
y
o
f
V
a
ri
ou
s
P
a
ra
m
e
ters
i
n
SS
M
R
Pr
ot
oc
ol
In t
h
i
s
we c
o
m
p
are
d
t
h
e res
u
l
t
s of
t
h
e si
m
u
l
a
t
e
d SSM
R
pr
ot
oc
ol
wi
t
h
ot
her
p
r
ot
ocol
s l
i
ke O
D
M
R
P
&M
AO
D
V
.
If
we c
onsi
d
ere
d
a gr
o
u
p
ha
s t
w
o s
o
u
r
ces
n
ode
s wi
t
h
fi
ve
rec
e
i
v
ers t
h
en
t
h
e
t
r
ansm
i
ssi
on
r
a
ng
e
is set to 250 m
e
ters, we can
vary the speed
of resilien
ce
of prot
oc
ols against the no
de m
obility. It is clearly
sho
w
n i
n
t
h
e
F
i
gu
re
9,
n
ode
s
p
eed
wi
t
h
pa
ck
et
del
i
v
ery
rat
i
o
fr
om
t
h
i
s
we
di
sc
ove
red
t
h
a
t
as t
h
e s
p
ee
d
of
t
h
e
node inc
r
eases
then performance of
the MAODV reduce
s rapidly. Sim
ilarly to
th
e O
D
MRP p
e
rfo
rman
ce
v
a
ries in
su
ch
a way t
h
at SSMR p
e
rfo
rm
s th
e l
o
cal failu
re reco
v
e
ry
b
u
t
th
is
will p
e
rfo
rm
s th
e g
l
ob
al
failu
re
recovery.
Fig
u
re
9
.
Co
mp
ariso
n
of m
o
bilit
y ch
ang
e
&
d
a
ta d
e
li
v
e
ry
ratio
n
Evaluation Warning : The document was created with Spire.PDF for Python.
I
J
ECE
I
S
SN
:
208
8-8
7
0
8
Design
ing
an
d S
i
mu
la
tion
o
f
Su
rro
und
ing
S
u
p
p
o
r
ting
Mu
ltica
s
t
Ro
u
ting
Pro
t
o
c
o
l
(Sh
a
i
k Mah
abo
ob
Jani
)
79
1
Vari
at
i
o
n i
n
t
e
rm
s of
dat
a
t
r
a
n
sm
i
ssi
on wi
t
h
SSM
R
pr
ot
oc
ol
wi
t
h
ot
her
pr
ot
oc
ol
s l
i
k
e
ODM
R
P
&
MAODV. Th
is clearly sho
w
s in
th
e
Figu
re
1
0
, th
e
MAOD
V h
a
s low
e
r
sp
eed
of
data com
p
ared with
SSMR
pr
ot
oc
ol
an
d t
h
e co
nt
r
o
l
ove
rhea
d o
f
O
D
M
R
P i
s
l
a
rger t
h
an t
h
e SSM
R
ove
r
h
ead
. I
n
t
h
e sim
u
l
a
t
i
on d
u
rat
i
o
n
the transm
issio
n
ra
nge will be
static at 250 m
and the
m
a
xim
u
m
speed is
set to th
e
10m
/s of t
h
e
grough whic
h
have a
5 recei
vers
with one
gro
up source head, so the ODMRP & SSMR
prot
ocol
will perform
m
o
re better
than t
h
e MAODV i
n
m
a
xim
u
m cases. Howe
ver as
the s
o
urce node i
n
crea
ses then pe
rformance decre
a
s
e
s due
to
in
ten
s
e traffic. Bu
t b
y
t
h
e
u
s
e
o
f
SSMR
p
r
o
t
o
c
o
l
will co
n
t
ro
l the d
a
ta
tran
sm
issio
n
.
As a
wh
o
l
e t
h
e SSMR
will p
l
ay a
b
e
st ro
le in
t
h
e
d
a
ta tran
sm
issio
n
fro
m
so
u
r
ce to
d
e
stin
ation
.
Fig
u
re
10
.
Dat
a
tran
sm
issio
n
co
m
p
ariso
n
wi
th
m
o
b
ility ch
an
g
e
s wit
h
ODMRP, SSMR
MAODV
4.
CO
NCL
USI
O
N
In t
h
i
s
pape
r
w
e
pr
o
p
o
s
e a
pr
ot
oc
ol
f
o
r
t
h
e
Ad
h
o
c
net
w
or
ks
whi
c
h i
s
ba
si
s o
n
on
dem
a
nd
m
u
l
t
i
cast
ro
ut
i
n
g sc
hem
e
w
h
i
c
h i
s
cal
l
e
d a
new
p
r
ot
o
c
ol
as S
S
M
R
p
r
ot
ocol
.
Thi
s
p
r
ot
ocol
i
s
desi
gne
d
fo
r t
h
e ef
fi
ci
ent
d
a
ta
tran
sm
issi
o
n
fro
m so
u
r
ce to
d
e
stin
atio
n
s
and
to
co
n
t
ro
ls m
i
n
i
mizes
th
e o
v
e
rh
ead
in
m
a
in
tain
in
g th
e
m
u
l
ticast
m
e
sh
n
e
twork. Th
e
si
m
u
latio
n
an
alysis also
don
e u
s
i
n
g NS-2
si
m
u
la
to
r.
Fro
m
th
is an
alysis
we g
e
t
clear says th
at SSMR will d
ecreases th
e ov
erh
e
ad
and
in
creases th
e ro
u
t
e efficien
cy
fro
m
so
u
r
ce
n
o
d
e
to
i
n
t
e
rm
edi
a
t
e
node
s an
d
dest
i
n
at
i
on
n
o
d
e
. T
h
i
s
p
r
ot
ocol
wi
l
l
i
n
crease t
h
e
m
obi
l
i
t
y
of n
o
d
es a
nd
gr
o
up
si
ze as
it will set as mesh
st
ru
ct
u
r
e.
And
t
h
e
fu
t
u
re wo
rk
s
will
b
e
d
o
n
e
on
t
h
e energ
y
h
a
rv
esting
an
d rou
t
e d
i
sco
v
e
ry
packets
.
REFERE
NC
ES
[1]
C.
Pe
rkins,
P.
Bha
g
wa
t,
Highly
dy
nam
i
c d
e
s
t
ination- s
e
q
u
en
ced dis
t
ance-
v
e
ctor routing
(DSDV) for
mobile
computers, AC
M SIGC
OMM, October 1994
.
[2]
Murthy
,
J.
J.
Ga
rc
ia
-Luna
-Ace
ves,
An
efficient r
outing proto
c
ol f
o
r wirele
ss networks, ACM Mob
ile Networks an
d
Applications Jou
r
nal, Special issue on Rou
ting
in
Mobile Communi
cation Networ
ks, 1996.
[3]
D. Bertsek
a
s, R.
Gallag
e
r, Dat
a
N
e
twork, s
econd
edition, Prent
i
ce-
H
all,
Engl
ewood
Cliffs, NJ, 1992
, pp
. 404–410
.
[4]
G. Aggelou, R. Tafazolli, RDMAR:
a bandwidth-efficien
t routing protoc
o
l
for mobile ad hoc networks,
Proceedings of
The Second AC
M Internat
ional
W
o
rks
hop on Wirel
e
ss Mobile
Multim
edia (W
o
W
MoM), Seattl
e,
WA, August 1999.
[5]
C.
Perkins, E.
M
.
Roy
e
r,
S.
R.
D
a
s,
Ad Hoc on
Demand
Distance Vector (AODV) routing, Internet Draft,
IETF
,
June 1999
.
[6]
C.K.
Toh, Long-
lived
Ad Hoc Ro
uting b
a
sed on
the Conc
ept of A
ssociativity
, Intern
et dr
aft, I
ETF,
March 1999
.
[7]
J. Broch, D.B. J
ohnson, D.A.
M
a
ltz,
The d
y
n
a
mic source
routing
in ad ho
c wireless networks, in
:
T. Imielinski, H
.
Korth (Eds.)
, M
obile Computing
,
Kluwer
Acad
emic Publishers,
Dord
recht, 1996, pp. 153–181 (C
hapter
5).
[8]
V. Park, S. Cors
on, Temporally
-
O
rdered Routing
Algorith
m (TO
R
A), ver
.
1
,
In
ternet dr
aft, I
ETF,
August 1998.
[9]
E. Ro
yer, C.
E.
Perkins, Multica
s
t operation of the ad-
hoc on-d
e
m
a
nd distance
vector routing protocol
, Mobi-
Com’99, August 1999.
[10]
S. Lee, W. Su, M. Gerla, Ad hoc
wireless m
u
lticast with m
obilit
y
pred
ict
i
on,
IEEE ICCCN’9
9, Boston, MA,
October 1999
.
Evaluation Warning : The document was created with Spire.PDF for Python.