Indonesian Journal of
Electrical
Engineer
ing and
Computer Science
V
o
l. 10
, No
. 3, Jun
e
20
18
, pp
. 96
6
~
97
3
ISSN: 2502-4752,
DOI: 10.
11591/ij
eecs.v10
.i3.pp966-973
9
66
Jo
urn
a
l
h
o
me
pa
ge
: http://iaescore.c
om/jo
urnals/index.php/ijeecs
Evaluation of MAC’s Distributed Queuing Algorithm for
Internet of Things Applications
Mabruk
a Mohamed
Agel,
Mohamed
H
a
d
i
H
a
b
a
eb
i,
Sa
meha
A
l
na
hd
i,
Md
R
a
f
i
q
u
l I
s
l
a
m
Departm
e
nt o
f
E
l
ec
tric
al
and Co
m
puter Engin
eer
ing, In
tern
ation
a
l Islam
i
c
Univer
sit
y
Mal
a
y
s
ia,
M
a
la
ysi
a
Article Info
A
B
STRAC
T
Article histo
r
y:
Received Ja
n
9, 2018
Rev
i
sed
Mar
20
, 20
18
Accepte
d Apr 4, 2018
Internet of
Things and M
achin
e-
to-Machine comm
unications have
contributed significan
tly
on
our d
a
ily
lif
e. Never
t
heless, from the networking
as
pect
the
y
intro
duced a hug
e ch
all
e
nge for
the
perform
ance
an
d quali
t
y
of
services of
netw
orks. In th
is paper,
a Distribu
ted Queuing Access for LTE
protocol was
anal
yz
ed to enh
a
nce th
e rando
m
acces
s
perform
ance for
M
achine to m
achin
e (M
2M
) applic
ations
. The M
2
M
com
m
unications
pres
ented
coun
tl
es
s
s
o
lici
t
at
ions
that
can
over-bu
r
den th
e
acc
es
s
channe
l of
the presen
t L
T
E
network.
Thi
s
prom
pt
s to an expansion in
the co
llision
probability
and r
e
sults in a noteworth
y
access delay
.
Th
e introdu
ced protoco
l
does
im
prove the perform
ance o
f
M
e
dium
acces
s
la
y
e
r in term
s
of blocking
probabili
t
y
, ac
ce
ss
dela
y, energ
y
utili
za
tion and num
ber
of
re-tra
nsm
i
ssions
attempts in com
p
arison with
the standa
rd
LTE p
r
otocol without
altering
the
existing
LTE
ou
tline
structur
e.
The n
e
w protoc
ol is int
e
nded
to
ensure th
at
the random
access procedure of
the ordin
a
r
y
UE
gadget
will no
t
be aff
ect
ed
bringing about consiste
nt implementation
for
th
e proposed
conv
ention
.
K
eyw
ords
:
In
tern
et o
f
th
ing
s
Lo
ng
t
e
rm
evo
l
ut
i
on
D
i
str
i
bu
ted
queu
i
ng
M2
M
Medium
access layer
Copyright ©
201
8 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
:
M
oham
e
d Ha
d
i
Habae
b
i
,
Depa
rt
m
e
nt
of
El
ect
ri
cal
and
C
o
m
put
er E
ngi
neeri
n
g
,
In
tern
ation
a
l Isla
m
i
c Un
iv
ersity Malaysia,
Jalan
G
o
m
b
ak
, Ku
ala Lu
m
p
u
r
, 531
00
,
W
P
,
Malaysia.
Em
a
il: h
a
b
aeb
i
@
iiu
m
.
ed
u
.
m
y
1.
INTRODUCTION
Int
e
r
n
et
o
f
Thi
ngs ca
n c
h
an
ge
t
h
e wo
rl
d as
we are a
w
are
o
f
i
t
.
It
i
n
cl
udes
m
e
t
hods f
o
r enha
nci
n
g t
h
e
vi
si
o
n
o
f
t
h
e o
p
erat
i
o
ns
of
i
n
dust
r
y
an
d s
o
c
i
et
y
by
em
pow
eri
n
g rem
o
t
e
com
m
uni
cat
i
on com
pone
nt
bet
w
e
e
n
d
e
v
i
ces, m
ach
i
n
es and
sm
art u
tilizatio
n
o
f
th
e in
fo
rm
ati
o
n
to
b
e
tran
smit
ted
.
In
tern
et o
f
Th
i
n
g
s
(IOT) is
conce
r
ned
wi
t
h
t
h
e a
u
t
o
m
a
ti
on
o
f
pr
oce
d
ures
t
o
dec
r
ea
se co
st
s, m
a
ke ne
w t
e
c
h
n
o
l
ogi
es
an
d
i
m
pr
o
v
e
i
n
n
ovat
i
o
ns
. A
dva
ncem
ent
s
in t
h
e t
ech
nol
o
g
y
sect
or ca
n pr
ofi
t
ot
h
e
r i
n
dust
r
i
e
s, f
o
r e
x
am
pl
e, rem
o
t
e
t
e
l
e
-
h
ealth
ap
p
licatio
n
s
, au
tono
m
o
u
s
cars, in
tellig
en
t tr
an
sportatio
n and
sm
art h
o
m
e au
to
m
a
t
i
o
n
[1
],
[1
5-17
].
C
o
m
m
uni
cat
i
o
n net
w
or
ks ar
e not
l
i
m
i
t
e
d to t
h
e com
m
uni
cat
i
ons t
h
at
h
u
m
a
n use. Yet
,
t
h
ere ar
e
ad
d
ition
a
lly n
u
m
ero
u
s
n
e
w
d
e
v
e
l
o
p
i
n
g
syste
m
s ap
p
licati
o
n
s
t
h
at are bein
g
actu
a
lized
in
m
a
j
o
r cities. Th
e
u
tilizatio
n
is co
n
ting
e
n
t
upon
th
e app
licati
o
n
s
and
o
t
h
e
r
ele
m
en
ts, for
ex
am
p
l
e, th
e deg
r
ee
of secu
ri
ty, th
e
in
fo
rm
atio
n
’
s
q
u
a
lity, energ
y
and
b
a
ttery life [2
].
Ove
r
y
e
a
r
s,
co
m
m
uni
cat
i
ons’
i
n
dust
r
y
ex
pe
ri
ence
d
hu
ge
t
r
ans
f
orm
a
t
i
on
.O
ne
of
t
h
e
fi
r
s
t
pr
ot
ocol
s
co
n
t
ro
lling
n
e
t
w
orks was
Alo
h
a
’s pro
t
o
c
o
l
wh
ich
d
e
m
o
nstrates a straigh
t
fo
rward
co
m
m
u
n
i
catio
n
sch
e
m
e
.
Alth
oug
h
th
e i
n
itial p
u
r
p
o
s
e o
f
th
is adv
a
n
c
e
m
en
t o
f
th
is p
r
o
t
o
c
o
l
to
facilitate
th
e co
mm
u
n
i
catio
n
o
f
satellite
n
e
two
r
k
s
, it is con
s
id
ered
as on
e
o
f
th
e curren
t
MAC
pro
t
o
c
o
l
s th
at is well su
ited
for th
e app
licatio
n
s
of
I
n
tern
et
o
f
Th
in
g
s
(I
oT) scenar
io
s
[3
].
Evaluation Warning : The document was created with Spire.PDF for Python.
In
d
onesi
a
n
J
E
l
ec En
g &
C
o
m
p
Sci
ISS
N
:
2
5
0
2
-
47
52
Evaluation of MAC’s Distributed Queui
n
g Al
gori
t
h
m f
o
r
I
n
t
e
rnet
…
(
M
a
b
r
uk
a M
o
h
a
m
ed
Agel
)
96
7
2.
LITERATU
R
E
REVIE
W
Lo
ng Te
rm
Evol
ut
i
o
n (LT
E
)
i
s
t
h
e curre
nt
si
gni
fi
ca
nt
st
ri
de i
n
m
obi
l
e
radi
o c
o
m
m
unicat
i
ons, a
n
d
was
prese
n
ted
in 3GPP Release 8.
LTE
utilizes ort
h
ogonal fre
que
ncy
division m
u
ltiplexing
(OFDM
)
a
s
its
radi
o access
i
n
novation, t
o
gether
with cutt
ing
edge
a
n
te
nna
a
dva
nces.
What'
s
m
o
re, LTE is
a
4G rem
o
te
innovation
which operates i
n
the
700 MHz range that
means superior
pe
rform
a
nce, data access and l
o
w
laten
c
y [4
].
This p
a
p
e
r
stud
ies MAC layer
pr
ot
ocol
s i
n
t
h
e
cont
e
x
t
o
f
L
T
E
t
echn
o
l
o
gy
.
2.
1.
M
A
C L
a
yer’s
Pr
ot
ocol
s
In the m
o
st recent years, m
a
ny studies ha
ve conc
e
n
trate
d
on the outline of
Medium
Access Control
(M
AC
)
p
r
ot
oc
ol
s. T
o
be
up t
o
dat
e
wi
t
h
t
h
e
ad
vances
i
n
t
e
chn
o
l
o
gi
es, M
A
C
t
ech
ni
q
u
es
st
rat
e
gi
es m
u
st
gi
ve
ad
ap
tab
ility an
d
effectiv
en
ess to
p
e
rm
it th
e p
r
esen
ce
o
f
these
sorts
of framewo
rk
s with
sen
s
ib
le qu
ality
an
d
reliab
ility [5
].
ALOHA and
Slo
tted
–
ALOHA p
r
o
t
o
c
o
l
s h
a
v
e
b
e
en
g
e
n
e
rally u
til
ized
as a p
a
rt o
f
th
e
p
a
st as
random
access prot
ocols. Yet
,
their low
throughput
(0.18 a
n
d 0.36 m
o
st e
x
tr
em
e) and potentia
l insec
u
rity at
sub
s
t
a
nt
i
a
l
hi
g
h
l
o
a
d
s
ha
ve
pr
om
pt
ed t
o
t
h
e
prese
n
ce
o
f
m
o
re c
o
m
p
el
l
i
ng pr
ot
oc
ol
s
[6]
.
2.
2.
Al
oh
a Pr
ot
oc
ol
Aloha prot
ocol was created to provide re
m
o
te
con
n
ect
i
ons
bet
w
ee
n
a few st
at
i
o
ns
di
st
ri
b
u
t
e
d
sp
atially. By sen
d
i
n
g
d
a
ta
from a statio
n
to
t
h
e cen
t
ral
station
over a
sha
r
ed c
h
anne
l. T
h
e central station afte
r
th
at re-transm
i
ts th
e info
rm
at
io
n
t
o
ano
t
h
e
r ch
an
nel.
C
o
l
l
i
si
ons
can
hap
p
en
i
f
m
o
re t
h
an
one
st
at
i
o
n
we
re
atte
m
p
tin
g
to
sen
d
d
a
ta.
At then
, th
e cen
t
ral
ch
ann
e
l will bro
a
d
c
ast a co
llisio
n
si
g
n
. Th
ere are two
v
a
rian
ts of
A
l
oh
a.
W
h
ich
ar
e co
nv
en
tio
nal A
l
oh
a an
d slo
tted
A
l
o
h
a
,
w
h
ich
is sep
a
rated
in
t
h
e time slo
t
s an
d statio
n
s
t
o
excha
n
ge their
data at the start of eac
h slot.
What'
s
m
o
re, slo
tted
Aloh
a
perm
i
t
s statio
n
s
to
tran
sm
it p
ack
ets at
an
y ti
m
e
. Retran
sm
issio
n
in
case of a co
llisio
n arrang
em
en
t is b
a
sically the sam
e
in
b
o
t
h
p
r
o
t
o
c
o
l
s
[7
].
Slotted Aloha and
Pure
Al
oha
are both ra
ndom
acce
ss algorithm
s
. The
re
ason for these
protoc
ols t
o
b
e
estab
lish
e
d
is th
at th
e stati
o
n
s
i
n
m
u
lti-c
h
ann
e
l
MAC layer can
g
e
t ch
an
ce t
o
tran
smit
th
eir p
ack
ets. The
fu
n
d
am
ent
a
l
cont
rast
am
ongs
t
t
h
ese t
w
o
p
r
o
t
ocol
s i
s
t
h
at
t
i
m
e
i
n
t
h
e p
u
re
Al
o
h
a i
s
fi
xed
whi
l
e
t
h
e t
i
m
e
i
n
t
h
e
sl
ot
t
e
d
Al
o
h
a i
s
va
ri
ant
.
2
.
3
.
LTE Standa
rds
a
n
d Pro
t
o
c
o
l
s
The sta
nda
rdization
proce
d
ure for
LTE
wa
s a re
su
lt
of the T
h
ird
Ge
ne
ration Part
ners
hip
Project
(3
GPP
)
. T
h
e L
TE st
anda
r
d
w
a
s consi
d
ere
d
as an abs
o
l
u
t
e
l
y
new st
an
dar
d
. Past
com
pon
ent
s
wer
e
ne
ve
r use
d
u
n
l
ess t
h
ere is
a co
nv
in
ci
n
g
pu
rpo
s
e b
e
h
i
nd
th
em
to
p
r
es
ent. Th
ere is
no
p
r
erequ
i
site for co
m
p
atib
ility
with
pri
o
r va
riants
or c
odi
ng errors, for instance
, LTE will wo
rk in various ra
nge utilizing differe
n
t physical
layer.
This is res
o
lve
d
through t
h
e
whole LTE
fra
mework
by
3GPP, which
supervises
the whole
inte
rface to
the
protoc
ol. The
term
inol
ogy
of
LTE is a
s
s
hown in Figure
1.
In s
p
ecific,
it dem
onstrates the
de
vice e
N
odeB
(base
station),
and the i
n
terfa
ces bet
w
een the eNodeB
and UE
S (End
Us
er).
Fu
rthe
rm
ore, E-
UTR
A
N
is the
entire system
, and the
official nam
e
of t
h
e st
anda
rds
for LT
E [8].
2.
4.
R
a
n
d
om
Access
Proce
d
ure o
f
M
A
C
L
ayer
i
n
L
T
E
Tim
i
ng is a ba
sic conce
r
n i
n
random
acces
s in light
of the fact that the
UE ca
n m
ove in dive
rse
separations from
the base sta
tion and LTE
requires e
x
act
ness of m
i
crosecond level. Delays in arrange
m
e
nt
sp
eed
o
f
lig
h
t
alo
n
e
can b
e
the cau
se m
a
k
i
ng
a co
llision
o
r
a
p
l
ann
i
ng
issu
e
o
n
th
e case
th
at th
ey are
no
t kep
t
Figure 1.
LTE structur
e a
n
d t
e
rm
inology [3]
Evaluation Warning : The document was created with Spire.PDF for Python.
I
S
SN
:
2
502
-47
52
I
ndo
n
e
sian
J Elec Eng
& Com
p
Sci, V
o
l. 10
,
No
.
3
,
Jun
e
2
018
:
96
6 – 97
3
96
8
up
. The
r
e are t
w
o s
o
rt
s of R
A
C
H
:
C
o
nt
ent
i
on
base
d an
d
n
o
n
-
c
ont
e
n
t
i
on
base
d. T
h
e di
st
i
n
ct
i
on i
s
o
f
w
h
et
he
r
th
ere are lik
eli
h
ood
o
f
error i
n
tran
sm
issi
o
n
u
tilizin
g
th
e same RACH
p
r
ea
m
b
le [9
].
2.
4.
1.
C
o
n
t
en
ti
on
-b
ased ra
ndom
ac
cess
Fig
u
re
2
,
ou
tlin
es t
h
e fou
r
stag
es
o
f
th
e con
t
en
tio
n-b
a
sed R
A
CH
system
w
h
ich
are:
1.
Random
access pream
ble: a special sub
carri
ers are
de
dicated in t
h
e
physi
cal layer for
prea
m
b
les are se
nt
wh
ich
co
nsist o
f
6 b
its
ID.
2.
Random
access response: It i
s
transm
itted on Physical
Downlink C
ontrol
Channel
(PDC
CH)
with a length
of
fe
w TT
I t
h
at carries
inf
o
rm
ation
of
UL
pe
rm
issi
o
n
,
RA i
d
en
tifier an
d syn
c
hron
izatio
n in
fo
rm
atio
n
.
3.
Sch
e
d
u
l
ed
transmissio
n
:
In
this step
, th
e HARQ and
RLC are u
tilized
o
n
UL-SCH an
d
i
t
co
n
t
ain
s
th
e
UE
id
en
tifier.
4.
Co
n
t
en
tio
n reso
lu
tion
:
Th
e eNod
eB
u
tilizes th
is
o
p
tion
a
l
pro
c
edu
r
e t
o
termin
ate th
e RACH.
[10
]
Fi
gu
re
2.
C
o
nt
ent
i
o
n
-
based
R
A
C
H
p
r
oce
d
ur
e [
10]
2.
4.
2.
N
o
n
-
C
o
nten
ti
on
B
a
se
d R
a
n
d
om
Ac
cess
In the non-c
ontention ba
sed random
access
strategy
, there
is no possibility of a pream
ble collision
o
n
th
e
groun
d
s
th
at th
e cod
e
i
s
pre-d
e
term
in
ed
b
y
th
e eNo
d
eB. Figu
re 3 sho
w
s th
e t
h
ree stag
es in th
is meth
od
whic
h a
r
e:
1.
Random
access pream
ble assignm
ent: The e
N
odeB
relega
t
e
s the
6
bit pre
a
m
b
le code for the
device
.
2.
Random
access pream
ble: The UE
sends
the
relegate
d
prea
m
b
le.
3.
Random
access res
p
onse:
Wh
ich is e
x
actly the
sam
e
for c
o
ntention
base
d
random
access [11].
Fi
gu
re 3.
N
o
n-
C
ont
e
n
t
i
o
n
-
b
a
s
e
d
R
A
C
H
p
r
oc
edu
r
e [1
0]
3.
R
E
SEARC
H M
ETHOD
The prese
n
t usage of the Rand
om
Access Channel in the LTE and L
TE-A is expe
riencing
high
co
ng
estion
when
th
ere are tremen
d
o
u
s
qu
an
t
ities o
f
g
a
dg
ets atte
m
p
tin
g
to
g
e
t to
th
e system
. Th
is is o
n
e
o
f
t
h
e
real reas
ons t
h
at
m
a
de the 3
GPP acce
ntuat
e
the nee
d
to
update the
out
line of t
h
e ne
xt-ge
n
eration ce
llular
n
e
two
r
k
s
t
o
mak
e
it m
o
r
e
ab
l
e
to
b
o
l
ster M2M co
mm
u
n
i
cat
io
n
s
. Th
e M2M co
mm
u
n
i
cat
io
n
s
pr
esen
ted
a huge
Evaluation Warning : The document was created with Spire.PDF for Python.
In
d
onesi
a
n
J
E
l
ec En
g &
C
o
m
p
Sci
ISS
N
:
2
5
0
2
-
47
52
Eval
u
a
t
i
o
n of
MAC
’
s Di
st
ri
b
u
t
e
d Q
u
eui
n
g
Al
gori
t
h
m
f
o
r I
n
t
e
rnet
…
(
M
a
b
r
uk
a
M
o
h
a
m
ed
Agel
)
96
9
num
ber
of acc
ess solicitations that can
ove
r-burden t
h
e a
ccess cha
nnel
of t
h
e curre
nt
LTE structure. This
prom
pts to an
expa
nsi
on i
n
the collision likelihood an
d produces
a noteworthy
access delay. These
issues
m
u
st be considered in t
h
e
plan
of LTE
Ra
ndom
Access Channel
(RAC
H)
syste
m
s [12].
One
of t
h
e p
r
o
f
i
c
i
e
nt
pr
ot
oc
o
l
s,
that can tackle these issue
s
, is
Di
st
ri
b
u
t
e
d Q
u
e
u
i
n
g R
a
n
dom
Acces
s
Prot
oc
ol
.The
pr
ot
oc
ol
p
u
t
s
t
h
e t
r
af
fi
c o
f
t
h
e rece
nt
l
y
arr
i
ved m
e
ssages
i
n
t
h
e dat
a
t
r
ansm
i
ssi
on l
i
n
e an
d
o
b
s
t
r
u
c
ts t
h
eir
tran
sm
issio
n
till th
e traffic turn
t
o
b
e
ligh
t
o
n
ce m
o
re.
In
th
is way, th
e co
llisio
n
lik
eliho
o
d
is
d
i
min
i
sh
ed to
an
in
cred
ib
ly lo
w lev
e
l
[2
].
3.
1.
Di
s
t
ri
bu
t
e
d Que
u
i
n
g
Th
e DQ co
mp
on
en
t u
s
es
virtu
a
l d
i
stribu
t
e
d
qu
eu
e to
h
o
l
d
th
e RASs for co
llid
ed g
a
dg
ets to
retransm
it the access reques
t. The co
m
p
onent ca
n be a
c
tualized with st
raightforwa
r
d alteration into the
standa
rd ra
ndom
access methodol
ogy
as
proposed
by
[13].
T
h
e DQ
system
decreases t
h
e
energy
consum
ption of MTC gadget
s and the acce
ss delay while
m
a
intaining low
bloc
king proba
b
ility under high
num
ber
o
f
de
vi
ces.
Su
bse
q
u
e
nt
l
y
, t
h
e
D
Q
ap
pr
oac
h
i
s
a
p
p
r
op
ri
at
e f
o
r
t
h
e
gi
ga
nt
i
c
n
u
m
b
er o
f
c
o
nc
ur
rent
arri
val
s
o
f
M
T
C
de
vi
ces’ t
r
a
n
sm
i
ssi
ons
[1
1]
.
3.
2.
D
Q
Pr
op
osal
Al
gori
t
h
m
Usi
n
g
C
o
nt
enti
o
n
R
e
sol
u
t
i
on Q
u
eue
Thi
s
al
go
ri
t
h
m
was pr
op
ose
d
as an arra
ngem
e
nt
by
[1
4]
for
IoT ap
pl
i
cat
i
ons. T
h
i
s
sim
p
le al
gori
t
h
m
i
s
base
d o
n
di
s
t
ri
but
e
d
q
u
e
u
i
n
g (
D
Q),
w
h
i
c
h
can
wo
rk
f
o
r a
n
une
n
d
i
n
g n
u
m
ber of
gad
g
et
s creat
i
n
g any
t
r
af
fi
c
l
o
ad.
A de
pi
ct
i
on
of t
h
e
DQ
sy
st
em
i
s
gi
ven i
n
t
h
e pa
pe
r and m
o
st
appl
i
cabl
e
exi
s
t
i
ng
i
nvest
i
g
at
i
o
ns
of
D
Q
connected in various situations. T
h
e algorithm
of
3 sta
g
es
phases a
s
s
h
own in Fi
gure
4.
Fi
gu
re 4.
D
Q
p
r
ot
ocol
wi
t
h
7 devi
ces
as pr
o
pos
ed
i
n
[1
4]
a.
Access
request sequence
(ARS)
Th
e
first stag
e is transm
issio
n
requ
est stage. Dev
i
c
e
s
t
h
a
t
w
e
r
e
i
d
e
a
l
i
n
t
h
e
p
r
e
v
i
o
u
s
f
r
a
m
e
s
e
n
d
Access Reques
t Seque
nce (ARS) to the coordi
nator
usin
g
their specific s
l
ot. Ther
e are three outcom
es; the
fi
rst
case
w
h
e
r
e
no
de
vi
ce
req
u
est
s
a
t
r
a
n
sm
i
ssi
on, t
h
e
seco
n
d
opt
i
o
n
whe
n
o
n
l
y
one
de
vi
ce
re
que
st
s
t
r
ansm
i
ssi
on i
n
a sl
ot
a
n
d t
h
e l
a
st
out
c
o
m
e
whe
n
m
o
re
than one
de
vice requests a tra
n
smission for t
h
e sam
e
slo
t
and
co
llisio
n o
c
curs.
b. Conten
tion resoluti
o
n que
ue
(CR)
Dev
i
ces th
at co
llid
e
wh
en
req
u
e
stin
g th
e sa
m
e
slo
t
fo
r tran
sm
issio
n
are m
o
v
e
d
t
o
t
h
is qu
eu
e. If
co
llisio
n
s
h
a
ppen
in
m
o
re th
an
on
e slo
t
, th
e p
r
i
o
rity fo
r ret
r
an
sm
issio
n
req
u
e
st will b
e
g
i
v
e
n
to
d
e
v
i
ces with
the proceedi
n
g orde
r. i.e.;
devices th
at
collide in sl
ot 1 will be
gi
ven
priority
for retransm
ission at
the
fo
llowing
frame o
v
e
r d
e
v
i
ces co
llid
e at slo
t
3
.
If sam
e
d
e
v
i
ces co
llid
e, ag
ain
th
ey will b
e
pu
t at th
e en
d
o
f
q
u
e
u
e
.
Wh
en
dev
i
ces su
ccess
in
tran
sm
issio
n
req
u
e
st t
h
ey
will b
e
m
o
v
e
d
t
o
d
a
ta tran
sm
iss
i
o
n
qu
eu
e (DTQ).
c. D
a
ta
tr
ans
m
ission q
u
eue
(DT
Q
)
Dev
i
ces t
h
at d
o
no
t co
llid
e at th
e sa
m
e
slo
t
can
tran
smit
th
eir d
a
ta th
e n
e
x
t
frame. Th
e d
a
ta
transm
ission queue
is acc
ordi
ng to
t
h
e order of
succee
ding at
th
e pre
v
ious
transm
ission order.
Evaluation Warning : The document was created with Spire.PDF for Python.
I
S
SN
:
2
502
-47
52
I
ndo
n
e
sian
J Elec Eng
& Com
p
Sci, V
o
l. 10
,
No
.
3
,
Jun
e
2
018
:
96
6 – 97
3
97
0
4.
R
E
SU
LTS AN
D ANA
LY
SIS
The
perform
a
nce of t
h
e Standard LTE M
A
C protoc
ol
analysis is validated
against an analytical
rep
r
ese
n
t
a
t
i
on
of t
h
e
pr
op
ose
d
m
odel
of [1
4]
i
n
NS
3 an
d
t
h
ereaft
e
r
gra
phs a
r
e ge
ner
a
t
e
d vi
a M
A
T
L
AB
com
puter sim
u
lations. Four
param
e
te
rs were
studie
d
which are: Avera
g
e access
delay, Energy
c
ons
um
ption,
b
l
o
c
k
i
ng
p
r
ob
ab
ility
an
d
nu
mb
er
of retransmissio
n
s
.
4.1. Access
De
lay
It is cha
r
acteri
zed as t
h
e time
differe
n
ce
between t
h
e tra
n
sm
ission of t
h
e fi
rst preamble and t
h
e
receiving
of e
final m
e
ssage
by the e
n
d
de
vice. Res
u
lts
a
b
out a
v
era
g
e a
ccess delay a
r
e shown i
n
Fi
gure
5.
The access
del
a
y increases as
the m
a
xim
u
m
num
ber
of ret
r
ansm
ission inc
r
eases also.
W
i
thout a doubt,
for 56
maxim
u
m
retransm
issions, t
h
e
outcom
es of the
RAC
H
is
m
o
re delayed tha
n
for the
other
desi
gns;
because
th
e d
e
v
i
ce sp
en
d
s
m
o
re ti
m
e
in
con
t
en
ti
o
n
with
m
o
re ret
r
an
sm
issio
n
attem
p
ts.
Fi
gu
re
5.
Acce
ss del
a
y
fo
r PR
AC
H=
3
The graph s
h
ows also the s
u
perior
i
t
y
of
DQ
al
go
ri
t
h
m
over
t
h
e st
anda
rd L
TE. To c
o
m
p
are the effect
of Physical Random
Access Channel (PRACH) valu
e
on the delay of access
a perform
a
nce for
same
con
f
i
g
urat
i
o
ns
of
p
r
eam
bl
es were
use
d
b
u
t
changing t
h
e
value of
PRAC
H to 6.
Fi
gu
re
6.
Acce
ss del
a
y
fo
r PR
AC
H=
6
PRACH is use
d
to carry ra
ndom
access prea
m
b
les
used for initiation of random
acces
s procedure
.
From
Fi
gur
e 6,
i
t
can be wat
c
hed t
h
at
decrea
si
ng R
A
sl
ot
s are di
st
ri
b
u
t
e
d
p
e
r fram
e
, i
.
e., whe
n
t
h
e
r
e are
m
o
r
e
channel acces
s opportunities (expa
ndi
ng
PRACH) w
ill com
e
about on
dim
i
ni
shing on
acce
ss
delay.
Furt
herm
ore, t
h
e access del
a
y gets to has a constant
value whe
n
the quantity
of concurre
nt arrivals
Evaluation Warning : The document was created with Spire.PDF for Python.
In
d
onesi
a
n
J
E
l
ec En
g &
C
o
m
p
Sci
ISS
N
:
2
5
0
2
-
47
52
Evaluation of MAC’s Distributed Queui
n
g Al
gori
t
h
m f
o
r
I
n
t
e
rnet
…
(
M
a
b
r
uk
a M
o
h
a
m
ed
Agel
)
97
1
increm
ents. As
it can
be
noti
ced in
bo
th con
f
i
g
ur
atio
ns, t
h
e
higher the
pream
bles de
dicated the sl
ower t
h
e
access. T
h
is
observation although it is
sim
i
lar to the
findi
n
g
of the
pa
per
[1
4] in the a
s
pect of decreasi
n
g the
access delay whe
n
applying distribute
d
queuing algorithm
,
it is dissimilar
on the findings of the effect of
i
n
creasi
n
g t
h
e
num
ber
of
p
r
eam
bl
es on t
h
e d
e
l
a
y
of a
ccess. I
n
[1
4]
fr
om
t
h
e resul
t
s
t
h
e i
n
c
r
ea
si
ng
o
f
pream
bles will decrease
the
delay of access. Howe
ver t
h
e
findings of our si
m
u
lation
is
consiste
nt with
those
of
[
11]
,
[
7
]
an
d
[
12]
whi
c
h a
r
e
t
r
ue
f
o
r
t
h
e ca
se o
f
di
st
ri
b
u
t
e
d
que
ui
n
g
al
go
ri
t
h
m
as i
n
Fi
g
u
re
7
.
Fi
gu
re
7.
Acce
ss del
a
y
of
D
Q
al
go
ri
t
h
m
for
PR
AC
H=
6
4
.
2
.
Bl
o
c
king
pro
b
a
b
ility
It is characterized as the like
l
i
h
o
od t
h
at
a ga
dget
achi
e
ves t
h
e m
a
xim
u
m
num
ber of t
r
an
s
m
i
ssi
on and
can
't g
e
t to
acc
ess th
e ch
ann
e
l. Fig
u
res 8
sho
w
s the p
e
rfo
rman
ce in
ter
m
o
f
b
l
o
c
k
i
ng
p
r
o
b
a
b
ility o
f
stan
d
a
rd
LTE a
n
d DQ a
l
gorithm
s
for
P
R
ACH=
3.
From
the gra
p
h it is clear th
at DQ algorithm
pe
rform
s
m
u
ch
better tha
n
the standard LTE as the
bloc
king
proba
bility for sta
n
dard
LTE is al
m
o
st twice as
for the
proposed DQ al
gor
ithm
.
This is similar to
t
h
e fi
n
d
i
n
gs o
f
[1
4]
, h
o
w
ev
er i
t
di
ffers i
n
t
e
r
m
s of t
h
e
effect
of i
n
cr
easi
ng
pream
bl
es on t
h
e
bl
o
c
ki
n
g
p
r
ob
ab
ility as in
o
u
r sim
u
latio
n
is the hig
h
e
r th
e
nu
mb
er
of tran
sm
i
ssio
n
pream
b
l
es th
e less
b
l
o
c
k
i
n
g
p
r
ob
ab
ility. Ou
r find
i
n
g
s
ho
wev
e
r are si
milar to
tho
s
e of
[11
]
,
[7
]
and
[12
]
in term
s o
f
i
n
creasing
transm
ission prea
m
b
les.
Fig
u
re
8
.
Blo
c
k
i
ng
p
r
ob
ab
ility for PR
ACH
=3
4.
3.
De
vi
ce
E
n
erg
y Co
nsu
m
pti
o
n
Whic
h is cha
r
acterized as the ag
g
r
e
g
at
e en
ergy
c
ons
um
ed i
n
t
r
a
n
sm
i
ssion a
n
d rece
pt
i
on
p
r
oces
ses,
from
the princi
pal RA attem
p
t till th
e last successful trans
m
ission by tha
t
device in the
sam
e
access. F
i
gure
9
sho
w
s
t
h
e c
o
m
p
ari
s
on
o
f
t
h
e t
w
o
m
odel
s
i
n
t
e
rm
of ene
r
gy
con
s
um
pt
i
on.
Evaluation Warning : The document was created with Spire.PDF for Python.
I
S
SN
:
2
502
-47
52
I
ndo
n
e
sian
J Elec Eng
& Com
p
Sci, V
o
l. 10
,
No
.
3
,
Jun
e
2
018
:
96
6 – 97
3
97
2
At th
e po
in
t
wh
en
t
h
e qu
an
tity o
f
syn
c
hrono
u
s
arriv
a
ls is
m
o
d
e
rately lo
w, ev
ery
o
n
e
o
f
t
h
e setup
s
perform
likewise,
offering extrem
e
l
y productive access i
n
energy term
s.
Ye
t, t
h
e energy rapi
dly increments
with
th
e qu
an
tity o
f
sy
n
c
hro
n
o
u
s
arriv
a
ls, b
e
cau
se
o
f
a
h
i
gher
p
r
o
b
a
b
ility o
f
co
llisio
n.
Th
e DQ algorith
m
is
m
u
ch
b
e
tter th
an
stand
a
rd
LTE in
t
e
rm
s of e
n
er
gy
sav
i
ng.
It
can
be n
o
t
i
ced t
h
a
t
in
creasing
t
r
an
sm
issio
n
prea
m
b
les resu
lts in
in
crease
i
n
e
n
er
gy
co
ns
um
pt
i
on w
h
i
c
h
di
sag
r
ees
w
i
t
h
t
h
e
fi
n
d
i
n
gs
of
[
1
4
]
and
agai
n i
t
a
g
rees
wi
t
h
t
h
e
fi
n
d
i
n
gs
of
al
l
of
[
11]
,
[
7
]
an
d
[
12]
.
Fi
gu
re
9.
Ene
r
gy
co
ns
um
pt
i
on
fo
r PR
AC
H=
3
4
.
4
.
Prea
mble Co
llisio
n
Rate
It is characterized as
m
easuring the m
ean num
ber
of p
r
ea
m
b
l
e
ret
r
ansm
issi
ons
req
u
i
r
e
d
t
o
have a
successful request
for
transmission, this i
s
illustrated in Figure
10. Expa
nding the
qua
ntity of c
o
ncurre
nt
arriv
a
ls, causes a h
i
gh
er prob
ab
ility o
f
co
llisio
n
;
t
h
is pr
o
m
p
t
s to
a
h
i
gh
er
nu
m
b
er of
requ
ired
retran
sm
iss
i
o
n
s
.
Add
itio
n
a
lly ex
p
a
nd
ing
th
e tran
sm
issio
n
prea
m
b
les will h
i
g
h
e
r th
e qu
antity
o
f
retran
smissio
n
requ
ired
fo
r
success
f
ul re
quest.
Fi
gu
re 1
0
. N
o
. of
R
e
t
r
ansm
i
ssi
on wi
t
h
PR
A
C
H=3
5.
CO
NCL
USI
O
N
In this pape
r,
m
u
ltiple protocols
of MAC laye
r were prese
n
ted. The
standard
of
LTE and its
st
ruct
u
r
e a
n
d
t
e
rm
i
nol
ogi
es
whe
r
e
di
scus
se
d. T
h
e al
go
ri
t
h
m
s
used fo
r M
A
C
l
a
y
e
r i
n
di
ffe
rent
t
e
c
h
n
o
l
ogi
es
were illu
strated
an
d
a stud
y
o
f
t
h
e effect
o
f
d
i
stribu
ted
queu
i
ng
algo
rit
h
m
s
was in
v
e
stig
ated
. In
th
is
pap
e
r, an
eval
uat
i
o
n o
f
a t
echni
q
u
e pr
op
ose
d
by
pa
p
e
r [1
4]
i
s
pres
ent
e
d i
n
com
p
ari
s
o
n
wi
t
h
t
h
e st
andar
d
LT
E. The
basel
i
n
e pe
rf
o
r
m
a
nce i
s
t
h
e num
ber of t
r
ansm
i
ssi
on pr
eam
b
l
e
s of an
d PR
AC
H. T
h
e t
w
o m
odel
s
were
analyzed base
d on the criteria of: delay access, bloc
ki
ng proba
b
ility, num
ber of re
transmissions and ene
r
gy
con
s
um
pt
i
on.
Evaluation Warning : The document was created with Spire.PDF for Python.
In
d
onesi
a
n
J
E
l
ec En
g &
C
o
m
p
Sci
ISS
N
:
2
5
0
2
-
47
52
Eval
u
a
t
i
o
n of
MAC
’
s Di
st
ri
b
u
t
e
d Q
u
eui
n
g
Al
gori
t
h
m
f
o
r I
n
t
e
rnet
…
(
M
a
b
r
uk
a
M
o
h
a
m
ed
Agel
)
97
3
The eval
uation showed th
at the proposed
DQ algorithm
outpe
rf
orm
s
the standard LTE
algorithm
in
all b
a
sis. It als
o
sho
w
s th
at in
creasi
n
g
th
e
n
u
m
b
e
r of
simu
ltan
e
ou
s tran
smissio
n
s
will i
n
crease all o
f
d
e
lay
access,
bl
ocki
ng proba
b
ility,
num
ber of re
transm
issions
and e
n
e
r
gy c
o
nsum
ption. Al
so the i
n
creasi
ng
of
transm
ission pream
bles will
have a
negative effect on
all of delay acce
ss, num
b
er of
retransm
issions and
en
erg
y
co
n
s
u
m
p
tio
n, b
u
t
will p
r
od
u
c
e
less b
l
o
c
k
i
n
g
pro
b
a
b
i
lity.
AC
KN
OWLE
DG
MENT
Th
is work
is p
a
rtially
sp
on
so
red
b
y
In
ternatio
n
a
l Islam
i
c
Un
iv
ersity Mala
ys
ia
r
e
s
e
a
r
ch
g
r
an
t no
.
RI
G
S
16
-0
65-
02
29
.
REFERE
NC
ES
[1]
L. A
t
zori,
A
.
Ie
r
a
,
and G
.
M
o
rab
i
to, "Th
e
int
e
rne
t
of things
: A
s
u
rv
e
y
,"
Computer n
e
tworks,
vol. 54
, pp. 2787-2805,
2010.
[2]
M
.
Beale
,
"Futu
r
e challeng
es in efficien
tly
supporting M2M in the LTE standards,"
in W
i
rel
e
ss Comm
unication
s
and Networking
Conference Wor
k
shops
(WCNC
W
), 2012 IEEE,
2012, pp
. 186-1
90.
[3]
M. Amirijoo, P. Frenger,
F. Gunnarsson, J. Moe,
and K.
Zetter
berg, "
On self-o
p
timization of th
e random access
procedure in
3
G
long term
evolution,"
in
Integrated
Network
Manageme
nt-Workshops, 2009. IM'
0
9
.
IFIP/IEEE
International S
y
mposium on, 2009, pp
. 177-184
[4]
A.
Lo, Y.
W.
Law,
M.
Ja
cobsson, and M
.
Kucharzak
,
"
E
n
hanc
ed LTE-advanc
e
d
random-acces
s mechanism for
mas
s
i
ve machine-to-machin
e
(M2M)
communi
cations
,
"
in 27
th W
o
rld W
i
re
less Research Forum
(WW
R
F)
Meeting
,
2011
,
pp. 1-5
.
[5]
K. Dovelos, L. Toni, and P. Fro
ssard, "Finite Length Performance of Ra
ndom Sl
otted ALOHA Strategies," arXiv
preprint arXiv
:
1
607.02385, 2016
.
[6]
M.
Noori,
S
.
Rahimian, and M.
Ar
dakani, "On the Capacity
Region of ALOHA Protocol
for the Internet of
Things," arXiv
p
r
epri
nt arXiv:16
05.08806, 2016.
[7]
A. Lay
a
,
L. Alo
n
so, and J. Alon
so-Zarate, "Is th
e
Random Access Channel of LTE and
LTE-A Suitable for M2
M
Communications
?
A Survey
of
Alternatives,"
I
EEE Communic
a
tions Surveys and Tutorials
, vol. 16, pp. 4-16
,
2014.
[8]
3GPP, “Radio Resource Con
t
rol
(RRC) – Protoco
l
specification,” TS
36.331,
V. 1
2
.6.0
, June 2015
[9]
G. González
, M
.
García-Lo
zano
,
S
.
Ruiz, and J
.
Olm
o
s
,
"On the
need for d
y
n
a
m
i
c downlink inter
cel
l interf
eren
ce
coordination for
realistic Long
Term Evolution
deplo
y
m
e
nts,"
Wireless Communications and
Mobile Computing,
vol. 14
, pp
. 409-
434, 2014
.
[10]
T.Godfre
y
,
”
T.
Long-term
evo
l
u
tion proto
c
ol:
H
o
w the st
andard
im
pacts m
e
dia
a
ccess con
t
rol”
.
Online d
a
ted
June,
26, 2007
.
[11]
L. Alonso, R. A
gustí, and O. Salle
nt, "A Near-
O
ptimum Me
diu
m
Access Control (MAC) Proto
c
ol Based on th
e
Distributed Qu
eueing Rand
om Acce
ss Protocol (DQRAP) for a CDMA
Mobile Communicatio
n S
y
stem,"
IE
EE
Journal on S
e
lected
Areas in
Co
mmunications,
1
999.
[12]
S
a
m
i
r, A., Elm
e
salaw
y
, M. M.,
Ali, A. S
., & Al
i, I.
“
A
n Im
proved LTE RACH P
r
otocol for M2M Applications,
”
Mobile Information Systems,
201
6.
[13]
A.
Sa
mir,
M. M.
Elme
sa
la
w
y
, A.
S.
Ali,
and I
.
Ali, "An Improved LTE RA
CH
Protocol for
M2M Applications,"
Mobile Information Systems,
vol. 2016, 2016.
[14]
A. Lay
a
, C. Kalalas, F. Vazqu
ez-
Gallego
, L. Alon
so, a
nd J. Alonso-Zarate, "Goodb
y
e
, al
oh
a!," IEEE access, vol. 4,
pp. 2029-2044
,
2016.
[15]
Kazi Istiaque
Ahmed, M
ohamed Hadi Hab
aebi, Md
Raf
i
q
u
l Islam, “Enh
anced
Vein D
e
tection from Video
Sequences”,
IJ
EE
C
S
,
vo
l. 8, No.2, pp
.: 420-427
,
November 2017.
[16]
Mohamed Hadi Habaebi, Isra
th Jahan Chowdhur
y
,
Md Rafiq
u
l Islam,
Nur Aishah Binti Zainal, “Effects
of
Shadowing on LoRa LPWAN Radio Links”,
IJEC
E
, vo
l.7
,
No.6
, p
p
.: 2970-2976
,
Decem
ber 2017
.
[17]
M
oham
e
d Habaebi, Rafh
anah
Ros
li, M
d
Rafi
qul Is
lam
,
“
R
SS
I-bas
ed Hum
a
n P
r
es
ence Det
ect
ion S
y
s
t
em
for
Energ
y
Sav
i
ng
Automation”,
IJ
EEI,
vol
. 5
,
no
.
4, pp
.: 339-350
,
Decem
ber 2017
Evaluation Warning : The document was created with Spire.PDF for Python.