Internati
o
nal
Journal of Ele
c
trical
and Computer
Engineering
(IJE
CE)
V
o
l.
6, N
o
. 5
,
O
c
tob
e
r
201
6, p
p
. 2
352
~236
1
I
S
SN
: 208
8-8
7
0
8
,
D
O
I
:
10.115
91
/ij
ece.v6
i
5.1
050
4
2
352
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
Light-W
eight Routing Prot
ocol
in
IoT-Based Inter-Device
Telecom
m
unicati
on Wi
rel
ess Envi
ronm
ent
Ha
yo
un
g O
h
1
,
Sangs
o
on Li
m
2
1
School of
Electronic
and
Engin
eering
,
SoongSil University
, Seo
u
l, South
Korea
2
Software R&D
Center, Samsung
Electron
i
cs, Seoul, South
Korea
Article Info
A
B
STRAC
T
Article histo
r
y:
Received
Mar 15, 2016
Rev
i
sed
Jun
1
,
2
016
Accepted
Jun 15, 2016
The primar
y
tas
k
for IoT-based
h
y
pe
r-
connectivity
communications lies in
the d
e
velopment of dir
ect communica
tions techn
i
que
among IoT devices in
RPL (Routing Protocol for Low
-
Power and Loss
y
Networks) environment
without th
e aid
f
r
om infras such as acce
ss points, base stations etc. In
a low-
power and lossy
wireless network, IoT
devices and routers cannot keep th
e
original
pa
th to
ward the
dest
in
ation
since
th
e
y
have
th
e l
i
m
ite
d m
e
m
o
r
y
,
excep
t for a limited number of th
e defau
lt router information.. Dif
f
erent from
the previous lig
ht-weight routin
g protocols focusing on the reduction of th
e
control messag
e
s, the proposed sche
me prov
ides the
light-
w
eight IPv6
address auto-co
n
figuration, IPv6 neighbor
disco
v
er
y
and routing
protocol in
a IoT capable
in
fra-less wir
e
less
networks
with
th
e bloom filer
an
d enhan
ced
rank concepts. A
nd for the first time we
evaluate
our proposed scheme based
on the modeling
of var
i
ous prob
ability
d
i
stributions in th
e IoT environments
with the loss
y
w
i
reless link. Specifica
lly
, th
e proposed enhanced RPL based
light-weigh
t rou
ting protoco
l
im
proves the robu
stness with the m
u
lti-paths
locally
established based on
the enha
nced r
a
nk
concep
ts even
though loss
y
wireless links are existed. We
show
ed the improvements of th
e proposed
scheme up
to 40
% than
th
e RPL
based proto
c
ol.
Keyword:
Hy
pe
r-c
on
nect
i
v
i
t
y
IoT
(i
nternet
o
f
thi
n
g
)
Li
ght
-
w
ei
g
h
t
r
out
i
n
g p
r
ot
ocol
RPL
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
:
Sang
soon
Lim
,
Soft
ware
R&
D
Center,
Sam
s
ung El
ect
ro
ni
cs,
56
,
Se
o
ngc
h
o
n
-
gi
l
,
Seoc
h
o
-
g
u, Seo
u
l
,
K
o
re
a.
Em
a
il: lssg
o
od8
0@g
m
ai
l.co
m
1.
INTRODUCTION
The rising de
mand for va
rious inte
rnet se
rvices
and the
recent developm
ent
in the f
i
eld of sm
art
electro
n
i
c
d
e
v
i
ces h
a
s
b
e
en
facilitatin
g
th
e m
o
v
e
m
e
n
t
o
f
in
ternet env
i
ro
n
m
en
t fro
m
t
h
e
h
u
m
an
-cen
tered
settin
g
s
to
IoT
(In
t
ern
e
t of Thin
g
s
) settin
g
s
fu
ll o
f
i
n
tellig
en
t d
e
v
i
ces.
In
th
is trend
,
IoT-ap
p
licab
le termin
als
are req
u
i
r
e
d
t
o
be l
o
w-
p
o
we
r
and l
i
ght
-
w
ei
ght
an
d t
h
u
s
sens
or net
w
o
r
k
s
are t
h
e fi
rst
h
and ca
ndi
dat
e
fo
r Io
T
n
e
two
r
k
i
ng
(wh
ile th
e sen
s
o
r
n
e
twork
h
a
s
been
so
far a
sort o
f
clo
s
ed
n
e
twork
for ind
i
vid
u
a
l u
tilizatio
n
)
. If
sens
or-bas
ed i
n
form
ation is connected t
o
s
m
art devices
s
u
ch as sm
art phones
, sm
art T
V
s etc., a new
service
fo
cu
sing
o
n
ind
i
v
i
du
al life amen
ities will b
e
av
ailab
l
e.
Sin
ce it is p
r
oj
ected
th
at 2
4
b
illio
n
term
in
als
will be
co
nn
ected
t
o
th
e in
tern
et b
y
2
020
, th
e
Io
T-b
a
sed
serv
ices will b
e
ex
p
a
nded
to
v
a
st scope o
f
areas in
clu
d
i
ng
sm
art-h
o
m
e, smart g
r
id, i
n
tellig
en
t h
e
alth
care,
i
n
tellig
en
t tran
spo
r
tation
serv
ice etc
[1
]-[4
].
In
t
h
is reg
a
rd
, th
e sen
s
or cap
a
b
ility o
f
an
in
d
i
v
i
d
u
a
l p
r
od
u
c
t h
a
s b
een
rem
a
rk
ab
ly
ex
p
a
nd
ing
as
m
u
ch as the re
cent sm
art devices ar
e equipped with accele
r
om
eters, GPS
se
ns
ors
,
proxi
m
ity sensors, c
a
m
e
ra
etc. Th
ese
n
e
w sensor d
e
v
i
ces p
r
ov
id
e intern
al sensory v
a
lu
es th
at
may b
e
u
tilize
d
fo
r
n
e
w applicatio
n
services a
nd
new fram
e
work accessibilities
.
Howe
ver, th
ese built-in se
nsors are lim
i
t
e
d in size, price and
space a
v
ailability and he
nce
may not be
put into one
de
vi
ce. To m
eet
t
h
e ever
-increa
s
ing
dem
a
nd for life
-
conve
n
ience s
m
art services, th
e in
ter-conn
ectio
n
of Io
T n
e
twork
s
is em
erg
i
ng
as th
e m
o
st su
itab
l
e so
lutio
n
in
Evaluation Warning : The document was created with Spire.PDF for Python.
I
J
ECE
I
S
SN
:
208
8-8
7
0
8
Li
ght
Wei
g
h
t
R
out
i
n
g
Prot
oco
l
i
n
I
o
T
Ba
sed
Int
e
r
Devi
ce T
e
l
ecom
m
u
n
i
c
at
i
on
Wi
rel
e
ss...
.
(
H
ay
o
u
n
g
O
h
)
2
353
that this approach e
n
able
s a
sm
art
devi
ce t
o
m
a
ke use
of
ext
e
r
n
al
se
ns
ors
f
o
r i
n
f
o
rm
at
i
on c
o
l
l
ect
i
on a
n
d
rem
o
t
e
cont
rol
.
Hence, t
h
e
r
e
l
e
vant
i
n
d
u
st
r
i
es are enga
ge
d i
n
h
o
t
pu
rs
ui
t
for t
ech
nol
og
y
devel
o
pm
ent
and
r
e
sear
ch
activ
i
ties. For
instance, sm
ar
t p
hones ar
e con
s
tan
t
ly r
o
v
i
ng
along
w
ith
the m
o
v
e
m
e
n
t
o
f
t
h
e
u
s
er
s;
t
h
ey
m
a
y col
l
ect
i
n
form
at
i
on fr
om
t
h
e st
at
i
onary
sens
o
r
s aro
u
nd
pr
o
x
i
m
at
e areas
and ret
u
r
n
t
h
e
usef
ul
envi
ronm
ental inform
ation such as
real
tim
e
te
m
p
erature
and
hum
idity etc.
Th
e thr
ee m
a
j
o
r
I
o
T tech
no
l
o
g
i
es ar
e sensin
g
techno
logy, w
i
r
e
-
a
nd
wir
e
less co
mm
u
n
icatio
n
s
&
net
w
or
k i
n
fra t
echn
o
l
o
gy
an
d
servi
ce i
n
terfa
ce technology. The se
nsing
technology col
l
ects, processe
s and
m
a
nages i
n
f
o
r
m
at
i
on from
sens
ors a
nd s
u
p
p
o
rt
t
r
ans
f
o
r
m
a
ti
on of s
u
ch i
n
f
o
rm
at
i
on fo
r p
r
e-
det
e
rm
i
n
ed
services
. To enha
nce IoT
services
associated with end-to-end net
w
o
r
k
s
, t
h
e de
vel
o
per n
eeds
vari
o
u
s
com
m
uni
cat
i
ons a
nd
net
w
o
r
ki
ng t
e
c
h
n
o
l
o
gi
es i
n
cl
u
d
i
n
g
pr
o
x
i
m
i
t
y
co
m
m
uni
cat
i
on t
echn
o
l
o
gy
(
W
P
A
N
,
W
L
A
N
etc)
[5
],[6
],
m
o
b
ile co
mm
u
n
i
cati
o
n
s
tech
no
logy (
2
G
,
3
G
etc)
, w
i
r
e
co
mmu
n
i
cation
s
tech
no
log
y
(Eth
ern
e
t, BcN etc). Fo
r the fin
a
l
d
e
liv
ery o
f
Io
T serv
i
ces to t
h
e
use
r
, t
h
e devel
o
per also nee
d
s
to apply
service interfa
ce technol
ogy, which will cover wi
de ra
nge
of functions: to sense
,
proce
ss/extract/treat, store,
j
udg
e i
n
fo
rm
at
io
n
;
t
o
recogn
ize situ
ation
;
to enh
a
n
ce secu
rity/p
riv
acy protectio
n
fun
c
tion
a
lity; to
certify and
approve
access
e
s; to c
o
nduct
discov
ery, obje
c
t standa
rdizati
o
n,
ope
n
API a
n
d ope
n
platform
e
t
c.
The rece
nt
t
r
e
nds a
r
e
pu
rs
ui
ng i
n
t
e
r-
de
vi
ce com
m
uni
cat
i
ons i
n
vari
ous
wi
rel
e
ss n
e
t
w
o
r
ks
, w
h
ere
b
y
devi
ces
di
r
ect
l
y
excha
n
ge i
n
f
o
rm
at
i
on i
n
i
n
fra
-l
ess e
nvi
r
o
nm
ent
.
I
n
cel
l
u
l
a
r
net
w
or
ks,
t
h
e st
a
nda
r
d
i
zat
i
o
n
has
been
u
n
d
e
r
t
a
ke
n t
o
a
p
pl
y
i
n
t
e
r-
devi
ce
di
rect
c
o
m
m
u
n
i
cat
i
on t
e
c
h
n
o
l
o
gi
es f
r
om
3G
PP t
o
LTE
(L
on
g
-
Term
Evol
ut
i
o
n)
[
7
]
.
In
unl
i
c
ense
d
ban
d
a
r
e
a
s, t
h
e
W
i
-Fi
d
i
rect
8
0
2
.
1
u
t
e
chn
o
l
o
gy
has b
een devel
o
ped
al
on
g
wi
t
h
t
h
e e
x
pa
nsi
o
n
of t
h
e e
x
i
s
t
i
ng
wi
rel
e
s
s
LA
N st
an
da
rds
[
8
]
,
[
9
]
.
F
u
rt
her
,
i
n
IEEE
80
2.
1
5
.
8
area
s, t
h
e
st
anda
rdi
zat
i
o
n
for
o
b
ject
re
c
o
g
n
i
t
i
on c
o
m
m
uni
cat
i
o
ns ha
s been
u
nde
rt
ake
n
. T
h
e m
o
st
signi
fi
cant
ad
va
nt
ages
of i
n
t
e
r-
devi
ce
di
rect
com
m
uni
cat
i
o
ns are
qu
ot
ed as
fol
l
ows:
fi
r
s
t
,
i
t
m
a
y
subst
a
nt
i
a
l
l
y
reduce l
a
g t
i
m
e
s
i
n
t
e
rfe
ri
n
g
i
n
t
r
ansm
i
ssi
on, c
o
m
m
uni
cat
i
on di
st
ance, an
d
t
h
anks t
o
t
h
e
by
passi
n
g
o
f
AP an
d base s
t
at
i
on
enga
gem
e
nt
;
secon
d
,
i
t
m
a
y creat
e ne
w e
nvi
ro
nm
ent
fo
r easy
s
h
ari
n
g
of
ne
w t
y
pes
of
p
r
o
x
i
m
i
t
y
-
base
d
reso
u
r
ces s
u
c
h
as sensi
n
g i
n
fo
rm
ati
on am
ong
I
o
T t
e
rm
i
n
al
s, nei
g
h
b
o
r
di
sc
ove
ry
,
IP
v6
ad
dress
e
s et
c.
Nev
e
rth
e
less, t
h
ere are certain
ad
d
ition
a
l req
u
i
rem
e
n
t
s d
e
riv
i
n
g
fro
m
th
e sp
ecific
ch
aracteristics o
f
IoT e
n
vi
r
onm
ent
-
i
n
cl
udi
ng l
o
w-
po
we
r, l
i
g
ht
-wei
ght
a
nd
u
n
st
abl
e
c
o
m
m
uni
cat
i
o
ns set
t
i
ng et
c. M
o
st
of al
l
,
t
h
e desi
g
n
s
ne
ed t
o
be
u
n
d
ert
a
ken
i
n
di
f
f
ere
n
t
pe
rs
pect
i
v
es ap
art
fro
m
th
e ex
isting
on
es in
term
s o
f
au
tomatic
ad
dress settin
g, in
ter-d
e
v
i
ce co
mm
u
n
i
catio
n
s
and
rou
ting
pro
t
o
c
o
l
s.
Th
e
p
r
ox
im
i
t
y
-
b
a
sed
li
g
h
t
weig
h
t
au
to
m
a
ti
c add
r
ess settin
g and IPv6
neig
hb
or
d
i
sco
v
ery techn
i
qu
e
i
n
t
e
nd
s t
o
achi
e
ve di
rect
c
o
m
m
uni
cat
i
ons am
ong
Io
T de
vi
ces i
n
ci
rcu
m
st
ances whe
r
e
m
o
re t
h
an t
w
o
IoT
d
e
v
i
ces are physically
lo
cated
in
p
r
o
x
i
m
a
te
d
i
stan
ce,
w
h
ich
w
ill b
e
co
m
e
av
ailab
l
e th
roug
h
au
to
m
a
tic a
d
dress
setting of light
-wei
ght IPv6 a
d
dress t
o
each
IoT
de
vice,
dis
c
ove
ring neighboring de
vices
and c
o
nduct direct
com
m
unications am
ong t
h
e
devices
bypas
s
i
ng the i
n
fra fa
cilitie
s. To rea
lize these techniques, it is crucial to
desi
g
n
t
h
e
pr
o
p
er
di
sc
ove
ry
pr
ot
oc
ol
s t
o
i
d
ent
i
f
y
t
h
e
o
v
er
l
a
ps am
ong
t
h
e
aut
o
m
a
t
i
cal
ly
-set
IP
v6
ad
dre
sses o
n
i
ndi
vi
dual
de
vi
ces. M
e
a
n
w
h
i
l
e, i
t
i
s
n
o
t
eas
y
by
any
m
ean
s t
o
desi
g
n
t
h
e
p
r
ot
ocol
s i
n
way
s
e
nha
nci
n
g t
h
e
fun
c
tion
s
t
o
d
i
scov
er th
e ligh
t
-weigh
t au
t
o
matic ad
d
r
ess
settin
g
co
nf
igur
atio
n and
del
i
ver
t
h
e
dat
a
t
o
t
h
e
d
e
stin
ation
with
in
ad
eq
u
a
te time an
d
with
u
s
e of m
i
n
i
m
a
l
wi
rel
e
ss res
o
urc
e
s an
d l
east
bat
t
ery
co
nsum
pt
i
o
n
.
In
p
a
rticu
l
ar, i
n
case m
u
ltitu
d
e
s
o
f
IoT d
e
v
i
ces fail to
i
d
en
tify targ
et
Io
T term
in
als
an
d
/
o
r
no
n-
o
v
e
rlapp
i
ng
IPv
6
add
r
esses, or fail to m
a
in
ta
in
th
e
rou
t
er p
a
th
, th
en
t
h
e
d
e
v
i
ces sh
ou
ld cu
t off th
e con
n
ectio
n
an
d rep
eat accessin
g
ag
ai
n
,
wh
ich
p
r
o
cess
will requ
ire
tran
sm
issio
n
of larg
e
vo
lu
m
e
o
f
u
n
i
cast i
n
fo
rm
atio
n
-
i
n
sh
ort
resu
lt in in
efficien
cy.
Exi
s
t
i
n
g
resea
r
ches
has
foc
u
s
e
d
on
h
o
w
t
o
r
e
duce
o
v
e
r
hea
d
, as
re
pre
s
ent
e
d
by
C
o
AP
(
C
onst
r
ai
ne
d
Ap
pl
i
cat
i
o
n
Pr
ot
oc
ol
) [
10]
fo
cusi
n
g
o
n
t
h
e sol
u
t
i
o
n
i
n
dat
a
t
r
an
sm
i
ssi
on,
R
P
L (R
o
u
t
i
n
g
Pr
ot
oc
ol
fo
r Lo
w-
Po
wer a
n
d Lo
s
s
y
Net
w
or
ks)
[
11]
desi
g
n
ed t
o
re
d
u
ce co
nt
r
o
l
m
e
ssages, K
u
n
j
a
n
Pat
e
l
,
P
S
R
,
H
u
S
h
e et
c. The
existing resea
r
ches have
conc
entrated
o
n
refi
ned
cat
eg
ori
zat
i
on
of
co
nt
r
o
l
m
e
ssage t
y
pes,
or
set
t
i
ng
o
f
o
v
eral
l
transm
ission path with the
pe
riodic exc
h
a
n
ge
of
beacons
for a lim
ited tim
e
spa
n
.
On t
h
e c
ont
ra
r
y
, t
h
i
s
paper
pr
o
poses t
o
ac
hi
eve t
h
e re
du
ct
i
on o
f
ove
r
h
ead i
n
t
h
e o
v
e
r
al
l
cont
r
o
l
m
e
ssages by a
pplying ne
w s
c
hem
e
s: first, to re
duce
the
volum
e
of m
e
ss
ages
am
ong nods
by utilizing
has
h
-
fun
c
tion
b
a
sed b
l
oo
m
filter
ex
pressi
o
n
;
and
secon
d
,
expressing
t
h
e nod
-recogn
izin
g ad
dresses, n
e
i
g
hbo
r
di
sco
v
ery
,
ro
u
t
i
ng pat
h
et
c.
i
n
l
i
ght
-
w
ei
g
h
t
m
ode.
When
IoT t
e
rm
i
n
al
s have l
i
ght
-w
ei
ght
ad
dres
se
s an
d
in
vo
lv
ed
in
low-p
o
wer lo
ssy
n
e
two
r
k
on
t
h
e b
a
sis
o
f
R
P
L syste
m
, th
e d
e
v
i
ces
will b
e
ab
le to
rerou
ting
th
ro
ugh
flex
ib
l
e
an
d
sm
al
l o
v
e
rh
ead
p
a
t
h
wh
en
a prob
le
m
in
lo
op
ing
and
rou
ting
lo
ss etc. o
ccurs,
wh
ich
will
en
ab
le th
e
d
e
v
i
ce to
p
r
o
m
p
tly
id
en
tify th
e neig
hb
oring
Io
T ter
m
in
al an
d
resu
m
e
so
lid
ly t
r
an
sm
itt
in
g
th
e d
a
ta
to
th
e
d
e
stin
ati
o
n.
The p
r
op
ose
d
IoT t
e
rm
i
n
al
’s
l
i
ght
-wei
g
h
t
aut
o
m
a
t
i
c
addre
ss set
t
i
ng,
IPv
6
nei
g
h
b
o
r
di
s
c
ove
ry
an
d
l
i
ght
-
w
ei
g
h
t
ro
ut
i
ng
pr
ot
oc
ol
doe
s n
o
t
pres
u
p
p
o
se a
n
y
spe
c
i
f
i
c
com
m
unicat
i
ons t
ech
nol
ogy
an
d acc
or
di
n
g
l
y
it
m
a
y be subsequently appl
ied to wifi di
rect, I
EEE 802.15.8
object re
cogniti
on c
o
mm
unication etc. This
p
a
p
e
r is co
m
p
osed
as fo
llows:
Evaluation Warning : The document was created with Spire.PDF for Python.
I
S
SN
:
2
088
-87
08
I
J
ECE
Vo
l. 6
,
N
o
. 5
,
O
c
tob
e
r
20
16
:
235
2
–
23
61
2
354
In
cha
p
t
e
r
2
,
t
h
e
rel
e
va
nt
researc
h
es
wi
l
l
be i
n
t
r
od
uce
d
a
n
d
e
xpl
ai
n
e
d.
I
n
c
h
a
p
t
e
r
3,
f
u
rt
her
ex
p
l
an
ation
s
will b
e
g
i
v
e
n
to
th
e enh
a
n
c
ed
RPL b
a
sed
ligh
t
-weigh
t rou
tin
g
pro
t
o
c
o
l
in
th
e Io
T-b
a
sed
in
ter-
d
e
v
i
ce
wireless env
i
ro
n
m
en
t. In
ch
ap
ter 4,
th
e resu
lts
of
perfo
r
m
a
n
ce assessm
en
t will b
e
p
r
esen
ted
.
Fin
a
lly,
in
ch
ap
ter 5, the con
c
lu
si
o
n
s
an
d im
p
licat
io
ns will b
e
d
i
scu
s
sed
.
2.
RELATED WORK
The
ro
ut
i
n
g
p
r
ot
ocol
s
fo
r
I
o
T-
base
d l
o
w
-
po
we
r com
m
uni
cat
i
ons
m
a
y be cat
e
g
o
r
i
z
e
d
based
o
n
cont
rol
m
e
ssages fo
r
pat
h
set
t
i
ngs
(co
n
t
r
ol
pl
ane) a
n
d
dat
a
t
r
ansm
i
ssi
on se
t
t
i
ngs (
d
at
a pl
a
n
e)
, w
h
i
c
h i
s
l
a
rgel
y
p
r
esen
ted in
Tab
l
e 1.
Tabl
e 1. Io
T b
a
sed pr
ot
oc
ol
s fo
r
L
o
w-
po
we
r
com
m
uni
cat
i
ons
Data Plan
Control Plane
6LoW
P
A
N
(
I
P
v
6 o
ver Low power WP
A
N
)
-
Fr
ag
m
e
nt Fo
r
w
ar
d
i
ng T
echnique
CoA
P
(
C
onstrained A
pplication P
r
ot
ocol)
-
M
2
M
co
m
m
unication in
constrai
ned networks
-
Connect s
m
a
r
t obj
ects to the Inte
rnet
-
A bulk data tr
ansfer
m
e
chanis
m
over
UDP
-
Avoid fr
ag
m
e
ntation,
r
e
tr
ans
m
ission
of
T
C
P
t
o
mi
n
i
mi
z
e
s
t
a
t
e
ma
i
n
t
e
n
a
n
c
e
and power
usage
-
I
t
s own loss detection and r
e
tr
ans
m
is
si
on to avoid the p
r
oblem
s T
C
P has in
wir
e
less networ
ks
-
Goal:
HTTP
equivalent
f
o
r WSNs
(R
epresentational Sta
t
e Tr
ansf
er: REST
)
R
P
L
(
R
outing P
r
otocol for Low powe
r
and Lossy
Networks)
-
E
ach node builds a dir
ected acy
c
lic graph
thr
ough which pac
k
ets can be efficiently
r
outed
to sink nodes
-
Fr
o
m
the sink,
RPL
builds r
outes to nodes
inside the networ
k which can distr
i
bute data to
sensor
nodes
-
contikiM
AC used as r
a
dio cy
cling protocol
-
ener
gy
consu
m
ption is
m
easur
ed usin
g
Contiki’s built in power profiler
2.
1.
Co
AP (
C
o
n
str
a
ined Ap
plicatio
n Proto
c
o
l
)
Wh
ile th
e M2M related
stan
d
a
rd
izatio
n
is
g
a
in
ing
m
o
m
e
n
t
u
m
, th
e Co
RE (Co
n
strained
RESTfu
l
En
vi
ro
nm
ent
s
) w
o
r
k
i
n
g
g
r
o
u
p
i
n
I
E
FT
(
I
nt
ernet
En
gi
nee
r
i
n
g
Tas
k
F
o
rc
e)
has l
a
unc
he
d t
h
e st
a
nda
rdi
zat
i
o
n
activ
ities for
Co
AP (C
on
strain
ed Env
i
ronmen
ts Ap
p
licatio
n
Pro
t
o
c
o
l
), 6
L
oWPAN’s
h
i
g
h
ap
p
licatio
n
p
r
o
t
o
c
o
l
, since 2
010
. Fi
g
u
re
1
sh
ows in
what p
o
s
ition
th
e
Co
AP is lo
cated
in
the M2
M
stan
d
a
rd
arch
itectu
r
e
[
1
2
]
.
A
s
sh
own
in
Figu
r
e
1, th
e ph
ysical
class (
P
HY) a
n
d m
e
dia-approach class (M
AC) a
r
e
base
d on the
IEEE
8
0
2
.
1
5
.
4
st
an
dar
d
fo
r l
o
w-
po
we
r se
ns
o
r
no
d.
6L
o
W
P
A
N
p
r
ot
oc
ol
i
s
l
o
cat
ed
i
n
A
d
a
p
t
a
t
i
o
n
cl
ass f
o
r t
h
e
interface
with IEEE 802.15.4 standard and network cl
ass whe
r
e IPv4 prot
ocol bel
o
ngs. C
o
AP is the
appl
i
cat
i
o
n
pr
o
t
ocol
fo
r t
h
e
hi
ghe
r t
r
a
n
s
p
ort
am
ong
t
h
ese
st
anda
r
d
s a
n
d
ap
pl
i
cat
i
on cl
ass
.
Th
e no
d
e
s p
r
op
er
fo
r
CoAP ap
p
lication
will
h
a
v
e
low-p
e
rform
a
n
ce CPUs and
l
o
w capacity RAM
an
d
R
O
M. It
is a p
r
o
t
o
c
o
l
fo
r
resource d
i
sco
v
e
ry,
m
u
ltic
ast su
ppo
rt, asy
mmetrical tra
n
j
ection
requ
est and
response, whic
h are base
d on Representational State Tran
sfer (RE
S
T) f
o
r asy
m
m
e
tr
ic
al tran
smitt
in
g o
f
an
ev
en
t correspon
d
i
n
g
to
t
h
e con
d
ition
s
o
f
d
e
vices con
s
titu
ting
Io
T d
e
v
i
ces.
Fig
u
re
1
.
CoAP in
M
2
M related
arch
itecture
The C
o
A
P
st
a
nda
r
d
i
zat
i
on a
r
eas
pu
r
p
o
r
t
e
d
by
C
o
R
E
wo
rki
n
g
g
r
o
u
p
fo
cus
o
n
ho
w t
o
desi
gn
t
h
e
m
e
t
hods
of
re
q
u
est
i
n
g res
o
urc
e
event
s
(e.
g
. t
e
m
p
erat
ur
e,
hu
m
i
di
t
y
) t
o
M
2
M
no
ds i
n
hi
g
h
er a
p
pl
i
cat
i
o
n
cl
ass
in
clu
d
i
n
g
th
e tran
spo
r
t
class with TCP and
UDP;
a
n
d in case
of
occurre
nce
of an event,
how t
o
asym
m
e
t
r
i
cal
ly
t
r
ansm
i
t
t
h
e reso
urce e
v
en
t
t
o
t
h
e node
s.
Whi
l
e
usi
n
g
HTTP
, C
o
A
P
i
s
di
ffere
nt
fr
o
m
t
h
e
exi
s
t
i
ng
HTT
P
i
n
t
h
at
i
t
su
pp
ort
s
bot
h
uni
ca
st
and m
u
l
t
i
cast
i
n
t
h
e U
D
P e
nvi
ro
nm
ent
and s
o
m
e
tim
es its n
ode
s
may tak
e
th
e ro
le of clien
t
, serv
er an
d pro
x
y
.
Evaluation Warning : The document was created with Spire.PDF for Python.
I
J
ECE
I
S
SN
:
208
8-8
7
0
8
Li
ght
Wei
g
h
t
R
out
i
n
g
Prot
oco
l
i
n
I
o
T
Ba
sed
Int
e
r
Devi
ce T
e
l
ecom
m
u
n
i
c
at
i
on
Wi
rel
e
ss...
.
(
H
ay
o
u
n
g
O
h
)
2
355
2.
2.
RPL
(R
ou
ti
ng
Pro
t
oc
ol
for
L
o
w
-
p
o
w
er a
nd L
o
ssy
Ne
t
w
orks)
R
P
L (I
Pv
6 R
o
ut
i
ng
Pr
ot
oc
ol
fo
r Lo
w-
p
o
w
e
r Los
s
y
Net
w
or
ks)
refe
rs t
o
t
h
e IP
v6
ro
ut
i
ng
pr
ot
oc
o
l
t
h
at
i
s
bei
n
g
pr
om
ot
ed f
o
r
st
anda
rdi
zat
i
o
n
by
t
h
e
IE
TF
R
O
LL
(R
out
i
ng
O
v
er
Lo
w-
po
we
r a
n
d
Lossy
net
w
or
ks
) w
o
r
k
i
n
g g
r
o
u
p
;
h
e
nce, i
t
i
s
cal
led as R
i
ppl
e.
RPL is d
e
sign
ed
t
o
ab
so
rb all irreg
u
l
arit
ies in
net
w
or
k e
n
vi
r
onm
ent
-
suc
h
a
s
l
o
w-
po
we
r i
n
IEEE
8
0
2
.
1
5.
4 a
n
d
el
ect
ri
c wi
re
com
m
uni
cat
i
ons
, a
n
d
noi
ses
etc.-and supports various routing
m
a
trixes to accomm
odate varying de
gree of require
m
e
nts in numerous
ap
p
lication
s
. Fo
r
th
is
pu
rpose,
a seg
m
en
t called
Obj
ec
tive Fun
c
tion
(OF) is created
to cov
e
r rou
tin
g
matrix
,
pat
h
opt
i
m
i
zation et
c. T
h
e
def
i
ni
t
i
ons i
n
t
h
e st
anda
rd c
o
ver
s
t
h
e ge
neral
c
ont
e
n
t
com
m
o
n
l
y
used i
n
a n
u
m
b
e
r
of
OF
s.
Whi
l
e
t
h
e R
P
L ob
ject
s
hav
e
a dest
i
n
at
i
o
n
-
base
d
di
rect
i
o
n, t
h
ey
are c
o
m
posed o
f
sev
e
ral
gra
p
h
s
(D
OD
A
G
s:
De
st
i
n
at
i
on
Ori
e
n
t
ed Di
rect
e
d
A
c
y
c
l
i
c
Grap
hs)
as sh
ow
n i
n
Fi
gu
re
2. T
h
e ra
n
k
s i
n
n
odes i
n
d
i
cat
e
the distance from
the rout
e DODGA. To c
o
m
pose DADAGs, each
node
peri
odically sends c
ont
rol m
e
ssages
-
DAG inform
ation
Object (DIO
)-containing inform
ation
on local links and ra
nks.
T
h
e node
s receivi
ng DIO
will eith
er p
a
rticip
ate in
a n
e
w DODAG to
select a p
a
re
n
t
n
o
d
for tran
smissio
n
at th
e least co
st, or m
a
in
tain
t
h
e sam
e
DIO
.
Fi
g
u
re
4
sh
ows
t
h
e t
y
pe
s
of
co
nt
r
o
l
m
e
ssages i
n
a
d
di
t
i
on t
o
DI
O
m
e
ssage, w
h
i
c
h ar
e
necessa
ry
f
o
r
t
h
e ope
rat
i
o
n of
R
P
L.
Fi
gu
re 2.
R
P
L ob
ject
a
n
d
d
e
st
i
n
at
i
on base
d DO
D
AGs:
Des
t
i
n
at
i
on Ori
e
nt
ed Di
rect
ed
Ac
y
c
l
i
c
Grap
hs
Fi
gu
re
3.
R
a
n
k
an
d
versi
o
n
de
fi
ni
t
i
ons
o
f
D
O
D
A
G
s
Fi
gu
re 4.
R
P
L cont
rol
m
e
ssag
e
s
R
P
L has
t
h
ree
t
r
ansm
i
ssi
on t
echni
que
s, i
.
e
.
,
dat
a
no
n-
st
ori
n
g
m
ode,
dat
a
st
ori
n
g m
ode a
n
d
a m
ode
pre
v
e
n
t
i
ng
da
t
a
t
r
ansm
i
ssi
on t
o
hi
g
h
e
r
hi
erarc
h
y
.
In
t
h
e dat
a
n
o
n
-st
o
ri
ng m
o
d
e
, eve
n
i
n
c
a
se o
f
com
m
unications am
ong t
h
e
neighboring term
inal nodes
,
the data s
h
oul
d
se
nd
upwa
rd to the
DODAG root
Evaluation Warning : The document was created with Spire.PDF for Python.
I
S
SN
:
2
088
-87
08
I
J
ECE
Vo
l. 6
,
N
o
. 5
,
O
c
tob
e
r
20
16
:
235
2
–
23
61
2
356
and t
h
en se
nd
downwa
rd t
o
the recei
ving node
s. In data
st
ori
ng m
ode, the data m
a
y not to send upward to the
root but bypa
s
s
through nei
g
hboring hi
ghe
r nod a
nd t
o
the receiving
nod. Rega
rdless
of the type, howeve
r
,
RPL is inh
e
rently ex
p
o
sed to
t
h
e three
p
r
ob
lem
s
as fo
llo
ws:
In
th
e RPL m
e
th
od
, nod
es are p
u
t
in
to
sleep
ing
m
o
d
e
fo
r en
erg
y
sav
i
ng an
d
th
us th
ey
m
a
y
fail
to
tim
e
ly respond or are s
u
scept
i
ble to
lo
w-power an
d
d
a
ta lo
ss,
wh
ich
m
a
y all
to
g
e
th
er l
ead
to
a lo
w rate o
f
d
a
ta su
ccess.
To
co
p
e
with th
is p
r
ob
lem
,
th
e RP
L m
e
t
h
od
u
tilizes DIO con
t
ro
l m
e
ssag
e
s6
in
case of
occurre
nce
of
any problem
in data tra
n
sm
iss
i
on.
Th
e RPL m
e
t
h
od
m
a
y n
o
t
co
m
p
letel
y
s
o
lv
e loo
p
p
r
ob
lem
s
. Acco
rd
ing
l
y, wh
en
ev
er a loo
p
in
terv
en
es, it is n
ecessary to
so
lv
e it in
q
u
i
ck
est m
a
n
n
e
r th
rou
g
h
loo
s
e av
o
i
d
a
n
ce
with
real-tim
e
d
e
tectio
n
,
u
tilizatio
n
o
f
DIO,
DIS and
DAO co
n
t
ro
l m
e
ssag
e
s callin
g
fo
r sm
all
o
v
e
rhead
s. Fo
r in
stan
ce, RPL in
tend
s to
tran
sm
it d
a
ta o
n
l
y to
a p
a
th
with
d
ecreasi
n
g
rank
s,
wh
ereb
y
l
o
o
p
m
a
y be avoi
ded
.
O
n
t
h
e cont
ra
ry
, i
f
d
a
t
a
i
s
tran
sm
it
ted
to
a p
a
th
with
increasing
ran
k
s
, th
e p
r
ob
ab
ility o
f
lo
op
o
c
cu
rren
ce
will b
e
h
e
ig
h
t
en
ed
.
It is
cruci
a
l
,
t
h
ere
f
o
r
e, t
h
at
t
h
e O
b
j
ect
i
v
e Fu
nct
i
o
n s
h
o
u
l
d
be
p
r
ope
rl
y
desi
gne
d t
o
acc
om
m
odat
e
r
out
i
n
g m
a
t
r
i
x
es
and
pat
h
o
p
t
i
m
i
zat
i
on t
o
m
eet t
h
e re
qui
rem
e
nt
s o
f
eac
h ap
p
l
i
cat
i
on, f
o
r
w
h
i
c
h t
h
e desi
gn
er sh
o
u
l
d
det
e
r
m
i
n
e
wh
et
h
e
r th
e
p
r
o
b
l
em
will b
e
su
rg
ically so
lved
with
i
n
th
e co
nfin
e
o
f
th
e area or to
b
e
solv
ed
b
y
referri
n
g
t
o
th
e ov
erall syste
m
.
R
P
L has
pr
o
p
o
s
ed a t
ech
ni
q
u
e
t
o
t
r
ansm
i
t
dat
a
at
l
o
w p
o
w
e
r i
n
dy
nam
i
c
envi
ro
nm
ent
as op
p
o
se
d t
o
ISA
1
0
0
.
11
a or wireless HART. Still,
h
o
w
ev
er, RPL is d
e
e
m
ed
to
b
e
ill
-equ
ipp
e
d
to
han
d
l
e th
e prob
l
e
m
o
f
d
a
ta d
i
scon
n
e
ctio
n
.
It attemp
ts to so
l
v
e it
th
ro
ugh
DIO
po
sitio
n
i
n
g
,
wh
i
c
h
is
d
eem
ed
to
b
e
im
p
e
rfect
as it
i
n
cu
rs
ove
r
h
ea
ds
fo
r m
a
i
n
t
a
i
n
i
ng a
n
d
up
dat
i
ng
D
O
D
A
G
ea
ch t
i
m
e a pro
b
l
e
m
occu
rs.
The LL
N
(L
o
w
-
p
o
w
e
r
a
nd
Lossy
Net
w
or
ks)
r
out
e
r
re
fer
s
t
o
l
o
w-
p
o
we
r
l
o
ss
net
w
or
ks.
Thi
s
sc
hem
e
is su
bj
ect to
t
h
e con
s
trai
n
t
deriv
i
ng
fro
m
t
h
e use of li
m
i
t
e
d
m
e
m
o
ry, wh
ich
m
a
k
e
s it h
a
rd
to
m
a
in
tain
th
e
dest
i
n
at
i
o
n pat
h
i
n
f
o
rm
at
i
on i
n
exces
s of t
h
e
sm
al
l
am
ount
of
defa
ul
t
ro
ut
er i
n
f
o
rm
at
i
on.
For i
n
st
a
n
ce,
un
de
r
t
h
e I
P
v
6
base
d
net
w
o
r
k
p
r
ot
o
c
ol
st
an
da
rds
i
n
IEEE
8
0
2
.
1
5.
4, t
h
e e
n
vi
ro
nm
ent
com
p
ri
ses l
o
w-
po
we
r,
l
o
w
-
p
r
ice, l
o
w-capab
ility (8
b
it-micro
p
r
o
cessors,
o
n
e
d
i
g
it
KB RAM) and
low sp
eed
(u
p
t
o
250
kbp
s) and
accordingly is
constraine
d t
o
limited sc
ope of devices
a
s
presented
in
T
a
bl
e
2 for sizes
and
Ta
ble 3
for roles.
Table 2. De
vice
classifications
ba
sed
on
th
e
li
mited
m
e
m
o
r
y
size
Data Siz
e
Code Size
Class 1
~ 10 KB
~ 100 KB
Class 2
~ 50 KB
~ 250 KB
Tabl
e
3.
De
vi
ce r
o
l
e
base
d cl
assi
fi
cat
i
on
wi
t
h
t
h
e
l
i
m
i
t
e
d
m
e
m
o
ry
Constr
ained nodes
Nodes talking to
constr
ained nodes
Gateway
s
/Pr
oxies
-
Sleepy
nodes
-
T
o
sleepy
nodes
-
T
o
sleepy
nodes
-
Nor
m
all
y
a
l
wa
ys a
live
-
Could be alway
s
alive
In c
o
n
s
eq
ue
nc
e, i
t
i
s
requi
re
d t
h
at
t
h
e LL
N r
out
e
r
i
n
co
nst
r
ai
ne
d e
nvi
r
onm
ent
sho
u
l
d
be abl
e
t
o
main
tain
th
e co
nn
ectiv
ity in
fo
rm
atio
n
an
d
th
e p
a
th
info
rmatio
n
for th
e tran
sm
issio
n
o
f
d
a
tagram
. It also
n
eeds IPv
6
sou
r
ce
rou
ting
fo
r th
e tran
sm
i
ssio
n
o
f
d
i
agra
m
.
Min
d
f
u
l
of th
is, th
is p
a
p
e
r
will fo
cus o
n
th
e
devel
opm
ent
of t
h
e t
e
c
hni
q
u
e t
o
fi
n
d
IP
v6
nei
g
h
b
o
rs
(i
ncl
u
di
n
g
Io
T
t
e
rm
i
n
al
’s l
i
ght
-
w
ei
g
h
t
aut
o
m
a
t
i
c
ad
dress settin
g) and
ligh
t
-weig
h
t
rou
ting
p
r
oto
c
o
l
s,
wh
ic
h
are essen
tial for in
ter-RPL routers transm
issi
o
n
of
datag
r
am
in In
fra
-f
ree e
nvir
o
nm
ent.
2.
3.
Other
L
i
gh
t-
Wei
g
h
t
Ro
uti
n
g Pro
t
oc
ol
K
unj
an Patel has pr
opo
sed a
lig
h
t
-w
eigh
t rou
tin
g pr
o
t
o
c
o
l
w
ith
th
e eff
ect o
f
r
e
d
u
cing
un
n
ecessary
m
e
ssages by
m
a
ki
ng t
h
e r
o
ut
i
n
g
p
r
ot
ocol
be act
i
v
at
e
d
onl
y
wi
t
h
va
ri
ous
re
pl
y
i
ng
m
e
ssages f
r
om
u
n
i
cast
ope
rat
i
o
n i
n
a sens
or n
e
t
w
or
k
(ack
no
wl
ed
ge
m
e
nt
) and
wi
t
h
i
n
t
i
m
e
l
i
m
i
t
s
(t
im
eout
sche
m
e
s). Thi
s
ap
pr
oac
h
h
a
s still a lo
t
of con
t
ro
l m
e
ssag
e
s to b
e
ex
ch
ang
e
d
in to
tal sin
ce
d
a
ta m
a
y b
e
ex
ch
ang
e
d
with
in
lim
i
t
e
d
tim
e
spa
n
a
n
d the
perform
a
nce impr
ovem
ent is const
r
aine
d.
[1
3]
has
p
r
o
p
o
se
d a l
i
g
ht
-w
ei
ght
s
o
u
r
ce
r
out
i
n
g
pr
ot
oc
o
l
(PSR
:
A
Li
g
h
t
w
ei
g
h
t
P
r
oa
ct
i
v
e So
urc
e
Ro
u
ting
Pro
t
oco
l
For Mo
b
i
l
e
Ad
Ho
c Net
w
orks) th
at is cap
ab
le to
k
now all p
a
th
s from th
e so
u
r
ce t
o
th
e
dest
i
n
at
i
o
n i
n
m
obi
l
e
wi
rel
e
ss net
w
o
r
k en
vi
ro
nm
ent
.
Thi
s
t
echni
q
u
e o
p
e
r
at
es on a bi
na
ry
-t
ree base
d r
out
i
n
g
p
r
o
t
o
c
o
l
enab
l
i
n
g
t
o
u
tilize
larg
er in
form
a
tio
n
o
n
t
o
p
o
l
og
y th
rou
g
h
small o
v
e
rh
eads. Th
is techniq
u
e
is,
ho
we
ver
,
l
i
m
i
ted si
nce
i
t
i
s
o
p
era
b
l
e
o
n
l
y
o
n
a
bi
na
ry
-t
ree
base
d r
o
ut
i
ng
pr
ot
oc
ol
.
Due
t
o
t
h
e t
o
t
a
l
v
o
l
u
m
e
of
cont
rol
m
e
ssages t
o
co
n
v
ert
t
o
p
o
l
o
gy
i
n
t
o
a bi
na
ry
-t
ree
sy
st
em
, t
h
e ov
eral
l
am
ount
o
f
co
nt
r
o
l
m
e
ssages i
s
still su
b
s
tan
tially larg
e.
Evaluation Warning : The document was created with Spire.PDF for Python.
I
J
ECE
I
S
SN
:
208
8-8
7
0
8
Li
ght
Wei
g
h
t
R
out
i
n
g
Prot
oco
l
i
n
I
o
T
Ba
sed
Int
e
r
Devi
ce T
e
l
ecom
m
u
n
i
c
at
i
on
Wi
rel
e
ss...
.
(
H
ay
o
u
n
g
O
h
)
2
357
H
u
Sh
e [14
]
pr
opo
sed a techn
i
qu
e
of c
o
llecting real
-tim
e local traf
fic inform
ation in a l
i
ght-weight
m
o
d
e
, wh
ich
is ap
p
licab
le in
an
au
to
m
o
bile wirele
ss network
env
i
ron
m
en
t. For this o
b
j
ectiv
e,
Hu Sh
e
su
gg
ested
to
ap
p
l
y a tech
n
i
qu
e effectiv
ely m
o
n
ito
rin
g
th
e lin
k
con
d
ition
s
and
tran
smittin
g
d
a
ta th
ro
ugh
peri
odi
c beac
o
n
m
e
ssages. In
wi
rel
e
ss net
w
or
k en
vi
r
o
nm
ent
sur
r
o
u
n
d
i
n
g
a
m
ovi
ng a
u
t
o
m
obi
l
e
, i
t
i
s
avai
l
a
bl
e
to
tran
sm
it d
a
ta to
th
e destinatio
n
with
t
h
e
min
i
m
u
m
n
u
m
b
e
r
o
f
t
r
an
sm
i
ssio
n
;
n
e
v
e
rth
e
less, to
p
e
rform th
e
i
n
t
e
nde
d f
u
nct
i
on, t
h
e sy
st
e
m
shoul
d peri
odi
cal
l
y
excha
nge c
ont
rol
m
e
ssages
,
co
nfi
r
m
t
h
e l
i
nk st
atus a
n
d
sto
r
e t
h
e info
rmatio
n
,
wh
ereb
y th
e t
o
tal vo
lu
m
e
o
f
con
t
ro
l
m
e
ssag
e
s to
be tran
sm
itted
an
d stored m
a
y
n
o
t
b
e
si
gni
fi
ca
nt
l
y
reduce
d
.
The
exi
s
t
i
ng re
searc
h
e
s
ha
ve f
o
c
u
sed
on
t
h
e cat
eg
o
r
i
zat
i
on
of c
o
n
t
rol
m
e
ssage t
y
pes
for ligh
t
-weigh
t tran
sm
issio
n
o
f
d
a
ta to
t
h
e d
e
stin
ation
,
o
r
resetting
t
h
e
ov
erall p
a
th for d
a
ta
tran
smissio
n
t
h
r
o
u
g
h
peri
o
d
i
c
excha
n
ge of
dat
a
.
On
th
e co
n
t
rary, th
is p
a
p
e
r propo
ses to
u
tilize b
l
o
o
m
filterin
g
expression to
th
e effect o
f
redu
cing
th
e v
o
l
u
m
e o
f
d
a
ta ex
ch
an
ges an
d
fu
r
t
h
e
r ach
iev
i
ng
lig
h
t
-w
eigh
t in
no
d
e
recogn
itio
n
add
r
ess, n
e
i
g
hbor
d
i
scov
ery
and ro
u
ting p
a
t
h
, wh
ich h
a
s all tog
e
th
er resu
l
t
ed
in a l
o
v
e
lev
e
l of
ov
erhead
o
f
to
tal co
n
t
ro
l
m
e
ssages. I
n
part
i
c
ul
a
r
, t
h
e
pr
op
ose
d
m
e
t
h
o
d
has
-
f
o
r t
h
e fi
rst
t
i
m
e-
com
posed t
h
e
chan
nel
co
n
d
i
t
i
ons
in
curring
a lo
t
o
f
d
a
ta lo
ss and
con
d
u
c
ted
the p
e
rform
a
n
ce testin
g
;
th
is sch
e
m
e
en
ab
les th
e d
e
v
i
ces to
co
un
ter
an
o
ccurren
c
e of
d
a
ta lo
ss
b
y
rerou
ting
t
o
m
u
ltip
le
p
a
th
s av
ailab
l
e i
n
th
e lo
cal area b
y
referri
ng
to th
e
enha
nce
d
ran
k
i
ng t
e
c
hni
qu
es
. It
was
dem
onst
r
at
ed
t
h
at
t
h
i
s
schem
e
has
achi
e
ve
d
up
t
o
4
0
%
pe
rf
orm
a
nce
i
m
p
r
ov
em
en
t i
n
co
m
p
ariso
n
to
th
e ex
isting
RPL rou
tin
g pro
t
o
c
o
l
s.
3.
ENHANCED RPL-B
A
SED LIGHT
WEIGHT RO
UTI
N
G
PROTOCOL IN IOT
-
BASED I
N
TER-
DEVI
CE W
I
RELESS
CO
MM
U
N
IC
AT
IONS
EN
VI
R
O
N
M
ENT
3.
1.
Light w
e
ig
ht
I
P
v
6
addres
s s
e
ttin
g
on
the
b
a
si
s of bloom filter
and
en
hanced r
a
nkin
g
meth
o
d
Th
e rap
i
d
in
crease in
Io
T
d
e
v
i
ces and
sup
p
o
r
t fo
r
h
y
p
e
r-co
nn
ectiv
ity will req
u
i
re a larger vo
lu
m
e
o
f
m
e
ssage e
x
cha
nge
s r
e
l
a
t
e
d t
o
se
nsi
n
g
dat
a
, I
P
v
6
a
d
dres
s
an
d
nei
g
h
b
o
r
di
sc
ove
ry
.
I
n
t
h
e m
eant
i
m
e
, I
o
T
t
e
rm
i
n
al
s and
LLN r
o
ut
ers a
r
e rel
a
t
e
d t
o
ul
t
r
a-l
i
g
ht
ness
, l
o
w-
po
we
r an
d l
o
ss
occu
rre
nce
;
hence, s
u
c
h
d
e
vi
ces
sho
u
l
d
st
ore a
m
i
nim
u
m
am
o
unt
of
dat
a
. F
u
rt
her, a s
o
l
u
t
i
on
nee
d
s t
o
be
fo
un
d t
o
m
eet
t
h
e req
u
i
r
em
ent
t
o
transm
it data through a c
o
nsi
s
tent pat
h
to t
h
e destination.
It is neces
sary, there
f
ore,
that
addresse
s s
h
ould
be
co
m
p
ressed to
th
e m
a
x
i
m
u
m
b
y
u
tilizin
g a lig
h
t
-wei
g
h
t
no
tatio
n
m
e
th
o
d
.
Fo
r th
e setting o
f
lig
h
t
-wei
g
h
t IPv6
add
r
esses, th
is
p
a
p
e
r
u
tilizes th
e b
l
oo
m
filter an
d
an
en
h
a
n
ced
ran
k
i
n
g m
e
t
hod. In t
h
e e
x
i
s
t
i
ng R
P
L m
e
t
h
ods
, i
n
o
r
de
r t
o
i
d
ent
i
f
y
t
h
e l
e
vel
of
dat
a
t
r
ansm
i
ssi
on, ra
nk
ha
s
b
een
u
tilized
as a scale in
d
i
catin
g
th
e
d
e
p
t
h fro
m
th
e ro
o
t
n
o
d
e
. Con
t
rary to
th
is, t
h
is
p
a
p
e
r ad
op
ts a n
e
w
co
n
c
ep
t o
f
rank
(‘en
h
a
n
c
ed
ran
k
’), wh
ich
i
n
clu
d
e
s
add
itio
nal in
fo
rm
atio
n
referring to
a relativ
e lo
cation
.
Fo
r
t
h
i
s
p
u
r
p
o
se,
a
new
sec
o
n
d
i
n
dex
i
s
a
p
pl
i
e
d t
o
i
ndi
cat
e t
h
e l
o
cat
i
o
n
of
a c
h
i
l
d
n
o
d
e a
p
art
f
r
om
t
h
e
pare
nt
no
d.
Fo
r i
n
stan
ce, in
(3
,0
) t
h
e rank
is 3
,
i
n
d
i
catin
g
its lo
catio
n
to
th
e left from th
e relativ
e p
a
ren
t
nod
e (2,0). In
(3,1), t
h
e
rank
is also
3
,
yet it
is lo
cated
t
o
the righ
t sid
e
of t
h
e
(2,0)
n
o
d
e
.
In the RPL method, the ne
i
g
hboring nodes
with the sam
e
rank
m
eans that they are placed on the
sam
e
l
e
vel
fro
m
t
h
e root
n
o
d
e. Acc
o
r
d
i
n
gl
y
,
i
n
o
r
de
r to
avo
i
d
loop
s
an
d
so
lid
ly tran
sm
it
d
a
ta, th
e p
a
th
sho
u
l
d
be
co
n
cent
r
at
ed
o
n
t
h
e
nei
g
hb
o
r
i
n
g
no
des
o
n
l
o
wer
ra
nks
. T
h
e
pr
op
ose
d
e
nha
nce
d
R
P
L
(eR
P
L
)
m
e
thod
will e
n
sure t
h
at data shall
be tra
n
sm
itted
through a s
o
lid
pa
th alon
g ince
ssant c
o
m
b
inations
rega
rdl
e
ss
of t
h
e val
u
e o
f
rel
a
t
i
v
e l
o
cat
i
ons
,
pr
ovi
ded t
h
e r
a
nk
s are sam
e
or l
o
we
r. A
s
i
ndi
cat
ed i
n
Fi
g
u
re
5
,
the propose
d
m
e
thod
utilizes light-weighte
d IPv6 a
d
dres
ses by
refe
rri
ng to the
3 m
u
ltiple paths
from
the
so
urce no
d
e
to
th
e
d
e
stin
atio
n.
Fi
gu
re
5.
A
n
e
nha
nce
d
R
P
L
base
d l
i
g
ht
-wei
ght
r
out
i
n
g
pr
o
t
ocol
Evaluation Warning : The document was created with Spire.PDF for Python.
I
S
SN
:
2
088
-87
08
I
J
ECE
Vo
l. 6
,
N
o
. 5
,
O
c
tob
e
r
20
16
:
235
2
–
23
61
2
358
Fig
u
r
e
6(
a)
sho
w
s th
e
p
r
o
cess o
f
id
en
tif
ying
no
d
e
s
o
n
th
e b
a
sis o
f
a no
de id
en
tif
ier
cr
eated
th
ro
ugh
the bloom
filte
ring, which
will replace
IPv6 addresses.
For instance, Node
1 indicates loc
a
tion 1, 6 and
10 set
at 1
b
it; No
d
e
2
lo
catio
n
2
,
3, 7
set at 1
b
it;
Nod
e
3
lo
catio
n
2
,
3
,
8
set at b
it 1
.
If a
p
a
th-settin
g
con
t
ro
l-
messag
e
p
a
ck
et is tran
sm
it
ted
fro
m
th
e so
urce to
th
e
d
e
stinatio
n
throug
h
Nod
e
1
,
2
and
3
,
t
h
e b
l
o
o
m
filter at
th
e d
e
stin
ation will h
a
v
e
th
e fin
a
l resu
lts lo
catio
n
1
,
2,
3, 6
,
7, 8
,
1
0
al
l set at
1
b
it. Th
e d
e
stin
ati
o
n
will
co
m
p
are th
e b
l
o
o
m
filter o
f
neig
hb
oring
n
o
d
e
s with
t
h
e fi
n
a
l b
l
oo
m
filer co
n
t
ain
i
n
g
l
o
catio
n
s
as ch
eck
e
d
1
b
it.
Fig
u
re
6
(
b) sho
w
s a m
u
lti-h
u
b
scen
ari
o
wh
erein
each
no
d
e
is exp
r
essed i
n
th
e 10-b
it
b
l
o
o
m
filter in
a co
nd
ition
that th
ere are m
u
ltip
le p
a
th
s tran
sm
it
tin
g
d
a
t
a
fro
m
th
e sou
r
ce t
o
th
e
d
e
stin
atio
n
.
Figure 6(c)
shows t
h
e
procedures
how t
h
e
bloom
-filter table m
a
nage
s each
of the m
u
ltiple path
s transm
it
ting dat
a
from
th
e so
urce to the no
d
e
(1
,0
) immed
i
ately p
r
io
r to
th
e d
e
stin
atio
n nod
e.
Howev
e
r, th
ere are limitat
i
o
n
s
with
th
e
b
l
o
o
m
filter
v
a
lu
es in
t
h
at th
e v
a
lu
es m
a
y o
v
e
rlap
or
b
e
inaccurate in
the de
gree
of rec
o
gnitio
n.
Acc
o
rdingly, the
propose
d
m
e
thod solves this
problem
by
ad
d
ition
a
lly u
tilizin
g
th
e enh
a
n
ced
ran
k
th
at
is to
id
en
tify
th
e relativ
e lo
catio
n
of ch
il
d
n
o
d
e
s. In
th
e relev
a
nt
code
s, t
h
e i
n
f
o
rm
at
i
on co
nt
ai
ns c
o
m
p
ress
ed
n
o
t
a
t
i
ons
nam
i
ng t
h
e
n
e
i
g
h
b
o
r
i
n
g
n
o
d
es,
w
h
i
c
h
m
a
ke i
t
i
m
p
o
ssib
l
e to
r
ecov
e
r
t
h
e full n
a
m
e
s o
f
n
e
ig
hb
or
ing
nodes. I
n
stead
,
t
h
e co
m
p
r
e
ssed n
o
t
ation
allow
s
th
e
d
e
stin
ation
to
co
nfirm
wh
eth
e
r on
e sp
ecific
n
e
igh
boring
nod
e’s
n
a
m
e
is in
clu
d
e
d
in
th
e set o
f
th
e n
e
ighb
oring
nodes list of t
h
e sender. T
h
is
m
eans, of course, that
an
erro
r m
a
y b
e
in
v
ited
du
e to
th
e
lo
ss of informatio
n
wh
ile testing
t
h
e ex
isten
ce
of th
e
n
e
igh
boring
n
o
d
e
s b
y
referring
t
o
th
e b
l
oo
m
filter co
d
e
.
If it is
j
udg
ed
th
at th
e
n
e
igh
b
o
r
i
n
g
no
d
e
s exist wh
ile th
e t
r
u
t
h
is
‘n
o
t
’, it
is an
erro
r false n
e
g
a
tiv
e.
To p
r
eve
n
t
a f
a
i
l
u
re i
n
di
sc
o
v
eri
ng t
h
e
nei
g
h
b
o
ri
ng
no
de
s, t
h
e bl
o
o
m
fil
t
e
r codes
hav
e
been
desi
g
n
e
d
i
n
a
con
d
e
n
se
d f
o
r
m
at
refl
ect
i
ng
t
h
e en
ha
nce
d
r
a
nk
s.
I
n
ot
he
r words, eve
n
i
n
case
th
er
e are sev
e
r
a
l
n
e
ighb
or
ing
n
o
d
e
s b
e
l
o
n
g
i
n
g
to
th
e sam
e
b
l
o
o
m
filter c
o
d
e
, th
ey are differen
t
in
th
e ch
ild
no
d
e
lo
catio
n
s
relativ
e to
th
e
location
of the
pare
nt node
s; accordingl
y, the
enha
nce
d
ra
nk identifier
will
be able to solve the inaccurac
y
of
th
e b
l
o
o
m
filter co
d
e
s.
In c
ons
eque
nc
e, the proposed
m
e
thod will be able
to discover the light-weighted
IP
v6 a
d
dresses a
nd
n
e
igh
boring
no
d
e
s an
d
set
lig
h
t
-weigh
ted ro
u
t
i
n
g
pr
o
t
oco
l
s b
y
u
tilizi
n
g
b
l
oo
m
file
r co
d
e
s con
t
ain
i
n
g
in
fo
rm
atio
n
relatin
g
to th
e
ov
erall
p
a
th and
relativ
e
lo
catio
n
s
o
f
ch
ild
n
o
d
e
s.
Un
like th
e ex
isting RPL
m
e
thods
, the proposed m
e
thod m
a
intains va
rious child pa
t
h
s whose pare
nt nodes are i
m
plied in bloom
filter
co
d
e
s,
wh
ereby it will co
un
ter errors i
n
IoT-b
a
sed
wi
reless n
e
t
w
orks by referring
t
o
o
t
h
e
r av
ailab
l
e lig
h
t
-
weigh
t
ed
p
a
t
h
s in
th
e lo
cal area.
3.
2.
L
i
ght
-
w
e
i
g
hte
d
Nei
g
hb
or
Se
archi
n
g
Met
h
od
on
the
b
a
si
s o
f
bl
oo
m fi
l
t
er
In
ge
neral
,
a
com
m
uni
cat
i
on t
e
rm
i
n
al
needs t
o
sen
d
p
e
ri
o
d
i
c
si
g
n
al
s
-
e.
g.
beaco
n
-
c
ont
ai
ni
ng
i
t
s
id
en
tif
ier to id
en
tif
y an
y
neig
hb
or
ing
termin
als an
d sen
d
m
e
ssag
e
s
co
n
t
ain
i
n
g
info
r
m
atio
n
about th
e
nei
g
hb
o
r
i
n
g
n
ode
s s
o
t
h
at
t
h
ey
m
a
y
be di
sco
v
ere
d
.
Ne
vert
hel
e
ss, si
g
n
al
s c
ont
ai
ni
n
g
t
h
e
nam
e
an
d l
i
s
t
o
f
neighboring nodes will
necessitate
heav
y amount
of informati
on,
which is not suitabl
e for a l
o
w-power
lossy
net
w
or
k e
n
vi
ro
nm
ent
.
I
n
th
e pro
p
o
s
ed
m
e
th
o
d
, to
red
u
ce th
e
n
u
m
b
e
r
of
b
its r
e
qu
ir
ed
to
ann
oun
ce th
e n
e
ighbo
r
i
n
g
nod
e
list, th
e in
fo
rm
atio
n
relating
t
o
th
e
n
e
ighb
orin
g
no
d
e
s
on
t
h
e path
link
i
ng th
e source and
th
e
d
e
stin
ati
o
n
wil
l
b
e
exp
r
essed
i
n
con
d
e
n
s
ed
b
l
o
o
m
filer co
d
e
s an
d
m
a
n
a
g
e
d in
th
e b
l
oo
m
f
ilter tab
l
e. Fo
r in
stan
ce, th
e blo
o
m
-
fi
l
e
r ba
sed
nei
g
h
b
o
r
m
a
nagem
e
nt
t
a
bl
e co
n
t
ai
ns t
h
e c
h
i
l
d
no
des
-
(
2
,
1
)
,
(2
,0
), (1
,1
)-a
n
d
t
h
e dest
i
n
at
i
o
n no
de
.
In case
of
Node (1.0), the
Node’s
bl
oom
filter
values
indicating t
h
e
re
lative l
o
cation of
each
c
h
ild
node a
nd
th
e b
l
oo
m
fil
t
e
r v
a
lu
e im
p
l
yin
g
th
e ov
erall p
a
th
in
clu
d
i
ng
th
e in
termed
iary n
o
d
e
s th
rou
g
h
tran
smissio
n
process, will be
m
a
naged
by the releva
nt table. If
No
de (1,0)
has received a bloom
filt
er data, as expresse
d
11
1
1
0
0
0
0
0
0
, t
h
e bl
o
o
m
fi
l
e
r
val
u
es of t
h
e
nei
g
h
b
o
ri
n
g
no
de f
r
om
Node (1
,0
) m
a
y incl
u
d
e o
n
l
y
one, i
.
e
.
(011
100
000
0)
fro
m
th
e can
d
i
d
a
tes of (0
0000
110
101
), (0
11
100
000
0) and (00
000
110
01). Th
erefo
r
e, it
w
ill b
e
id
en
tified th
at t
h
e
d
a
ta h
a
s come fro
m
th
e sou
r
ce
, to (
3
,
1
)
,
t
o
(1,1) a
n
d fi
nally to (1,0).
Evaluation Warning : The document was created with Spire.PDF for Python.
I
J
ECE
I
S
SN
:
208
8-8
7
0
8
Li
ght
Wei
g
h
t
R
out
i
n
g
Prot
oco
l
i
n
I
o
T
Ba
sed
Int
e
r
Devi
ce T
e
l
ecom
m
u
n
i
c
at
i
on
Wi
rel
e
ss...
.
(
H
ay
o
u
n
g
O
h
)
2
359
Fig
u
re
6
.
(a) B
l
o
o
m
filter b
a
sed
ligh
t
-weigh
t IPv
6
ad
dress,
(b) Th
e m
u
lti-h
o
p
scen
ario
with
Blo
o
m
filter
base
d l
i
g
ht
-wei
ght
IP
v
6
a
d
d
r
e
sses (c
) Li
ght
-
w
ei
g
h
t
e
d
va
ri
o
u
s
ro
ut
i
n
g
ro
ut
es est
a
bl
i
s
hm
ent
i
n
eR
PL
4.
PERFO
R
MA
NCE E
V
ALU
A
TIO
N
For
t
h
e
per
f
o
r
m
a
nce assess
m
e
nt
of t
h
e
p
r
o
p
o
sed m
e
t
h
o
d
,
NS
-3
(Net
wo
rk
Si
m
u
l
a
t
o
r-
3)
, o
n
e
of
ev
en
t
-
driv
en
si
m
u
la
to
rs,
h
a
s
b
een u
tilized
t
o
assess th
e resu
lts fro
m
th
e
settin
g
o
f
l
o
w-p
o
wer lo
ssy mu
lti-hu
b
net
w
or
k i
n
t
h
e no
-st
o
ra
ge
m
ode, as pre
s
ent
e
d i
n
Fi
gu
re 6
(
c
)
. To creat
e a lossy
net
w
or
k e
nvi
ro
nm
ent
,
vari
o
u
s
scen
ari
o
s
h
a
v
e
b
e
en
co
n
s
i
d
ered
to reflect the p
r
ob
ab
ility of lin
k tran
sm
is
sio
n
failure-n
orm
a
l, lo
g
-
normal o
r
m
i
xed di
st
ri
b
u
t
i
on;
i
n
case o
f
n
o
n
-
exi
s
t
e
nc
e of dat
a
t
r
a
n
s
m
i
ssi
on pat
h
, t
h
e pat
h
has b
een re
ro
ut
ed t
o
t
h
e
DODAG
ro
o
t
b
y
u
tilizin
g
t
h
e lo
cal sch
e
m
e
(lo
cal
rep
a
ir
sch
e
m
e
), th
e ov
erall sch
e
m
e
(b
est av
erag
e
rep
a
ir
schem
e
) or
t
h
e
sim
u
l
t
a
neous
a
ppl
i
cat
i
o
n
of
b
o
t
h
schem
e
s (l
ocal
an
d
best
a
v
era
g
e
repai
r
s
c
hem
e
).
The l
o
cal
re
p
a
i
r
schem
e
i
s
a ki
nd
of
g
r
eedy
m
e
t
hod,
foc
u
si
n
g
o
n
t
h
e best
l
i
nk
am
ong t
h
e
nei
g
hb
o
r
i
n
g n
ode
wi
rel
e
ss l
i
nks;
t
h
e best
average r
e
pai
r
schem
e
i
n
t
e
nds t
o
sel
ect
t
h
e ove
ral
l
favo
ra
bl
e
wireless link
fro
m
th
e so
urce
to
th
e
d
e
stin
atio
n
;
the lo
cal an
d
b
e
st av
erage rep
a
i
r
sch
e
m
e
u
tilizes th
e mix
e
d
po
ol
of
b
o
t
h
t
echni
que
s.
The R
P
L
m
e
t
h
od
bel
o
n
g
s t
o
t
h
e
best
ave
r
a
g
e repai
r
sc
hem
e
w
h
erei
n
D
O
D
A
G
i
s
pr
o
duc
ed i
n
va
ri
o
u
s
versi
o
ns and ranks are set thereto. If we a
ssum
e
o
ccurre
nce of problem
s
such as
nod
es in
r
a
n
d
o
m
sleep
ing
Evaluation Warning : The document was created with Spire.PDF for Python.
I
S
SN
:
2
088
-87
08
I
J
ECE
Vo
l. 6
,
N
o
. 5
,
O
c
tob
e
r
20
16
:
235
2
–
23
61
2
360
m
ode, link
cha
nnel e
r
rors, l
o
op problem
s, we a
r
e
deem
ed
to
face limitations
in s
o
lv
i
n
g the
problem
s
through
dy
nam
i
c
m
e
t
h
ods
. In co
nt
ra
st
, t
h
e pro
p
o
se
d m
e
t
hod (l
oca
l
& best
average repai
r
sche
m
e
) has adde
d
a new
lo
cal so
lu
tion (lo
cal rep
a
ir sch
e
m
e
) capab
le to
u
tilize
v
a
ri
o
u
s
p
a
t
h
s on
th
e
b
a
si
s o
f
enh
a
n
ced rank
s
co
nsid
eri
n
g th
e relativ
e lo
cati
o
n
s
.
The
res
u
l
t
s are at
l
east
4
0
perce
n
t
i
m
provem
e
nt
i
n
per
f
o
r
m
a
nce.
Fig
u
re
7
sho
w
s th
e cu
m
u
lati
v
e
d
i
stribu
tio
n
fun
c
tion
in
case th
e
wireless l
i
n
k
errors are related
to
th
e
n
o
rm
al
d
i
stribu
tio
n
;
Figu
re 8 sh
ows th
e cum
u
la
tiv
e d
i
strib
u
tion
fu
n
c
ti
on
in
case th
e same erro
rs are related
to
th
e log
-
no
rm
al
d
i
stribu
tion
.
The
per
f
o
r
m
a
nce o
f
t
h
ree
m
e
t
hods
has
been a
ssesse
d
agai
nst
t
h
e
o
p
t
i
m
a
l
repai
r
schem
e
i
n
t
h
e
si
t
u
at
i
on
whe
r
e t
h
e wi
rel
e
ss
l
i
nk er
ro
rs
d
i
spl
a
y
dy
nam
i
c
m
ovem
e
nt
s on t
h
e ba
si
s of eac
h
di
st
ri
but
i
o
n
function.
It is
intuitively apparent
that t
h
e
proposed m
e
thod (l
ocal &
be
st
avera
g
e
repair schem
e
) shows the
least d
i
fferen
c
es fro
m
th
e op
ti
m
a
l rep
a
ir sch
e
m
e
sin
ce it
u
tilizes th
e op
portun
ities in
tran
sm
itt
in
g
data b
y
referring
t
o
o
t
her
p
a
th
fro
m
th
e m
u
lt
ip
le op
tio
n
s
in th
e l
o
cal area i
n
case
of occ
u
rrence
of
wireless link l
o
ss in
th
e orig
i
n
al p
a
t
h
.
Gi
ve
n t
h
e I
o
T
based
wi
rel
e
s
s
i
n
t
e
r-
devi
ces
com
m
uni
cat
i
o
ns en
vi
r
o
nm
ent
i
s
not
fee fr
o
m
freq
u
ent
erro
r
o
c
cu
rrence, th
e m
e
th
o
d
co
nsid
eri
n
g lo
cal v
a
l
u
es
rat
h
er t
h
an
av
erag
e v
a
l
u
es
will h
a
v
e
h
i
g
h
e
r lev
e
l of
ap
p
licab
ility an
d goo
d p
e
rforman
ce.
Fig
u
re
7
.
CDF
with
th
e norm
a
l d
i
stribu
tion
of wi
reless link
erro
rs
Fig
u
re
8
.
CDF
with
th
e log
-
norm
a
l
di
st
ri
but
i
o
n
o
f
wi
rel
e
ss l
i
nk e
r
r
o
rs
5.
CO
NCL
USI
O
N
Thi
s
pa
per ha
s
pro
p
o
se
d IP
v
6
nei
g
h
b
o
r
di
s
c
ove
ry
m
e
t
hod
i
n
cl
udi
n
g
I
o
T
devi
ces’ a
u
t
o
m
a
t
i
c
l
i
ght
-
wei
g
ht
ad
dres
s
set
t
i
ng an
d en
hance
d
R
P
L
-
b
a
sed l
i
g
ht
wei
g
ht
ro
ut
i
n
g p
r
ot
ocol
i
n
t
h
e I
o
T
-
base
d
wi
rel
e
s
s
i
n
t
e
r-
Evaluation Warning : The document was created with Spire.PDF for Python.
I
J
ECE
I
S
SN
:
208
8-8
7
0
8
Li
ght
Wei
g
h
t
R
out
i
n
g
Prot
oco
l
i
n
I
o
T
Ba
sed
Int
e
r
Devi
ce T
e
l
ecom
m
u
n
i
c
at
i
on
Wi
rel
e
ss...
.
(
H
ay
o
u
n
g
O
h
)
2
361
devi
ce c
o
m
m
u
n
i
cat
i
ons e
n
vi
r
onm
ent
.
The
exi
s
t
i
ng
rese
a
r
ches have p
r
o
p
o
se
d
l
i
ght
wei
ght
ro
ut
i
n
g
p
r
o
t
ocol
s
reso
rt
i
n
g t
o
t
h
e red
u
ce
d f
r
e
q
uency
i
n
co
nt
r
o
l
m
e
ssage t
r
ansm
i
ssi
on an
d
t
h
e si
ze o
f
t
r
ansm
i
ssi
on pa
cket
.
Howev
e
r, th
is p
a
p
e
r propo
sed
a RPL-b
a
sed en
h
a
n
ced
ro
u
t
in
g
pro
t
o
c
o
l
th
at will effectiv
ely red
u
ce th
e
to
tal
am
ount
of c
o
n
t
rol
m
e
ssages deri
vi
n
g
f
r
om
no
de
-i
de
nt
i
f
y
i
ng
IP
v
6
ad
dre
ss, nei
g
h
b
o
r
di
sco
v
eri
n
g
pr
oc
edu
r
es,
an
d rou
tin
g p
a
t
h
in th
e
d
a
ta tran
sm
issio
n
.
ACKNOWLE
DGE
M
ENTS
Th
is r
e
sear
ch
w
a
s supp
or
ted b
y
Basic Sci
e
n
ce
Researc
h
Program
through the National Research
Fo
un
dat
i
o
n o
f
Korea
(NR
F
) fu
n
d
ed
by
t
h
e M
i
ni
st
ry of Sci
e
nce,
IC
T & Fut
u
re Pl
an
ni
ng
(NR
F
-
2
014
R1A1
A1
00
356
2)
.
REFERE
NC
ES
[1]
Ever
y
t
h
i
ng, “White Paper: Ev
er
y
t
h
i
ng
connected,” 2012
.
[2]
G. Chrisman, “I
BM Innovations
and
Smarter
Planet pro
j
ects,” 20
12.
[3]
G. Fodor,
et al.
, “Design aspects of network assist
ed device-to
-devic
e com
m
u
nica
tions
,”
IEEE Commun. Ma
g.
,
vol/issue: 50(3), pp.
170–177
,
20
12.
[4]
CISCO, “Sm
a
rt
+Connected Co
m
m
unities-Cha
nging a Cit
y
,
a Co
untr
y
,
the World,” 2013
.
[5]
J
i
Z., “
D
es
ign o
f
an int
e
grat
ed
controll
er based
on ZigBee wir
e
less sensor network,”
TELKOMNIKA Indonesian
Journal of Electr
ical Engineerin
g
, vol/issue: 11(
8), pp
. 4414-442
1, 2013
.
[6]
N. Dinh
and S.
Lim, “Analy
sis
of IEEE 802
.15.4 Beac
on-En
abled MAC Protocol,”
IJ
ECE,
vol/issue: 6(3), 2016.
[7]
L. L
e
i,
et al.
, “
O
perator con
t
rol
l
ed devi
ce-
to-de
v
ice c
o
mmunications in LTE-Advanced n
e
twork
s
,”
IEEE Wireless
Commun. Mag
., vol/issue: 19(3), pp.
96–104
,
201
2.
[8]
D.
C.
Mur,
et a
l
.
, “
D
evic
e-to-d
evic
e com
m
unications
with W
i
-
F
i Direct: ov
erv
i
ew and expe
ri
m
e
ntation
,
”
IEEE
Wire
le
ss Commun.
, vol/issue: 20(
3), pp
. 1–8
, 201
3.
[9]
IEEE
, “
W
i
reles
s
LAN m
e
dium acc
ess
control (MAC) and ph
y
s
ical lay
e
r
(P
HY) s
p
ecifica
ti
ons
am
endm
ent 9:
interworking
with external ne
tworks,” I
EEE Std.
802.11u, 2011.
[10]
Z. S
h
elb
y
e
t
,
et
al
., “Constrained
Application Portoc
ol (CoAP),” I
ETF CoRE Wor
k
ing
Group, Internet-Draft, v
e
r. 1
8
,
June 2013.
[11]
IETF, “RPL: IPv6 Routing
Proto
c
ol for
Low-Po
wer and
Loss
y
Networks,” RFC 6
550, Mar
.
2012
.
[12]
IETF, “Tr
a
nsmission of IPv6 Packets over
IEEE
8
02.15.4
Network
s
,” RFC 4944
, S
e
p. 2007
.
[13]
Z. Wang,
et a
l
.
,
“PSR: A Lightweight Proactiv
e
Source Routi
ng
Protocol For Mobile Ad Hoc Networks,”
Veh
i
cul
a
r
Technology, I
E
EE Transactions
on
, vol/issue: 63
(2).
[14]
H.
Shen,
et al.
, “LALO: A Link-Aware Li
ghtw
e
ight Routing Protocol for Da
ta Delivery
in Vehicular Ad Hoc
Networks,”
Ubi
quitous Intellig
ence and Compu
ting Lecture No
tes in Computer
Scien
c
e
, vol. 6
406, pp. 459-47
3,
2010.
BIOGRAP
HI
ES OF
AUTH
ORS
Hay
oung Oh received th
e B.S. d
e
gree
in Com
puter Scien
ce from Duksung Wo
ma
ns University
and the M
.
S. degree in
the Scho
ol of Comput
er
Science and
En
gineer
ing from Ewha Womans
University
in
2
002 and 2006
r
e
spectively
.
An
d she receiv
e
d
the Ph.D. degr
ee in Computer
Science from Seoul Nation
a
l
University
in
2013. From 200
2 to 2004, she joined Shinhan
Financial Group
as a d
e
veloper
in applied r
e
sear
ch. In
2010, she was with U.C
.
Berkeley
as
a
research
er. Since 2013, she h
a
s
been with Soon
gs
il University
as a pro
f
essor in the School of
Ele
c
troni
c Engi
neering
.
Her re
s
earch int
e
res
t
s
include s
o
ci
al
and co
mputer
networks, and
s
ecurit
y
.
Sangsoon Lim r
eceived Ph
. D. d
e
gree in
the Sch
ool of Computer
Scien
ce
and
En
gineer
ing from
Seoul National
University
in 2
013. Since Oct
ober 2013, he
works as a senior engineer at
S
o
ftware R&D Center
, S
a
m
s
ung Elect
ronics
. H
i
s
current res
ear
ch inter
e
s
t
s
are in the are
a
of
wireless networks includ
ing wir
e
less LAN, wireless sensor Netw
orks, cognitiv
e r
a
dio networks.
Evaluation Warning : The document was created with Spire.PDF for Python.