Radio Planning

NGI STRATEGY, DESIGN AND DIMENSIONING 3RD EURONGI SUMMER SCHOOL ON NGI
Mathematical programming
models for the radio planning
of wireless networks
Prof. Antonio Capone
Politecnico di Milano
Antonio Capone,
1
Agenda
• Introduction to radio planning

• Coverage planning
• Capacity planning (frequency assignment)
• Joint coverage and capacity planning (planning of CDMA
systems)
References:
[1] E. Amaldi, A. Capone, F. Malucelli, C. Mannino, Optimization Problems and Models
for Planning Cellular Networks, in Handbook of Optimization in Telecommunications,
Ed. P.M. Pardalos and M.G.C. Resende, Kluver Academic Publishers, 2005 (available at
http://www.elet.polimi.it/upload/capone)
[2] IEEE Wireless Communications Magazine, special issue on 3G/4G/WLAN/WMAN
radio planning and optimization, Eds. A. Capone and J. Zhang, to appear December 2006.
Antonio Capone,
29/08/2006
1
Introduction to radio planning
Antonio Capone,
3
What is radio planning?
• When we have to install a new wireless network or

extend an existing one into a new area, we need to
design the fixed and the radio parts of the network. This
last phase is called radio planning.
Antonio Capone,
29/08/2006
2
What is radio planning?
• The basic decisions that must be taken during the radio

planning phase are:
• Where to install base stations (or access points, depending
on the technology)
• How to configure base stations (antenna type, height,
sectors orientation, tilt, maximum power, device capacity,
etc.) X X
X X
Antonio Capone,
29/08/2006
Radio Planning
• When planning and optimizing a cellular system, a number

of aspects must be considered, including
• signal propagation,
• traffic estimation,
• antenna positioning,
• antenna configuration,
• interference.
• In this lecture we’ll focus on the decision problems that
give rise to interesting and challenging mathematical
programming models which must account for the
peculiarities of the specific network technology.
Antonio Capone,
29/08/2006
3
Propagation prediction
• One of the key elements for the radio planning is

propagation prediction that allows to estimate the area
covered by each base station
• The covered area is
the area where the
received signal
R strength is above a
threshold
• Received signal
strength depends
on emitted power
and path loss
Antonio Capone,
29/08/2006
Propagation prediction (2)
• Path Loss depends on several phisical effects related to the

propagation of electromagnetic waves including:
• Distance
• Frequency
• Ground morfology
• Atmosferic phenomena
• Antenna heights
• Etc.
• Path loss has been modeled using many propagation models
(Okumura-Hata, Cost231, Walfish-Ikegami, Bertoni, etc.) that can be
grouped into three categories:
• Empirical
• Statistical
• Deterministic
Antonio Capone,
29/08/2006
4
• Due to the complex propagation environment of cellular

systems simple statististical models are aften adopted
• Deterministic techniques (e.g. Ray tracing) are
sometime used for indoor propagation
• A deterministic component due to the distance is the
starting point of statistical models
• Path loss:
L p (d ) = A + B log(d ) [dB]
• Constants are estimated using empirical models (e.g.
Okumura-Hata) or measurements
Antonio Capone,
29/08/2006
• If necessary two or three linear models are combined:

• Statistical
Measured Signal Strength
10 100 1000 10000
dispersion of
-40 data is taken
-50 into account
-60
modeling
shadow
SS [dBm]
-70
fading and
-80
Dual-slope prediction
multipath
-90
1-slope prediction fading using
-100 Survey
random
-110 variables.
-120
Meters
Antonio Capone,
29/08/2006
5
Traffic estimation
• Traffic distribution in the service area is usually hard to

predict in the radio planning phase since it depends on
several issues including area population, buildings,
market penetration of the considered service, etc.
• Traffic distribution is usually provided using a discrete
set of points I, test points (TP), that are considered as
centroids of traffic
Antonio Capone,
29/08/2006
Antenna positioning
• The selection of possible antenna sites depends on

several technical (traffic density and distribution, ground
morphology, etc.) and non-technical (electromagnetic
pollution, local authority rules, agreements with building
owners, etc.) issues. • We denote with S the set of
candidate sites (CS)
• We can assume that the
channel gain gij between TP i
and CS j is provided by a
propagation prediction tool
Antonio Capone,
29/08/2006
6
Antenna configuration
• Radiation diagram
• Horizontal (sectors) and vertical (tilt)
angles
• Maximum emission power (pilot channel
power)
• Height
• Base station capacity
• Etc.
Antonio Capone,
29/08/2006
Antenna configuration (2)
• The antenna configuration affects only the signal level received

at TPs
• For each CS j we can define a set of possible antenna
configurations Kj
• We can assume that the channel gain gijk between TP i and CS j
depends also on configuration k.
• Based on signal quality requirement and channel gain we can
evaluate if TP i can be covered by CS j with an antenna with
configuration k,
• And define coefficients:
⎧1 if TP i can be covered by CS j with conf. k

aijk = ⎨
⎩0 otherwise
Antonio Capone,
29/08/2006
7
Summarizing
S = {1,..., m}set of candidate sites (CS)

for each j ∈ S , K j set of configurations
I = {1,..., n}set of test points (TP)
⎧1 if TP i is covered by CS j with conf. k
aijk = ⎨
⎩0 otherwise
i ∈ I , j ∈ S, k ∈ K j
Antonio Capone,
29/08/2006
Interference
• Multiple access techniques are used to define

communication channels on the available radio spectrum
FDMA TDMA CDMA
WE WE WE
PO PO PO
R R R
TIM NC TIM CY TIM CY
E UE E U EN E U EN
EQ EQ EQ
FR FR FR
• Radio resources for wireless systems are limited and
Y
must be reused in different areas (cells)

• Resource reuse generates interference
Antonio Capone,
29/08/2006
8
Interference (2)
• Interference can be tolerated (good communication

quality) if the Signal-to-Interference Ratio (SIR) is high
enough
• SIR constraint limits the number of simultaneous
communications per cells, i.e. the system capacity
• Capacity is another key element that must be considered
during radio planning
• FDMA/TDMA cellular systems adopt a two phases radio
planning
• Coverage planning
• Capacity planning (frequency assignment)
• CDMA cellular systems require a single phase approach
• Joint coverage and capacity planning
Antonio Capone,
29/08/2006
Coverage planning
Antonio Capone,
18
9
Coverage planning
• The goal of the coverage planning phase is to:

• Select where to install base stations
• Select antenna configurations
• In order to guarantee that the signal level in all
TPs is high enough to guarantee a good
communication quality
• Note that interference is not considered in this
phase
Antonio Capone,
29/08/2006
Decision variables and parameters
• Decision variables:
⎧1 if a base station with configuration k is installed in CS j

y jk = ⎨
⎩ 0 otherwise
• Installation costs:
Cost related to the installation of a base

c jk station in CS j with configuration k
Antonio Capone,
29/08/2006
10
Set covering problem (SCP)
Objective function:
min ∑ ∑c y
j∈S k∈K j
jk jk total network cost
∑ ∑a y
j∈S k∈K j
ijk jk ≥ 1 ∀i ∈ I Full coverage constraints
∑ y ≤1
k∈K j
jk ∀j ∈ S One configuration per site
y jk ∈ {0,1} ∀j ∈ S , k ∈ K j Integrality constraints
• Let {
Pjk = i | aijk = 1 }
• Variables yjk define a subset S* ⊆ S
• Such that P =I ∪ jk
j∈S *
Antonio Capone,
29/08/2006
Set covering problem (SCP)
• SCP is NP-hard
• However several efficient algorithms has been
proposed (see [3] for a survey)
• Even simple greedy algorithms allow to obtain
high quality solutions
[3] S. Ceria, P. Nobili, and A. Sassano. Set covering problem. In M. Dell’Amico, F. Maffioli, and S.
Martello, editors, Annotated Bibliographies in Combinatorial Optimization, chapter 23, pages 415–428.
John Wiley and Sons, 1997.
Antonio Capone,
29/08/2006
11
Greedy algorithm for SCP
• Step 0 Note: we don’t consider configurations

here for the sake of simplicity
• set S*=∅
• Step 1
• if Pj = ∅ for all j then STOP
Pj
• Otherwise find k ∈ (J-J*) such that: is
maximum cj
• Step 2
• S*:=S*∪{k}
• Pj:=Pj-Pk ∀j
• Go to Step 1.
Antonio Capone,
29/08/2006
Greedy algorithm: Example (1)
⎡1 1 0 1 1 0 0 1 0 0 0 0 1 0 1⎤ ⎡7 ⎤ ⎡1⎤
⎢1 1 1 0 0 1 0 0 0 0 0 1 0 0 0⎥⎥ ⎢ ⎥ ⎢1⎥
⎢ ⎢5 ⎥ ⎢⎥
V = ⎢1 0 0 0 0 0 1 1 1 1 1 0 0 1 1⎥ Π = ⎢8 ⎥ C = ⎢1⎥
⎢ ⎥ ⎢ ⎥ ⎢⎥
⎢1 1 1 1 1 0 1 0 0 0 0 0 0 1 1⎥ ⎢8 ⎥ ⎢1⎥
⎢⎣1 0 1 0 1 0 1 0 1 0 1 0 1 1 1⎥⎦ ⎢⎣9 ⎥⎦ ⎢⎣1⎥⎦
• Step 0: S*=∅
Antonio Capone,
29/08/2006
12

• Step 1: k=5
⎡1 1 0 1 1 0 0 1 0 0 0 0 1 0 1⎤ ⎡7 ⎤ ⎡1⎤
⎢1 ⎥
1 1 0 0 1 0 0 0 0 0 1 0 0 0⎥ ⎢ ⎥ ⎢1⎥
⎢ ⎢5 ⎥ ⎢⎥
V = ⎢1 0 0 0 0 0 1 1 1 1 1 0 0 1 1⎥ Π = ⎢8 ⎥ C = ⎢1⎥
⎢ ⎥ ⎢ ⎥ ⎢⎥
⎢1 1 1 1 1 0 1 0 0 0 0 0 0 1 1⎥ ⎢8 ⎥ ⎢1⎥
⎢⎣1 ⎥
0 1 0 1 0 1 0 1 0 1 0 1 1 1⎦ ⎢ ⎥
⎣9 ⎦ ⎢⎣1⎥⎦
Antonio Capone,
29/08/2006

• Step 2:
• S*= {5},
• ...
⎡1 1 0 1 1 0 0 1 0 0 0 0 1 0 1⎤ ⎡7 ⎤ ⎡1⎤
⎢1 ⎥
1 1 0 0 1 0 0 0 0 0 1 0 0 0⎥ ⎢ ⎥ ⎢1⎥
⎢ ⎢5 ⎥ ⎢⎥
V = ⎢1 0 0 0 0 0 1 1 1 1 1 0 0 1 1⎥ Π = ⎢8 ⎥ C = ⎢1⎥
⎢ ⎥ ⎢ ⎥ ⎢⎥
⎢1 1 1 1 1 0 1 0 0 0 0 0 0 1 1⎥ ⎢8 ⎥ ⎢1⎥
⎢⎣1 ⎥
0 1 0 1 0 1 0 1 0 1 0 1 1 1⎦ ⎢ ⎥
⎣9 ⎦ ⎢⎣1⎥⎦
Antonio Capone,
29/08/2006
13

• Step 2:
• … ricalculate V e Π
⎡0 1 0 1 0 0 0 1 0 0 0 0 0 0 0⎤ ⎡ 3⎤
⎢0 1 0 0 0 1 0 0 0 0 0 1 0 0 0⎥⎥ ⎢ 3⎥
⎢ ⎢ ⎥
V = ⎢0 0 0 0 0 0 0 1 0 1 0 0 0 0 0⎥ Π = ⎢ 2⎥
⎢ ⎥ ⎢ ⎥
⎢0 1 0 1 0 0 0 0 0 0 0 0 0 0 0⎥ ⎢ 2⎥
⎢⎣0 0 0 0 0 0 0 0 0 0 0 0 0 0 0⎥⎦ ⎢⎣0⎥⎦
Antonio Capone,
29/08/2006
• Step 1:
• k=1
• Step 2:
• S*= {5,1},
• ricalculate V e Π
⎡0 1 0 1 0 0 0 1 0 0 0 0 0 0 0⎤ ⎡ 3⎤
⎢0 ⎥
1 0 0 0 1 0 0 0 0 0 1 0 0 0⎥ ⎢ 3⎥
⎢ ⎢ ⎥
V = ⎢0 0 0 0 0 0 0 1 0 1 0 0 0 0 0⎥ Π = ⎢ 2⎥
⎢ ⎥ ⎢ ⎥
⎢0 1 0 1 0 0 0 0 0 0 0 0 0 0 0⎥ ⎢ 2⎥
⎢⎣0 ⎥
0 0 0 0 0 0 0 0 0 0 0 0 0 0⎦ ⎢⎣0⎥⎦
Antonio Capone,
29/08/2006
14
⎡0 0 0 0 0 0 0 0 0 0 0 0 0 0 0⎤ ⎡0 ⎤
⎢0 0 0 0 0 1 0 0 0 0 0 1 0 0 0⎥⎥ ⎢ 2⎥
⎢ ⎢ ⎥
V = ⎢0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 ⎥ Π = ⎢1 ⎥
⎢ ⎥ ⎢ ⎥
⎢0 0 0 0 0 0 0 0 0 0 0 0 0 0 0⎥ ⎢0 ⎥
⎢⎣0 0 0 0 0 0 0 0 0 0 0 0 0 0 0⎥⎦ ⎢⎣0⎥⎦
Antonio Capone,
29/08/2006
• Step 1:
• k=2
• Step 2:
• J*= {5,1,2},
⎡0 0 0 0 0 0 0 0 0 0 0 0 0 0 0⎤ ⎡0 ⎤
⎢0 0 0 0 0 1 0 0 0 0 0 1 0 0 0⎥⎥ ⎢ 2⎥
⎢ ⎢ ⎥
V = ⎢0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 ⎥ Π = ⎢1 ⎥
⎢ ⎥ ⎢ ⎥
⎢0 0 0 0 0 0 0 0 0 0 0 0 0 0 0⎥ ⎢0 ⎥
⎢⎣0 0 0 0 0 0 0 0 0 0 0 0 0 0 0⎦⎥ ⎢⎣0⎥⎦
Antonio Capone,
29/08/2006
15
⎡0 0 0 0 0 0 0 0 0 0 0 0 0 0 0⎤ ⎡0 ⎤
⎢0 0 0 0 0 0 0 0 0 0 0 0 0 0 0⎥⎥ ⎢0 ⎥
⎢ ⎢ ⎥
V = ⎢0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 ⎥ Π = ⎢1 ⎥
⎢ ⎥ ⎢ ⎥
⎢0 0 0 0 0 0 0 0 0 0 0 0 0 0 0⎥ ⎢0 ⎥
⎢⎣0 0 0 0 0 0 0 0 0 0 0 0 0 0 0⎥⎦ ⎢⎣0⎥⎦
Antonio Capone,
29/08/2006
• Step 1:
• k=3
• Step 2:
• J*= {5,1,2,3},
⎡0 0 0 0 0 0 0 0 0 0 0 0 0 0 0⎤ ⎡0 ⎤
⎢0 0 0 0 0 0 0 0 0 0 0 0 0 0 0⎥⎥ ⎢0 ⎥
⎢ ⎢ ⎥
V = ⎢0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 ⎥ Π = ⎢1 ⎥
⎢ ⎥ ⎢ ⎥
⎢0 0 0 0 0 0 0 0 0 0 0 0 0 0 0⎥ ⎢0 ⎥
⎢⎣0 0 0 0 0 0 0 0 0 0 0 0 0 0 0⎦⎥ ⎢⎣0⎥⎦
Antonio Capone,
29/08/2006
16
• STOP
⎡0 0 0 0 0 0 0 0 0 0 0 0 0 0 0⎤ ⎡0 ⎤
⎢0 0 0 0 0 0 0 0 0 0 0 0 0 0 0⎥⎥ ⎢0 ⎥
⎢ ⎢ ⎥
V = ⎢0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ⎥ Π = ⎢0 ⎥
⎢ ⎥ ⎢ ⎥
⎢0 0 0 0 0 0 0 0 0 0 0 0 0 0 0⎥ ⎢0 ⎥
⎢⎣0 0 0 0 0 0 0 0 0 0 0 0 0 0 0⎥⎦ ⎢⎣0⎥⎦
Antonio Capone,
29/08/2006

• In this simple example it’s easy to observe that the
solution J*= {5,1,2,3} is sub-optimal
• In fact this solution has a lower cost:
⎡1 1 0 1 1 0 0 1 0 0 0 0 1 0 1⎤ ⎡7 ⎤ ⎡1⎤
⎢1 ⎥
1 1 0 0 1 0 0 0 0 0 1 0 0 0⎥ ⎢ ⎥ ⎢1⎥
⎢ ⎢5 ⎥ ⎢⎥
V = ⎢1 0 0 0 0 0 1 1 1 1 1 0 0 1 1⎥ Π = ⎢8 ⎥ C = ⎢1⎥
⎢ ⎥ ⎢ ⎥ ⎢⎥
⎢1 1 1 1 1 0 1 0 0 0 0 0 0 1 1⎥ ⎢8 ⎥ ⎢1⎥
⎢⎣1 ⎥
0 1 0 1 0 1 0 1 0 1 0 1 1 1⎦ ⎢ ⎥
⎣9 ⎦ ⎢⎣1⎥⎦
Antonio Capone,
29/08/2006
17
Maximum coverage problem (MCP)
• In practice the coverage requirement is often a “soft constraints”

and the problem actually involves a tradeoff between coverage and
installation costs
Objective function: trade-off
max λ zi − ∑ ∑∑ c jk y jk
i∈I
between cost and coverage
j∈S k∈K j
∑ ∑ a y ≥ z ∀i ∈ I Definition of variables z
j∈S k∈K j
ijk jk i
∑ y ≤ 1 ∀j ∈ S
k∈K j
jk
One configuration per site
y jk ∈ {0,1} ∀j ∈ S , k ∈ K j
Integrality constraints
zi ∈ {0,1} ∀i ∈ I
Antonio Capone,
29/08/2006
Assigning test points to base stations
• When a TP is covered by more than one base station:
# of base stations covering TP i

∑ ∑a
j∈S k∈K j
ijk y jk
the serving base station is not defined
• We can define new assignment variables:
⎧1 if TP i is assigned to CS j
xij = ⎨
⎩ 0 otherwise
Antonio Capone,
29/08/2006
18
Set covering with assignment (SCA)
min ∑ ∑c y
j∈S k∈K j
jk jk
∑ x = 1 ∀i ∈ I
j∈S
ij
Coverage constraints
∑ y ≤ 1 ∀j ∈ S
k∈K j
jk
x ≤ ∑a y
ij ijk jk Definition of variables x
k∈K j
y jk ∈ {0,1} ∀j ∈ S , k ∈ K j
xij ∈ {0,1} ∀i ∈ I , ∀j ∈ S
Antonio Capone,
29/08/2006
Capacity constraints
• Obviously, without additional constraints SCA provides

the same solution as SCP
• Using x variables we can add constraints on cell
capacity:
∑d x
i∈I
i ij ≤ ∑v
k∈K j
jk y jk ∀j ∈ S
where di is the traffic demand associate to TP i and vjk is

the capacity of a base station in CS j with configuration k
• Other constraints related to cell ‘shape’ can be added
Antonio Capone,
29/08/2006
19
Assignment to the ‘nearest’ base
station
• One of these rules is the requirement of assigning a TP to
the “closest” (in terms of signal strength) activated BS.
• One way to express this constraint for a given TP i is to
consider all the pairs of BSs and configurations that would
allow connection with i and sort them in decreasing order
of signal strength.
• Let {( j1 , k1 ), ( j2 , k2 ),..., ( jL , k L )}
be the ordered set of BS-configuration pairs
• The constraints enforcing the assignment on the ‘nearest’
BS are: L
y jl k l + ∑x
h = l +1
ij h ≤1 1 ≤ l ≤ L −1
Antonio Capone,
29/08/2006
Detour: WLAN radio planning
• These coverage planning models can be adapted to the

radio planning of WLANs
• However, some modifications must be made to take
into account the effect of the multiple access scheme
on the network capacity/efficiency
• IEEE 802.11 multiple access scheme:
DIFS
source RTS DATA
SIFS SIFS SIFS
destination CTS ACK
NAV (RTS)
neighbors NAV (CTS) Random Backoff
Antonio Capone,
29/08/2006
20
Detour: WLAN radio planning (2)
• The multiple access scheme affects network capacity:
• The cell overlap diminishes capacity
Antonio Capone,
29/08/2006
• Minimum Overlap Planning (MOP)
min ∑∑ a y
i∈I j∈S
ij j
∑ a y ≥ 1 ∀i ∈ I
j∈S
ij j
y j ∈ {0,1} ∀j ∈ S
• MOP is equivalent to SCP with special costs:
⎛ ⎞
∑∑
i∈ I j∈ S
a ij y j = ∑ ⎜⎝ ∑
j∈ S i∈ I
a ij ⎟ y j =
⎠
∑
j∈ S
cjy j
Antonio Capone,
29/08/2006
21
• Enhanced problem formulations can be adopted using

non-linear objective functions
• Balance share: 1/4 1/3
1/4
1/3
1/5
1/6
1/3
• Balance share = 1 / #Interferers

• Network Capacity = sum of the balance shares of all the
users
Antonio Capone,
29/08/2006
• Maximum Efficiency Planning (MEP):
1
min ∑
i∈I ∑ zih Note that:
h∈I zih = 1 if i and h are covered by a
∑a
j∈S
ij y j ≥ 1 ∀i ∈ I same AP
zih ≥ aij ahj y j
y j ∈ {0,1} ∀j ∈ S [4] E. Amaldi, A. Capone, M. Cesana, F. Malucelli,
“Optimizing WLAN Radio Coverage”, IEEE
zih ∈ {0,1} ∀i, h ∈ I ICC 2004, Paris, France, June 2004.
[5] S. Bosio, A. Capone, M. Cesana, Radio
Planning of Wireless Local Area Networks,
IEEE Trans. on Networking, to appear.
Antonio Capone,
29/08/2006
22
Capacity planning (frequency

assignment)
Antonio Capone,
45
Cluster model
• After coverage planning, capacity planning is in

charge of defining which radio resources can
be used by each cell
• The amount of resources (frequencies) F2
assigned to cells determines system capacity F2 F7 F3
F7 F3 F1
• Frequencies can be reused, but SIR (quality) F1 F6 F4
constraints must be enforced F6 F4 F5 F2
F5 F2 F7 F3
• A simple ‘didactical’ model considers F2 F7 F3 F1
hexagonal cells and homogeneous traffic F7 F3 F1 F6 F4
F1 F6 F4 F5
• Frequencies are divided into K groups and F6 F4 F5 F2
assigned to a group of K cells, named cluster. F5 F2 F7 F3
F7 F3 F1
• The cluster is repeated in the area in a regular F1 F6 F4
fashion F6 F4 F5
F5
Antonio Capone,
29/08/2006
23
Cluster model (2)
• Only some values of K are admissible K=1,3,4,7,9,12,13,

…
• Given the minimum value of SIR, SIRmin, we can
determine K the minimum value of K
• Received power: −η
Pr = Pt ⋅ G ⋅ d
Antonio Capone,
29/08/2006
Cluster model (2)
• Same antennas and same

power:
Pt ⋅ G ⋅ d −η
SIR = =
∑
6 −η
P ⋅ G ⋅ di
i =1 t D
d2
−η d3
d
=
∑
6 −η
i =1
di d4 d
r d1
• Worst case d = r d5
d6
• Approxmation di = D
−η
r −η 1⎛ 1 ⎞
SIR ≅ = ⎜ ⎟
6 D −η 6 ⎝ R ⎠
Antonio Capone,
29/08/2006
24
Cluster model (3)
• SIR depends only on the reuse ratio R=D/r and

not on the power and the cell radius
• Geometric consideration provides:
R2
K=
• And therefore: 3
K min =
(6 SIR )
2 /η
Antonio Capone,
29/08/2006
Graph based models
• Unfortunately cells are not hexagonal and traffic is

not homogeneous …
• Other models have been proposed for practical
cases (see [6] for a quite complete survey)
• Some popular models are based on graph coloring
problems
[6] K. Aardal, S.P.M. van Hoesel, A. Koster, C. Mannino, and A. Sassano. Models and
solution techniques for frequency assignment problems. 4OR, 1(4):261–317, 2003.
Antonio Capone,
29/08/2006
25
Graph based models (2)
• Compatibility graph G(V,E)

• Vertices are base stations
• Two vertices are connected by an edge if the two base
stations cannot reuse the same frequencies
Antonio Capone,
29/08/2006
• Any coloring of the vertices of G (i.e., assignment of

colors such that adjacent vertices have different colors)
is an assignment of frequencies to the network such that
no mutual interfering BSs receive the same frequency.
• A minimum cardinality coloring of G is a minimum
cardinality non-interfering frequency assignment of the
network.
• Graph coloring problem is NP-hard and several exact
algorithms and heuristics have been proposed.
• This simple model assumes:
• One frequency per BS
• Two distinct frequencies do not interfere
Antonio Capone,
29/08/2006
26
• Generalized graph coloring models:

• Compatibility matrix: C ={cij} i, j ∈S
• Frequencies are numbered according spectrum position
• Sets Fj defines assignments of frequencies to BSs
• Traffic constraints: Fj = m j ∀j ∈ S
• Compatibility constraints:
fi − f j ≥ cij i, j ∈S, fi ∈Fi , f j ∈Fj
[7] W.K. Hale. Frequency assignment: Theory and applications. Proceedings of
the IEEE, 68:1497–1514, 1980.
Antonio Capone,
29/08/2006
• if cij=0 i and j can reuse the same frequencies

• if cij=1 i and j cannot use the same frequencies
• if cij=2 i and j cannot use either the same frequencies and adjacent
frequencies
i cij j
• Optimization objective:
• Min Span(G) =
number of
frequencies used
• MS-FAP (Minimum
Span Frequency
Assignment Problem)
Antonio Capone,
29/08/2006
27
• Comments:
• Graph based models do not consider SIR constrains
explicitly
• The cumulative effect of interference is not
accouter for
Compatible?
Antonio Capone,
29/08/2006
Interference based models
• Minimum Interference Frequency Assignment Problem (MI-

FAP)
• Generalization of the max k-cut problem on edge-weighted
graphs
• penalty pvwfg v, w ∈ S , f , g ∈ F
representing the interference (cost) generated when v is
assigned with f and w is assigned with g.
• Decision variables: ⎧1 if f is assigned to v
xvf = ⎨
⎩0 otherwise
Antonio Capone,
29/08/2006
28
Interference based models (2)
• Objective function:
min ∑ ∑p
v , w∈S f , g∈F
x xwg
vwfg vf
• The problem ca be linearized:
⎧1 if f is assigned to v and g is assigned to w

zvwfg = ⎨
⎩0 otherwise
xvf + xwg ≤ 1 + zvwfg ∀ v, w ∈ S f , g ∈ F
Antonio Capone,
29/08/2006
• Linear MI-FAP:
min ∑ ∑p
v , w∈S f , g∈F
z
vwfg vwfg
s.t.
xvf + xwg ≤ 1 + zvwfg ∀ v, w ∈ S f , g ∈ F
∑x
f ∈F
vf = m(v) ∀v ∈ S
Antonio Capone,
29/08/2006
29
• MI-FAP:
• Total interference minimized
• No control on single interference values
• MI-FAP variants account for explicit SIR constraints (see [8,9]):
• Interference generated by w on v when f is assigned to v and g
to w:
I vwfg v, w ∈ S , f , g ∈ F
• Interference constraints:
∑ ∑I
v , w∈S f , g∈F
x xwg ≤ Lv
vwfg vf v, w ∈ S , f , g ∈ F
Note: linearization as in previous case
[8] M. Fischetti, C. Lepschy, G. Minerva, G. Romanin-Jacur, and E. Toto. Frequency assignment in mobile radio systems
using branch-and-cut techniques. European Journal of Operational Research, 123:241–255, 2000.
[9] A. Capone and M. Trubian. Channel assignment problem in cellular systems: A new model and tabu search
algorithm. IEEE Trans. on Vehicular Technology, 48(4): 1252–1260, 1999.
Antonio Capone,
29/08/2006
Joint coverage and capacity

planning
Antonio Capone,
60
30
Approaches to the radio planning
2nd Generation Systems (GSM, 3rd Generation Systems based on

D-AMPS, ...) W-CDMA
• two-phases approach • two-phases approach not
• 1) Radio coverage suitable because:
• no frequency planning for
• minimum signal level in CDMA
all the service area • power control determines
• 2) Frequency the cell breathing effect
assignment
Planning must also consider
• meet traffic constraints
⇒ traffic demand
• meet quality (SIR)
distribution
constraints
⇒ SIR constraints
Antonio Capone,
29/08/2006
Covering traffic in W-CDMA systems
• Traffic generated can be considered covered (served)

