Computational Intelligence - February 2014 - 47

Furthermore, a TP i can
interference source which
is away from the user [10].
be assigned to a CS j ! J
Therefore, we define a
only if a BS has been installed
maximum influence region
in CS j . That is,
with no-load coverage area
s ij # x j 6 i ! I, j ! J.
(14)
for sector v of CS j. It is
the TPs which can be
In addition, SIR has to be
potentially covered by the
maintained for all active consector v of BS j ! J with
nections in order to satisfy
the QoS in the network. The
combination level k ! K
interference is composed of
of configuration parameintracell interference, intercell
ters. A pool I vjk is formed
interference and noise power.
with these TPs. It is comFrom Eq.(8), the SIR in the
puted as follows: First of all,
uplink can be expressed as:
we ignore all other BSs. Figure 4 Illustration of intracell interference and intercell interference in
uplink and downlink.
That is, we assume there is
p ui g ijk s ij
W
only one BS j . If TP i is included in secMeanwhile, a binary variable matrix
= SIR uj s ij (15)
u u
u
R i I in, i + I out,
i + h bj
tor v and the pilot power received at TP
S = [s ij] denotes the state of each confor i ! I, j ! J , where
nection. s ij = 1 if and only if the coni from BS j is greater than minimum
nection between TP i and CS j satisfies
allowable value tp min , i.e.
I uin, i = / u ut p ut g tjk s tj - p ui g ijk,
the quality requirements in the uplink
t ! C jk
tp j g ijk > tp min,
and downlink directions. That is,
(9)
u
I out,
/ u ut p ut g tjk
i =
t ! I jk, t " C jk
if the conection between
TP i may be covered by sector v of BS
1
s ij = * TP i and BS j is active
j . Usually, the actual coverage of sector
v
0
otherwise,
v of BS j is smaller than I jk . At the
are the intracell and intercell interference
same time, a set J i, i ! I is determined,
of the connection between TP i and CS
which is used to store the indices of secj , respectively. p ui is the transmit power
where i ! I, j ! J.
tors which can affect TP i . In addition,
from a mobile at TP i and h bj =
We formulate the WCDMA network
we allocate each TP to a certain active
planning as a multiobjective optimization
-105 dbm is the thermal noise at BS j .
BS according to Eq. (7). These TPs
problem. The system capacity Tcap (X, S)
SIR uj is the lower bound on SIR of BS
which are allocated to the same sector
and installation cost C cos (X, S) considj . We assume that all BSs have the same
and within its no-load coverage area are
ered in this paper are:
lower bound on SIR, i.e. SIR uj = 6 db,
regarded as a cell, denoted as C vjk . The
j ! J. R ui is the user data rate of a mobile
max
T
(
X
,
S
)
=
u
s
/ / i ij (10) station in TP i and let it be the same
cap
more detailed information about comi ! I j ! Ji
puting I vjk , j i and C vjk will be described
value, i.e. R ui = 12.2 kbit/s for different
min C cos (X, S) = / / c jk x jk . (11)
in Section II-D1. Then, we estimate the
TPs in uplink. I vjki is the set of all TPs that
j!J k!K
intercell interference I out for TP i with
are fallen into the no-load coverage area
of sector v i containing TP i , and C vjki is
the total interference due to the signals
Also, suppose each TP i ! I can be
vi
vi
of the TPs in I jk but not in C jk , where
assigned to one BS at most, i.e.
the cell containing TP i . The numerator
of the left-hand-side term corresponds to
v i is the sector containing TP i . Hence,
(12)
/ s ij # 1 6 i ! I,
the power of the relevant signal arriving
we only consider the local interference
j ! Ji
from TP i at CS j. u ut p ut g tjk indicates the
due to the channels which are fallen
into the maximum influence region.
total power received at the BS j from TP
where / j ! J i s ij = 1 means that TP i is
served; otherwise, it is not served.
t .Thus, I uin,i amounts to the total interferFurther, as there is at most one BS
ence due to all other active connections
C. Multiobjective Optimization Model
with combination level k of configurafor WCDMA Network Planning
within the cell C vjki , and I uout, i is the total
tion parameters to be installed in each
interference due to the channels within
To describe the programming model, a
CS j , we have
no-load coverage area I vjki but not in C vjki .
binary variable matrix X = [x jk] n # l is
utilized to denote the state of each CS,
Since the power that the mobile stax j = / x jk # 1 6 j ! J.
(13)
where x jk ! {0, 1}, j ! J, k ! K, satisfies:
tion
can emit is nonnegative and there
k!K
exists an upper bound on the maximum
u
if a BS installed in CS j
power P max
If x j = 1, it implies that there is a BS
, we have:
x jk = * 1 with combination level k
installed in CS j . Otherwise, no BS is
u
0 otherwise.
installed in CS j .
0 # p iu # p max
6 i ! I.
(16)
vi

