3.

4 MS Reselection algorithms
C1 criteria (2/2)

C1
evaluated every 5 sec (minimum)
C1 = A - MAX(0,B) > 0
A = RxLev - RXLEV_ACCESS_MIN
assess that the MS received level is sufficient
B = MS_TXPWR_MAX_CCH - P
P maximum power of MS
assess that the BTS received level will be sufficient
if MS_TXPWR_MAX_CCH < P
If A > 0 & B < 0 OK, if B > 0, it can be compensated by A
A >> 0 means that the MS is closer to the BTS

1.241

© Alcatel University - 8AS902001485 VH ZZA Ed.02 Page 1.241

 3.4 MS Reselection algorithms
C2 criteria

C2
CELL_RESELECT_PARAM_IND= not present THEN C2=C1 else
C2 = C1 + CELL_RESELECT_OFFSET - TEMPORARY_OFFSET (T)
(if PENALTY_TIME ≠ 31)
if T > PENALTY_TIME, TEMPORARY_OFFSET(T) = 0
used to avoid locating on “transient cell”
CELL_RESELECT_OFFSET used to favor cell among other (e.g.
micro-cell vs. umbrella, once T > PENALTY_TIME)

Or C2 = C1 - CELL_RESELECT_OFFSET
(if PENALTY_TIME = 31)
CELL_RESELECT_OFFSET used to handicap some cells among
others
One reselection criterion is compared to C2s
C2neighbor > C2current if cells belong to same LA
C2neighbor > C2current+Cell_Reselect_Hysteresis if cells from a
different LA

1.242

▼ Note:
CRO: from 0 to 126 dB, step 2dB
PENALTY_TIME: from 1=20s to 30=600s, step: 20s; 31=infinite
TEMPORARY_OFFSET: from 1=10dB to 6=60dB; 7 = infinite

▼ The use of a second formula (Penalty_time = 31) is restricted to very special cases, as we do not like to penalize a cell.
If a cell is parametered with PT=31, it will be penalized compared to ALL its neighbors. To penalize a cell compared to
one neighbor, one should better boost the neighbor cell (using the first formula).

▼ The first formula is very useful for favoring indoor cell or microcell.

▼ Cell selection and cell reselection considering CELL_BAR_QUALIFY

in case of phase 2 MS and CELL_RESELECT_PARAM_IND=1, it is possible to set priorities to cells
CELL_BAR_QUALIFY
Two values:
0 = normal priority (default value)
1 = lower priority
Interacts with CELL_BAR_ACCESS (barring cell)
A phase 2 MS selects the suitable cell with the highest C2 (C1>0) belonging to the list of normal priority.
If no cell with normal priority is available then the MS would select the lower priority cell with the highest C2
(C1>0).

© Alcatel University - 8AS902001485 VH ZZA Ed.02 Page 1.242

 3.4 MS Reselection algorithms
Training Exercise (1/2)

On this network example

List the parameters involved in
the selection / reselection CI=1823
GSM900 CI=6271
GSM900
Cell (8557, 1823)
process CI=6270
GSM900

CI=6169
GSM900

Cell (8564,6169) CI=1964

GSM900

Cell (8564, 1964)

Time allowed:
5 minutes
1.243

© Alcatel University - 8AS902001485 VH ZZA Ed.02 Page 1.243

 3.4 MS Reselection algorithms
Training Exercise (2/2)

Find the selected cell by the MS

CI=1823
GSM900 CI=6271
Cell 3
(8557, 1823)
GSM900

CI=6270

Measurements RxLev (1) RxLev (2) RxLev (3) GSM900

1 -80 -96 -104

2 -84 -90 -100
3 -88 -90 -87
4 -88 -87 -82
CI=6169
GSM900

5 -89 -85 -78

Cell 2 CI=1964
GSM900

(8564,6169) Cell 1
(8564, 1964)

1.244

© Alcatel University - 8AS902001485 VH ZZA Ed.02 Page 1.244

 4 ALGORITHMS DYNAMIC BEHAVIOR

1.245
© Alcatel University - 8AS 90200 1485VH ZZA Ed.02

© Alcatel University - 8AS902001485 VH ZZA Ed.02 Page 1.245

 4 ALGORITHMS DYNAMIC BEHAVIOR
Session presentation

Objective: to be able to Estimate qualitatively the impact of

parameters change
Program:
4.1 Theoretical presentation
4.2 Examples and exercises

1.246

S1: TYPICAL RADIO PROBLEMS

S2: ALGORITHMS AND ASSOCIATED PARAMETERS
S3: OMC-R RADIO PARAMETERS
S4: ALGORITHMS DYNAMIC BEHAVIOR
S5: CASE STUDIES

© Alcatel University - 8AS902001485 VH ZZA Ed.02 Page 1.246

 4 ALGORITHMS DYNAMIC BEHAVIOR

4.1 Theoretical presentation

1.247
© Alcatel University - 8AS 90200 1485VH ZZA Ed.02

Theoretical presentation
Examples and Exercises

© Alcatel University - 8AS902001485 VH ZZA Ed.02 Page 1.247

 4.1 Theoretical presentation
Session objectives

SESSION OBJECTIVES

Be able to estimate qualitatively the impact of a parameter change

JUSTIFICATION

Tuning is not an exact science

The optimizer has to control every parameter change and predict
qualitatively what the consequences will be
▲ Note: Each change of parameter and its justification have to be
registered in a database for operation convenience
DETAILED PROGRAM

Three Example/Exercises

1.248

© Alcatel University - 8AS902001485 VH ZZA Ed.02 Page 1.248

 4 ALGORITHMS DYNAMIC BEHAVIOR

4.1 Examples and Exercises

1.249
© Alcatel University - 8AS 90200 1485VH ZZA Ed.02

Theoretical presentation
Examples and Exercises

© Alcatel University - 8AS902001485 VH ZZA Ed.02 Page 1.249

 4.2 Examples and Exercises
Overview

Example 1: Optimization of handover algorithms

Sliding averaging window

Example 2: Optimization of power control algorithms

Sliding averaging window

Example 3: Traffic load sharing

Parameters qualitative influence

1.250

© Alcatel University - 8AS902001485 VH ZZA Ed.02 Page 1.250