by the system if the QUALITY of the connection is
good
• Quality measure: Signal-to-Interference Ratio (SIR)
Prec
SIR downlink = SF
α I out + I in + η
Prec
SIR uplink = SF
I out + I in + η
Antonio Capone,
29/08/2006
31
Power Control (PC) mechanism
• Dynamic adjustment of the transmitted power to minimize

interference
• Two PC mechanisms:
• Power-based PC
• emission powers are adjusted so that received
powers are equal to a given Ptar
• SIR-based PC
• emission powers are adjusted so that all SIR are
equal to a given estimated SIRtar
Antonio Capone,
29/08/2006
Cell breathing effect
• Due to the power limitations the area actually covered by a BS

depends on interference (traffic) level
• When traffic (interference) increases

the SIR constraint cannot be met for
terminals far from the BS due to higher
channel attenuation
• Since only terminals close to the BS
can be actually served it is as if the
actual cell area reduces
• Since this phenomenon affects
coverage, traffic levels must be
carefully considered during radio
planning
Antonio Capone,
29/08/2006
32
Joint coverage and capacity planning
• set of candidate sites where to install BSs: S={1,…,m}

• installation costs: cj, j∈S
• set of test points (TPs): I={1,…,n}
• traffic demand: ai, i∈I
• equivalent users: ui=φ(ai)
• propagation gain matrix: G=[gij], i∈I, j∈S
Problem:
Select a subset of candidate sites where to install BSs,
and assign TPs to BSs so that quality constraints are
satisfied and the total cost is minimized
Antonio Capone,
29/08/2006

