Indonesian Journal of Electrical
Engineer
ing and Computer Scien
ce
V
o
l. 9, N
o
. 2
,
Febr
u
ar
y 201
8, pp
.
29
9
~
30
1
ISSN: 2502-4752, DOI: 10.
11591/ijeecs
.v9.
i
2
.pp299-301
2
99
Jo
urn
a
l
h
o
me
pa
ge
: http://iaescore.c
om/jo
urnals/index.php/ijeecs
Evalu
a
tion of Power Min
i
mizati
on for Routing Protocol and
Multicast Networks
Shabir Ahme
d Mir
1
,
T. P
ad
ma
2
1
Res
ear
ch s
cho
l
ar,
Inform
ation
Techno
log
y
,
AM
ET Univers
i
t
y
, Che
nn
ai
2
Department of
computer Applic
aions, Sona College of
Technolo
g
y
, S
al
em
Article Info
A
B
STRAC
T
Article histo
r
y:
Received Oct 6, 2017
Rev
i
sed
D
ec 12
, 20
17
Accepte
d Ja
n 3, 2018
In
t
his
p
a
per
ex
plore
the
scenar
i
o
o
f
wire
less
m
u
ltic
ast
wi
th
a
s
ingle
source
and
m
u
ltipl
e
r
elay
t
h
a
t
togeth
er
c
onvey
consecutiv
el
y
r
e
fined
s
ources
t
o
m
u
ltiple
r
e
ceiv
e
r.
J
oint
s
ource-c
h
annel
cod
i
ng
(JSCC)
p
rotocol
is
p
roposed
aim
e
d
at
m
it
igat
i
ng
the
com
p
lex
i
t
y
a
nd
d
iffi
cult
y i
n
s
ignal
s
y
n
chro
nization
in
multicast
taking
e
nd-to-end
mean
c
ube
e
rror
def
o
rmation
a
s
the
quality
of
s
e
rvice
m
eas
ur
e
the
problem
s
of
J
S
CC
communica
tion
ar
e
fo
rm
ulat
ed
t
o
m
i
nim
i
ze
th
e
to
tal
pow
er
u
t
ili
za
tion
wher
e
both
rel
a
y
sel
e
c
tion
a
nd
power
allo
cat
ion
a
t
t
h
e
b
as
e
s
t
at
ion
(BS
)
a
nd
a
ll
the
r
e
l
a
ys
a
r
e
j
o
i
n
tl
y
det
e
rm
ined
t
o
solve
the
formulated
p
rob
l
em
t
h
a
t
is
nonetheless
nonlinear
in
n
at
ure
a
t
w
o-
step
iter
a
tiv
e
algorithm
is
i
nves
tigated
f
or
power
a
llocations
at
a
ll
transm
itters
w
here
a
i
n
order
qu
adrat
i
c
progr
am
m
i
ng
m
e
thod
is
d
evelop
ed
into
f
ind
a
s
t
ri
c
t
l
oc
al
m
inim
u
m
.
To
r
edu
ce
th
e
com
putat
ion
c
o
m
plexity
a
heuristi
c
algo
rit
h
m
for
rela
y
selec
tion
is
p
r
e
sented
.
Case
s
tud
ies
ar
e
conducted to
ver
if
y
th
e proposed
formulations and
solution
meth
od
s.
K
eyw
ords
:
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
:
Sh
ab
ir Ah
m
ed
Mir,
Research schol
ar, Info
rm
at
i
on Tech
n
o
l
o
gy
,
AM
ET
Uni
v
er
sity
,
Ch
enn
a
i.
1.
INTRODUCTION
Due
to
n
ature
of
w
i
r
eless
channe
l
s
,
wi
rel
e
s
s
c
om
m
uni
cat
ion
s
u
f
f
ers
f
r
o
m
m
u
lt
i
p
at
h
fadi
n
g
a
n
d
t
he
ti
m
e
-v
aryin
g
ch
aracteristic
t
hat
cau
ses
d
i
st
ortio
n
t
o
t
h
e
d
eliv
ere
d
i
nf
o
r
m
a
t
i
on.
T
hi
s
ha
s
im
posed
a
s
t
r
i
nge
nt
l
i
m
i
t
a
t
i
on
o
n
s
om
e
appl
i
cat
i
ons
w
here
r
et
ra
nsm
i
ssi
on
i
s
n
ot
pos
si
ble,
s
uch
as
b
roadca
s
t
/m
ulticas
t
to
r
esolve
th
e
p
r
ob
lem
Jo
in
t
so
urce
ch
an
n
e
l
codi
ng
(J
SCC)
a
nd
c
ooperative
t
r
a
n
s
m
i
ssi
ons
a
re
t
wo
c
l
a
sses
of
s
ol
ut
i
o
ns
t
h
at
ex
p
l
o
i
t
di
f
f
ere
n
t
de
si
g
n
d
im
ensi
ons
o
f c
o
m
m
uni
cat
i
on
sy
st
e
m
s
.
The
ad
ve
nt
o
f
wi
rel
e
ss
m
o
b
i
l
e
a
d-h
o
c
net
w
o
r
k
s
(
M
A
N
ETs)
has
of
fe
red
an
e
fficie
n
t
and
m
o
st
im
port
a
nt
l
y
c
ost
effect
i
v
e
t
echni
que
t
o
m
a
ke
u
se
o
f
t
h
e
avai
l
a
b
ility
o
f
m
o
b
ile
h
o
s
ts
w
h
e
n
no
f
ix
ed
i
n
fra
st
ruct
ure
i
s
p
ro
vi
de
d.
I
n
M
ANET
t
h
e
m
obi
l
e
nod
es
can
easi
l
y
com
m
unicate
with
each
o
the
r
w
hi
le
t
hey
are f
r
eel
y
m
ovi
ng
ar
o
un
d i
n
d
i
ffe
rent
d
i
r
ect
i
o
ns.
A
n
a
d
-
ho
c
n
e
tw
or
k
r
e
lies
en
tir
ely
o
n
no
des
co
op
er
atio
n
f
o
r
fo
rw
ar
di
n
g
i
nf
o
r
m
a
ti
on
f
r
o
m
dat
a
sou
r
ces
t
o
i
n
t
e
nde
d
dest
i
n
at
i
on
n
odes
.
S
o
m
e
exam
pl
es
o
f
m
obi
l
e
n
o
d
e
s
i
n
a
n
a
d
-
h
o
c
n
e
t
w
o
r
k
a
r
e
l
a
p
t
o
p
co
m
p
u
t
ers,
s
mart
p
hon
es
a
nd
p
e
rson
al
d
ig
ital
assistan
ts
t
h
a
t
in
teract
d
ire
c
tly
w
ith
each
o
the
r
.
T
h
ere
a
r
e
m
a
ny
adva
nt
age
s
o
f
suc
h
a
n
ad
-
h
o
c
n
et
w
o
r
k
w
hi
ch
i
ncl
u
de
f
as
t
depl
oy
m
ent,
r
obustness
,
efficiency
a
nd
na
tura
l
su
ppo
rt
f
o
r
m
o
b
ility.
Gen
e
tic
a
lg
orith
m
s
b
ased
e
n
h
a
n
c
ed
K
S
t
r
an
ge
poi
nt
s
cl
ust
e
ri
ng
a
l
g
ori
t
h
m
i
s
a
l
s
o
d
e
scr
i
b
e
s
th
at
[
1
]
.
Med
i
a
A
c
cess
D
e
lay
an
d
Th
ro
ugh
pu
t
An
alysis
of
V
oi
ce
Codec
with
S
ilence
Suppression
on
Wi
rel
e
ss
A
d
H
o
c
Net
w
or
k
e
xpl
ai
ne
d
i
n
[
2]
.
An
H
et
er
o
g
ene
o
us
P
o
pul
at
i
on-B
a
se
d
G
e
net
i
c
A
l
g
ori
t
h
m
f
or
Data Clu
steri
n
g
is d
escrib
ed
h
er
e
. T
he opti
m
al clusters are ach
i
e
v
e
d
by
m
odi
fy
i
ng t
h
e
genet
i
c
al
g
o
r
i
t
h
m
[3]
.
Evaluation Warning : The document was created with Spire.PDF for Python.
ISS
N
:
2502-
4
752
In
d
onesi
a
n
J
E
l
ec En
g &
C
o
m
p
Sci
, Vol
.
9
,
N
o.
2
,
Fe
br
uar
y
20
1
8
:
2
99 – 301
30
0
2.
PROP
OSE
D
S
YSTE
M
I
n
trod
u
ce
an
a
syn
c
hr
ono
us
m
u
l
ti-
r
e
lay
aid
e
d
tw
o-
slo
t
J
SCC
m
u
lt
i
cast
pr
ot
oc
ol
t
hat
can
d
eal
w
i
t
h
successi
vely
r
efine
d
s
ources
o
f
a
r
b
itr
ar
y
nu
m
b
er
s
of
l
ayers,
i
n
w
hich
t
he
o
ptim
a
l
D
FE
r
ecei
ver
a
nd
t
h
e
opt
i
m
al
SINR
l
e
vel
o
f
eac
h l
a
y
e
r i
n
t
he rel
ay
ed
pha
se are
j
o
i
nt
l
y
consi
d
ere
d
.
Form
ul
at
e
a
sui
t
e
o
f
opt
i
m
izat
i
on
p
r
obl
e
m
s
by
t
aki
ng
t
o
t
a
l
ener
gy
u
s
a
ge
a
s
the
target,
where
the
transm
it powe
r
levels at the
B
S
and relays as
well as t
he power
ratio of ea
ch layer a
re
j
oi
nt
l
y
det
erm
i
ned.
Devel
op
a
se
q
u
ent
i
a
l
q
u
ad
ra
t
i
c
p
ro
gram
t
hro
u
gh
po
wer
param
e
t
e
rs
opt
im
i
zati
on
an
d
a
heu
r
i
s
t
i
c
alg
o
rith
m
to
o
p
t
i
m
ally
s
elect
r
elays
in
t
ransmissio
n
to
f
urth
er
m
in
i
m
ize
th
e
to
tal
p
o
wer
con
s
u
m
p
tio
n
to
reduce t
h
e calc
u
lation c
o
m
p
licati
on a
he
uri
s
t
i
c al
go
ri
t
h
m
fo
r c
om
m
uni
cat
e sel
ect
i
on i
s
o
b
t
ai
nabl
e.
2.
1.
Architec
ture of JSCC
3.
DIS
C
USSI
ON
Asy
n
c
h
r
o
no
us
m
ult
i
-rel
a
y
ai
d
e
d
t
w
o
-
sl
ot
J
S
C
C
m
u
l
t
i
cast
pr
ot
oc
ol
i
s
pro
pos
ed
a
n
d
t
hei
r
l
i
f
et
im
e
i
s
calculated. Opt
im
ization probl
e
m
s
is form
ulated by taking t
otal
ener
g
y
usa
g
e as t
he t
ar
get
, w
here t
he t
ra
nsm
it
powe
r
levels
a
t
the
BS
a
nd
r
el
ays
as
w
ell
as
t
he
power
r
ati
o
o
f
each
layer
are
jo
in
tly
d
etermin
e
d
.
M
u
lti-relay
aid
e
d
two
-
slo
t
J
SCC
m
u
ltica
s
t
p
r
o
t
o
c
o
l
i
s
o
b
t
ain
e
d
an
d
t
h
e
resu
l
t
s
a
re
c
om
pared
wi
t
h
t
hei
r
c
o
nve
nt
i
onal
m
e
t
hod.
F
i
g
ur
e
1
de
scri
be
s
t
h
e
net
w
o
r
k
l
i
f
et
im
e
for
b
o
t
h
t
he
p
r
o
p
o
sed
and
e
x
i
s
t
i
n
g
sc
hem
e
s.
T
he
p
r
o
p
o
s
e
d
m
e
t
hod
has
bet
t
er net
wo
rk
l
i
f
et
im
e co
m
p
ared t
o
t
h
e e
x
i
s
t
i
n
g
one
.
Network
Mo
nitoring
Destination
Source node
Clustering n
ode
Random
Selection
Effective Random
routing
Recei
ving Data
w
ith energy
efficiency
and required ti
m
e
Problem
Occurring
covered network
s
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
Eva
l
ua
tion
o
f
Po
wer Mi
n
i
miza
tio
n fo
r Rou
t
i
n
g Pro
t
o
c
o
l
and
Mu
ltica
s
t Netwo
r
ks (Sh
a
b
i
r Ahmed
Mir)
30
1
Fi
gu
re
1
.
Net
w
or
k Li
fet
i
m
e
4.
CO
NCL
USI
O
N
The
pape
r
c
o
n
s
i
d
ere
d
a
m
ul
ti
-rel
a
y
ai
ded
j
o
i
n
t
s
o
u
r
ce-c
h
annel
c
o
d
i
ng
(
JSCC)
m
u
ltica
s
t
n
e
two
r
k
co
n
t
ain
i
n
g
a
sou
r
ce
m
u
ltip
le
d
eco
d
e
-an
d
-fo
r
ward
r
elays
and
m
u
lt
ip
le
d
estin
atio
n
nod
es.
Du
e
to
t
h
e
d
i
f
ficu
lty
i
n
s
y
n
c
h
r
o
ni
zi
ng
t
he
r
el
ay
c
o
m
m
uni
cat
i
on
a
n
a
sy
nc
h
r
o
n
o
u
s
J
SC
C
t
w
o
-sl
o
t
m
u
l
t
i
cast
prot
oc
ol
w
as
i
nt
r
o
d
u
ce
d
al
on
g
wi
t
h
a
n
opt
i
m
al
D
FE
s
t
r
uct
u
re
w
here
t
he
a
s
s
oci
a
t
e
d
SI
NR
o
f
all
layers
c
an
b
e
determin
ed
b
ased
on
MMSE
criterio
n
.
EED
a
t
th
e
en
d
nod
es
w
as
t
aken
a
s
the
perform
a
n
ce
m
etric
for
the
sy
stem
optim
ization
subject to the powe
r level and
power rati
o assigne
d to each lay
er at th
e tra
n
sm
it
ters. An
o
p
tim
izat
io
n
prob
lem
to
m
in
i
m
ize
t
o
tal
in
fl
u
e
n
c
e
u
tilizatio
n
was
fo
rm
u
l
ate
an
d
so
l
v
e
d
where
th
e
t
r
an
sm
it
p
o
wer
lev
e
l
po
wer
assig
n
i
n
g
ratio for all layers,
an
d relay selectio
n can b
e jo
i
n
t
l
y
st
r
on
g
-
m
i
nded.
REFERE
NC
ES
[1]
Johnson
T.
a
nd
Singh
S.
K
.,
“Genetic
a
lgor
ithms
based
enh
a
nced
K
Strange
points
cluster
i
ng
algorithm,”
in
Computing
an
d Network Communications (
C
oC
oNet)
,
International
I
EEE Conference,
pp
. 737-
741, 2015
.
[2]
Shah
R
.
D.
a
nd
S
ingh
S.
K
.,
“Media
A
ccess
Delay
and
Thro
ughput
Anal
y
s
is
o
f
Voice
Code
c
with
S
il
en
c
e
Suppression on Wireless
Ad Ho
c
Network
,”
Pr
o
cedia
Computer
Scien
c
e
,
vol. 79
,
pp. 940-947, 20
16.
[3]
A.
B
edboudi,
et al.
,
“An
Heter
ogeneous
P
opulation-B
a
sed
Genetic
Algorithm
f
or
D
ata
C
lus
t
ering,
”
Indon
esian
Journal of Electrical
Engine
erin
g and Informatics (
I
JEEI)
, vol/issue: 5(3)
, 2017
.
0
20
0
40
0
60
0
80
0
10
00
12
00
14
00
16
00
0
1
02
03
04
0
5
0
Lifetime (ms
)
Simulation
T
ime (s)
Ex
isting
Proposed
Evaluation Warning : The document was created with Spire.PDF for Python.