vi

vi

February 2014 | Ieee ComputatIonal IntellIgenCe magazIne

47



Table of Contents for the Digital Edition of Computational Intelligence - February 2014

Computational Intelligence - February 2014 - Cover1
Computational Intelligence - February 2014 - Cover2
Computational Intelligence - February 2014 - 1
Computational Intelligence - February 2014 - 2
Computational Intelligence - February 2014 - 3
Computational Intelligence - February 2014 - 4
Computational Intelligence - February 2014 - 5
Computational Intelligence - February 2014 - 6
Computational Intelligence - February 2014 - 7
Computational Intelligence - February 2014 - 8
Computational Intelligence - February 2014 - 9
Computational Intelligence - February 2014 - 10
Computational Intelligence - February 2014 - 11
Computational Intelligence - February 2014 - 12
Computational Intelligence - February 2014 - 13
Computational Intelligence - February 2014 - 14
Computational Intelligence - February 2014 - 15
Computational Intelligence - February 2014 - 16
Computational Intelligence - February 2014 - 17
Computational Intelligence - February 2014 - 18
Computational Intelligence - February 2014 - 19
Computational Intelligence - February 2014 - 20
Computational Intelligence - February 2014 - 21
Computational Intelligence - February 2014 - 22
Computational Intelligence - February 2014 - 23
Computational Intelligence - February 2014 - 24
Computational Intelligence - February 2014 - 25
Computational Intelligence - February 2014 - 26
Computational Intelligence - February 2014 - 27
Computational Intelligence - February 2014 - 28
Computational Intelligence - February 2014 - 29
Computational Intelligence - February 2014 - 30
Computational Intelligence - February 2014 - 31
Computational Intelligence - February 2014 - 32
Computational Intelligence - February 2014 - 33
Computational Intelligence - February 2014 - 34
Computational Intelligence - February 2014 - 35
Computational Intelligence - February 2014 - 36
Computational Intelligence - February 2014 - 37
Computational Intelligence - February 2014 - 38
Computational Intelligence - February 2014 - 39
Computational Intelligence - February 2014 - 40
Computational Intelligence - February 2014 - 41
Computational Intelligence - February 2014 - 42
Computational Intelligence - February 2014 - 43
Computational Intelligence - February 2014 - 44
Computational Intelligence - February 2014 - 45
Computational Intelligence - February 2014 - 46
Computational Intelligence - February 2014 - 47
Computational Intelligence - February 2014 - 48
Computational Intelligence - February 2014 - 49
Computational Intelligence - February 2014 - 50
Computational Intelligence - February 2014 - 51
Computational Intelligence - February 2014 - 52
Computational Intelligence - February 2014 - 53
Computational Intelligence - February 2014 - 54
Computational Intelligence - February 2014 - 55
Computational Intelligence - February 2014 - 56
Computational Intelligence - February 2014 - 57
Computational Intelligence - February 2014 - 58
Computational Intelligence - February 2014 - 59
Computational Intelligence - February 2014 - 60
Computational Intelligence - February 2014 - 61
Computational Intelligence - February 2014 - 62
Computational Intelligence - February 2014 - 63
Computational Intelligence - February 2014 - 64
Computational Intelligence - February 2014 - Cover3
Computational Intelligence - February 2014 - Cover4
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202311
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202308
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202305
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202302
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202211
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202208
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202205
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202202
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202111
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202108
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202105
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202102
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202011
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202008
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202005
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202002
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_201911
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_201908
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_201905
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_201902
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_201811
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_201808
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_201805
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_201802
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_winter17
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_fall17
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_summer17
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_spring17
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_winter16
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_fall16
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_summer16
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_spring16
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_winter15
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_fall15
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_summer15
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_spring15
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_winter14
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_fall14
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_summer14
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_spring14
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_winter13
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_fall13
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_summer13
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_spring13
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_winter12
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_fall12
https://www.nxtbookmedia.com