(2)
• Decision variables:
⎧1 if a BS is installed in j ∈ S
yi = ⎨
⎩0 otherwise
⎧1 if test point i ∈ I is assigned to BS j ∈ S
xij = ⎨
⎩0 otherwise
• Basic constraints:
∑x
j∈ S
ij ≤1 ∀i ∈ I assignment
xij ≤ y j ∀ i ∈ I, ∀ j ∈ S coherence
xij ,y j ∈ {0 ,1} ∀ i ∈ I, ∀ j ∈ S integrality

Antonio Capone,
29/08/2006
33
(3)
• Objective function:
max ∑∑u x
i∈ I j∈ S
i ij − λ∑ cj yj
j∈ S
maximize minimize
covered traffic installation costs
• We assume a power-based Power Control (received power =

Ptar)
• variables xij are defined only for pairs such that:
Ptar
≤ Pmax power limit
g ij
Antonio Capone,
29/08/2006

(4)
• SIR constraints:
Ptar
≥ SIR min y j ∀j ∈ S
Ptar
∑
h∈ I
u h g hj ∑
t∈ S g
x ht − Ptar
ht
signal power
total interference
• bilinear constraints which can be easily linearized:
⎛ ⎞
1 + M (1 − y j ) ≥ SIRmin ⎜⎜ ∑∑ uh
g hj
xht −1⎟⎟ ∀j ∈ S
⎝ h∈I t∈S g ht ⎠
with a large enough value of M
Antonio Capone,
29/08/2006
34
(5)
• Property:
• given a set of active BSs, TPs can be assigned to the
closest BS (minimize emitted powers and maximize
SIRs)
• Generalization of a Facility Location problem
• NP-hard
• quality constraint more complex
• Integral assignments (0-1 x variables)
• Classical Capacitated Facility Location approaches
are not applicable
Antonio Capone,
29/08/2006

(6)
• Solution approach:
• State-of-the-art ILP solvers can provide the exact
solution only for very small instances
• Heuristics have been proposed
• Promising approach based on Tabu Search
[10] E. Amaldi, A. Capone, and F. Malucelli. Planning UMTS base station

location: Optimization models with power control and algorithms. IEEE
Transactions on Wireless Communications, 2(5):939–952, 2003.
[11] E. Amaldi, P. Belotti, A. Capone, F. Malucelli, Optimizing base station
location and configuration in UMTS networks, Annals of Operations
Research, vol. 143, June 2006.
Antonio Capone,
29/08/2006
35
Antonio Capone
Advanced Network Technologies Laboratory
Contact:
Email: antonio.capone@polimi.it
Web: http://www.elet.polimi.it/upload/capone (personal)
http://www.elet.polimi.it/upload/antlab (laboratory)
Thank you!
Antonio Capone,
71
36

Radio Planning

Încărcat de

Informații document

Descriere originală:

Drepturi de autor

Formate disponibile

Partajați acest document

Partajați sau inserați document

Opțiuni de partajare

Vi se pare util acest document?

Este necorespunzător acest conținut?

Drepturi de autor:

Formate disponibile

Radio Planning

Încărcat de

Drepturi de autor:

Formate disponibile

NGI STRATEGY, DESIGN AND DIMENSIONING 3RD EURONGI SUMMER SCHOOL ON NGI

• Introduction to radio planning

Introduction to radio planning

What is radio planning?

• When we have to install a new wireless network or

What is radio planning?

• The basic decisions that must be taken during the radio

• When planning and optimizing a cellular system, a number

• One of the key elements for the radio planning is

Propagation prediction (2)

• Path Loss depends on several phisical effects related to the

Propagation prediction (3)

• Due to the complex propagation environment of cellular

Propagation prediction (4)

• If necessary two or three linear models are combined:

• Traffic distribution in the service area is usually hard to

• The selection of possible antenna sites depends on

Antenna configuration (2)

• The antenna configuration affects only the signal level received

⎧1 if TP i can be covered by CS j with conf. k

S = {1,..., m}set of candidate sites (CS)

• Multiple access techniques are used to define

must be reused in different areas (cells)

• Interference can be tolerated (good communication

• The goal of the coverage planning phase is to:

Decision variables and parameters

⎧1 if a base station with configuration k is installed in CS j

Cost related to the installation of a base

Set covering problem (SCP)

y jk ∈ {0,1} ∀j ∈ S , k ∈ K j Integrality constraints

Set covering problem (SCP)

Greedy algorithm for SCP

• Step 0 Note: we don’t consider configurations

Greedy algorithm: Example (1)

Greedy algorithm: Example (2)

Greedy algorithm: Example (3)

Greedy algorithm: Example (4)

Greedy algorithm: Example (5)

Greedy algorithm: Example (6)

Greedy algorithm: Example (7)

Greedy algorithm: Example (8)

Greedy algorithm: Example (9)

Greedy algorithm: Example (10)

Greedy algorithm: Example (11)

Maximum coverage problem (MCP)

• In practice the coverage requirement is often a “soft constraints”

Assigning test points to base stations

• When a TP is covered by more than one base station:

# of base stations covering TP i

• We can define new assignment variables:

Set covering with assignment (SCA)

• Obviously, without additional constraints SCA provides

where di is the traffic demand associate to TP i and vjk is

Detour: WLAN radio planning

• These coverage planning models can be adapted to the

destination CTS ACK

Detour: WLAN radio planning (2)

• The multiple access scheme affects network capacity:

• The cell overlap diminishes capacity

Detour: WLAN radio planning (3)

• Minimum Overlap Planning (MOP)

Detour: WLAN radio planning (4)

• Enhanced problem formulations can be adopted using