Sie sind auf Seite 1von 79

ATOLL UMTS HSPA FEATURES

Training Programme

1. UMTS HSPA Workflow in Atoll


2. Modelling a UMTS HSPA Network

3. UMTS, HSDPA and HSUPA Predictions


4. Neighbour Allocation
5. Scrambling Codes Planning
6. Monte-Carlo Based Simulation

Forsk 2011

Confidential Do not share without prior permission

Slide 2 of 79

1. UMTS HSPA Workflow in Atoll


Open an existing project
or create a new one
Network Configuration
- Add Network Elements
- Change Parameters

ACP

Basic Predictions
(Best Server, Signal Level)
Neighbour Allocation

Traffic Maps

Monte-carlo
Simulations

User-defined Values
Cell Load
Conditions

UMTS/HSPA Predictions

Scrambling Code Plan

Prediction Study Reports


Forsk 2011

Confidential Do not share without prior permission

Slide 3 of 79

Training Programme

1. UMTS HSPA Workflow in Atoll


2. Modelling a UMTS HSPA Network

3. UMTS, HSDPA and HSUPA Predictions


4. Monte-Carlo Based Simulation
5. Neighbour Allocation
6. Scrambling Codes Planning

Forsk 2011

Confidential Do not share without prior permission

Slide 4 of 79

2. Modelling a UMTS HSPA Network


Transmitter Parameters

Cell Parameters

Forsk 2011

Confidential Do not share without prior permission

Slide 5 of 79

Transmitter Parameters
Can be defined in the Transmitter Properties Dialogue
Frequency Band [General Tab]

Transmission and Reception Losses, Noise Figure [Transmitter Tab]

Forsk 2011

Either calculated according to the equipment characteristics (TMA, feeder cables, BTS), or userdefined

Confidential Do not share without prior permission

Slide 6 of 79

Transmitter Parameters
Can be defined in the Transmitter Properties Dialogue
Diversity Parameters [Transmitter Tab]

Carriers with all their Characteristics [Cells Tab]

Forsk 2011

Confidential Do not share without prior permission

Slide 7 of 79

Cell Parameters
A cell is defined as a carrier, with all its characteristics, on a transmitter
Corresponds to the (Tx - Carrier) pair

Main Parameters
Cell Transmit power

Max Power (dBm)

The maximum cell capacity


Maximum power

Pilot Power (dBm)

Used to calculate the RSCP and Ec/I0

SCH Power (dBm)

The average power of synchronisation channels


Total power

Other CCH Power (dBm)

The power of other common channels

Forsk 2011

TCH User 2
TCH User 1
Other CCH

Total Power (dBm or %)

TCH User 3

Total Transmitted Power in DL


Input used in the DL predictions
Confidential Do not share without prior permission

SCH

CPICH
Slide 8 of 79

Cell Parameters
Main Parameters
Cell Transmit power

UL Load Factor (%)

Maximum power

UL Cell Load Factor


Input used in the UL predictions

Total power

HSPA Support

Indicates whether the cell supports HSDPA, HSPA or HSPA+

HSPA

HSDPA Power (dBm)

The power available for the HS-SCCH and HS-PDSCH of HSDPA users

TCH User 3
TCH User 2

DL HSUPA Power (dBm)

The power allocated to HSUPA DL channels

TCH User 1
Other CCH
SCH

CPICH

MIMO Support

Forsk 2011

The MIMO technique (transmit diversity or spatial multiplexing) used by the cell when it supports
HSPA+

Confidential Do not share without prior permission

Slide 9 of 79

Cell Parameters
Main Parameters
AS Threshold (dB)

Maximum difference between the pilot quality of the best-server and the pilot quality of the candidate
cells
Used to determine which cells, apart from the best server, will be part of the mobile active set

Primary Scrambling Code


List of Neighbours

Forsk 2011

Access to a dialogue where you can set both intra-technology (UMTS-UMTS) and inter-technology
(UMTS-GSM) neighbours

Confidential Do not share without prior permission

Slide 10 of 79

Training Programme

1. UMTS HSPA Workflow in Atoll


2. Modelling a UMTS HSPA Network

3. UMTS, HSDPA and HSUPA Predictions


4. Neighbour Allocation
5. Scrambling Codes Planning
6. Monte-Carlo Based Simulation

Forsk 2011

Confidential Do not share without prior permission

Slide 11 of 79

3. UMTS, HSDPA and HSUPA Predictions


Available Predictions

Load Conditions

Service and User Modelling

Coverage Predictions

Point Analysis Tool

Forsk 2011

Confidential Do not share without prior permission

Slide 12 of 79

Available Predictions
Coverage Predictions
UMTS Dedicated Coverage Predictions

Quality Studies
Handover Study
Noise Studies

HSDPA Dedicated Coverage Predictions

Quality Studies
Rate/Throughput Studies

HSUPA Dedicated Coverage Predictions

Quality Studies
Rate/Throughput Studies

Point Analysis
Radio Reception Analysis at a Given Point

Forsk 2011

Pilot Quality, Active Set, Connection Status

Confidential Do not share without prior permission

Slide 13 of 79

Principles of Predictions
Predictions are calculated for
Given Load Conditions

Either defined in the cell properties or taken from a Monte-Carlo simulation

Traffic Maps

Monte-carlo
Simulations

Values User-defined
in the Cells Table
Cell Load
Conditions

UMTS/HSPA Predictions
A Non-interfering User with

Forsk 2011

A Service
A Mobility
A Terminal Type

Confidential Do not share without prior permission

Slide 14 of 79

Load Conditions
Values taken into consideration
in predictions for each cell

For UMTS predictions


DL power used
UL load factor

For HSDPA predictions


DL power used
HSDPA power
Number of HSDPA users
Forsk 2011

Confidential Do not share without prior permission

For HSUPA predictions


UL load factor
Maximum UL load factor
UL load factor due to HSUPA
UL reuse factor
Number of HSUPA users

Slide 15 of 79

Coverage Prediction Settings

If no simulation is selected
Prediction based on DL power and UL
load from cells table

User and carrier specification

Forsk 2011

Display type template

Tip text content and legend

Confidential Do not share without prior permission

Slide 16 of 79

Service and User Modelling


Available in the Traffic Parameters Folder
Parameters Tab of the Explorer Window

Main Service Parameters


R99 Bearer Parameters

The maximum traffic channel power (dBm)

Body Loss (dB)

The losses due to the body of the user

Main Mobility Type Parameters


Ec/Io Threshold (dB)

Forsk 2011

The minimum Ec/I0 required from a transmitter to


enter the active set as the best server

Confidential Do not share without prior permission

Slide 17 of 79

Service and User Modelling


Main Terminal Parameters
Frequency Bands and Related Noise Figures
(dB)
Maximum Terminal Power (dBm)
Gain (dB) and Losses (dB)
Active Set Size
HSPA Capability and HSPA-Specific
Parameters

Forsk 2011

Confidential Do not share without prior permission

Slide 18 of 79

Principles of UMTS Predictions


UMTS predictions can be calculated
To Analyse the Pilot Quality (Ec/Io)
To Analyse the Quality on UL and DL Traffic Channels (UL/DL Eb/Nt)
To Analyse the Service Areas
To Analyse the Handover Areas
To Analyse the DL Total Noise
To Analyse the Pilot Pollution

UMTS Prediction Inputs


DL Power Used

Used for DL Predictions (e.g., Ec/Io, DL Eb/Nt, etc.)

UL Load Factor

Used for UL Predictions (e.g., UL Eb/Nt, etc.)

User Description: Terminal, Service and Mobility Type

Forsk 2011

Confidential Do not share without prior permission

Slide 19 of 79

Display Options for UMTS Coverage Predictions

Prediction Study Type

Display Parameter

Pilot Reception Analysis (Ec/Io)

Ec/I0
Ec/I0 Margin
Transmitter, etc

Service Area (Eb/Nt) Downlink

Forsk 2011

Maximum Eb/Nt
Effective Eb/Nt
Eb/Nt Margin
Required Power, etc

Service Area (Eb/Nt) Uplink

Maximum Eb/Nt
Effective Eb/Nt
Eb/Nt Margin
Required Power
Soft Handover Gain, etc

Effective Service Area

Unique, etc

Handover Status

Handoff Status
Number of Potential Servers

Pilot Pollution

Number of Polluters

Downlink Total Noise

Minimum, Maximum or Average Noise Level


Minimum, Maximum or Average Noise Rise

Confidential Do not share without prior permission

Slide 20 of 79

UMTS Prediction Examples (1)

Pilot Reception Analysis Study

Pilot Pollution Study

Forsk 2011

Confidential Do not share without prior permission

Slide 21 of 79

UMTS Prediction Examples (2)


Service Area (Eb/Nt) Uplink Study

Effective Service Area Study

Forsk 2011

Confidential Do not share without prior permission

Slide 22 of 79

UMTS Prediction Examples (3)

Handover Status Prediction Study

Downlink Total Noise Study

Forsk 2011

Confidential Do not share without prior permission

Slide 23 of 79

Principles of HSDPA Predictions


HSDPA prediction can be calculated
To Analyse the UL and DL A-DPCH Qualities
To Analyse the HS-SCCH Quality/Power
To Model Fast Link Adaptation for a Single User within the Cell
To Model Fast Link Adaptation for Many Users within the Cell
To Analyse the Probability of Having a Certain HSDPA Radio Bearer

HSDPA Prediction Inputs


The Cell Total Power
The Cell HSDPA Power
The number of HSDPA users within the cell if the study is calculated for several users
HSDPA User Description: Terminal, Service and Mobility Type

Forsk 2011

Confidential Do not share without prior permission

Slide 24 of 79

Display Options for HSDPA Predictions

Forsk 2011

Study Objective

Conditions

Display Parameter

A-DPCH Quality Analysis

All HSDPA Radio


Bearers Considered

Max DL A-DPCH Eb/Nt


Max UL A-DPCH Eb/Nt

HS-SCCH Quality and Power Study

All HSDPA Radio


Bearers Considered

HS-SCCH Ec/Nt
HS-SCCH Power

Fast Link Adaptation Modelling for a


Single User

All HSDPA Radio


Bearers Considered

HS-PDSCH Ec/Nt
CPICH/HS-PDSCH CQI
MAC Rate
RLC Peak Rate
Application Throughput
etc

Fast Link Adaptation Modelling for a


Several Users

All HSDPA Radio


Bearers Considered

MAC Throughput per Mobile


RLC Throughput per Mobile
Application Throughput per Mobile

Probability of Having a Certain RLC


Peak Rate

One HSDPA Radio


Bearer Selected

Cell Edge Coverage Probability

Confidential Do not share without prior permission

Slide 25 of 79

Fast Link Adaptation Modelling


Atoll determines the best HSDPA bearer that each user can obtain
Process : Prediction Done Via Look-up Tables
CPICH/HSPDSCH Ec/Nt
evaluation

CQI
calculation

HSDPA
bearer
Selection

Look-up of RLC
peak rate

Modelling for a Single User


Each pixel of the map is considered as one HSDPA user
Each HSDPA user is processed as if he is the only user in the cell => he uses the entire
available HSDPA power of the cell

Modelling for Several Users


Atoll considers several HSDPA users per pixel
The cell HSDPA power is shared between users

Forsk 2011

Confidential Do not share without prior permission

Slide 26 of 79

HSDPA Prediction Example

HSDPA Study Display by RLC Peak Rate for a Single User

Forsk 2011

Confidential Do not share without prior permission

Slide 27 of 79

Principles of HSUPA Predictions


HSUPA prediction can be calculated to analyse
The Power Required by the Terminal
The Required E-DPDCH Quality
The Rates and Throughputs

HSUPA Prediction Inputs


The Cell UL Load Factor
The Cell UL Load Factor due to HSUPA
The Cell UL Reuse Factor
The Maximum Cell UL Load Factor
The number of HSUPA users within the cell if the study is calculated for several users
HSUPA User Description: Terminal, Service and Mobility Type

Two Calculation Options


HSUPA resources are dedicated to a single user
HSUPA resources are shared by several users

Forsk 2011

Confidential Do not share without prior permission

Slide 28 of 79

Display Options for HSUPA Predictions


On each pixel, you can display
The E-DPDCH Ec/Nt required to obtain the HSUPA bearer
The terminal power required to obtain the HSUPA bearer

The RLC peak rate that the HSUPA bearer can provide
The minimum RLC throughput that the HSUPA bearer can provide
The average RLC throughput that the HSUPA bearer can provide
The application throughput that the HSUPA bearer can provide
Etc.

Forsk 2011

Confidential Do not share without prior permission

Slide 29 of 79

Noise Rise Scheduling Modelling


Atoll determines the best HSUPA bearer that each user can obtain
Process : Prediction Done via Look-up Tables
Calculation of
the remaining
load

Load sharing
between
users

Calculation of the
maximum EDPDCH Ec/Nt
allowed

HSUPA
bearer
Selection

Look-up of RLC
peak rate

Modelling for a Single User


Each pixel of the map is considered as one HSUPA user
Each HSUPA user is processed as if he is the only user in the cell => he uses the entire
remaining load of the cell

Modelling for Several Users


Atoll considers several HSUPA users per pixel
The remaining load of the cell is equally shared between users

Forsk 2011

Confidential Do not share without prior permission

Slide 30 of 79

HSUPA Prediction Example

HSUPA Study Display by RLC Peak Rate for a Single User

Forsk 2011

Confidential Do not share without prior permission

Slide 31 of 79

Point Analysis (1)


AS Analysis Tab of the Point Analysis Tool Window
Radio Reception Analysis at a Given Point
Pilot Quality
Active Set of the Probe Mobile
Connection Status

Inputs
DL Power Used and UL Load Factor of Cells for R99 Bearer Connection
Available HSDPA Power of Cells for HSDPA Bearer Users
UL Load Factor, UL Load Factor due to HSUPA, UL Reuse Factor and Maximum UL Load
Factor of Cells for HSUPA Bearer Users
User Description: Terminal, Service and Mobility Type

Point Analysis tool can be also made to verify a coverage prediction


Display the Coverage Prediction on the Map
Recreate the Conditions of the Coverage Prediction

Forsk 2011

Confidential Do not share without prior permission

Slide 32 of 79

Point Analysis (2)

Active Set /
handover status
also shown in the
map-window

Choice of UL&DL load conditions : if (cells table) is selected


Analysis based on parameters from the Cells table

Pilot
availability
R99 TCH
availability in
UL and DL

User and carrier


specification

Forsk 2011

Cells of the mobile


Active Set (greyed
zone)

Lower limit of the Active Set Best server threshold to be part of the
Active Set (depending on the mobility
(best pilot quality - Active
type)
Set threshold)

Confidential Do not share without prior permission

Slide 33 of 79

Training Programme

1. UMTS HSPA Workflow in Atoll


2. Modelling a UMTS HSPA Network

3. UMTS, HSDPA and HSUPA Predictions


4. Neighbour Allocation
5. Scrambling Codes Planning
6. Monte-Carlo Based Simulation

Forsk 2011

Confidential Do not share without prior permission

Slide 34 of 79

4. Neighbour Allocation
Definitions
Importing Neighbours
Planning Intra-technology Neighbours
Planning Inter-technology Neighbours
Displaying Neighbour Relations on the Map

Modifying Neighbour Relations Manually


Exporting Neighbour Relations

Forsk 2011

Confidential Do not share without prior permission

Slide 35 of 79

Definitions
Reference Cell
The cell to which you are allocating neighbours

Possible Neighbours
The cells that fulfil the requirements to be neighbours

Intra-technology Neighbours
The cells defined as neighbours that use the same technology as the reference cell
E.g., UMTS-UMTS, GSM-GSM, LTE-LTE

Inter-technology Neighbours
The cells defined as neighbours that use a technology other than the reference cell
technology
E.g., UMTS-GSM, UMTS-LTE, GSM-LTE

Forsk 2011

Confidential Do not share without prior permission

Slide 36 of 79

Importing Neighbours (1/2)


Possibility to copy/paste or to import a list of neighbours
Prerequisites
A text file with at least 2 columns

Forsk 2011

Name of the reference cells


Name of neighbour cells

Confidential Do not share without prior permission

Slide 37 of 79

Importing Neighbours (2/2)

Forsk 2011

Confidential Do not share without prior permission

Slide 38 of 79

Planning Intra-technology Neighbours (1/7)


Possibility to define neighbourhood constraints to be considered during the automatic
neighbour allocation

List of neighbour relations you may force


or forbid

Forsk 2011

Confidential Do not share without prior permission

Slide 39 of 79

Planning Intra-technology Neighbours (2/7)


Allocation Parameters
Maximum Number of Neighbours

Global value for all cells or value specified for each cell

Maximum Inter-site Distance


Allocation Strategy Based on the Overlapping of Cell Coverage

Forsk 2011

Confidential Do not share without prior permission

Slide 40 of 79

Planning Intra-technology Neighbours (3/7)


UMTS Technology
Intra-carrier neighbours: neighbours which perform handover using the same carrier
Inter-carrier neighbours: neighbours which perform handover using a different carrier
Coverage conditions

Overlapping
criterion
Forsk 2011

Start allocation

Confidential Do not share without prior permission

Calculation options

Do not select the option if


you want to keep existing
neighbours
Slide 41 of 79

Planning Intra-technology Neighbours (4/7)


UMTS Technology Intra-carrier Neighbours
Overlapping Criterion
% min covered area is defined by the formula : (SA SB) / SA where :
SA is the best server area of cell A. Cell A is the first one in the AS
SB is the area where cell B can enter the as of cell A

A best server
area

(Candidate)

(Reference)

SA SB :
Area where :
Ec/Io(B) Ec/Io(A) Ec/Io
margin(A)

Minimum
Ec/Io for
A

Forsk 2011

B best server area

Confidential Do not share without prior permission

Slide 42 of 79

Planning Intra-technology Neighbours (5/7)


UMTS Technology Inter-carrier Neighbours
Overlapping Criterion (carrier saturation)
% min covered area is defined by the formula : (SA SB) / SB where :
SA is the best server area (on carrier 1) + handoff area of cell A
SB is the best server area of cell B (on carrier 2)

B best server area


(Carrier 2 candidate)

A best server area


(Carrier 1 reference)

Minimum
Ec/Io for
A

Forsk 2011

Best Ec/Io for


A - Ec/Io
margin
Confidential Do not share without prior permission

Slide 43 of 79

Planning Intra-technology Neighbours (6/7)


UMTS Technology Inter-carrier Neighbours
Overlapping Criterion (out of carrier coverage)
% min covered area is defined by the formula : (SA SB) / SB where :
SA is the coverage area of A + Ec/Io margin (and best server on carrier 1)
B best server area
SB is the best server area of cell B (on carrier 2)

(Carrier 2 - candidate)
B

Minimum Ec/Io for A


and A best server
area (carrier 1 reference)

Minimum Ec/Io for A


+ Ec/Io margin
Forsk 2011

Confidential Do not share without prior permission

Slide 44 of 79

Planning Intra-technology Neighbours (7/7)


Allocation Result
Sorted List of Neighbours with Allocation Reasons and Importance Value (0-1)

Allocation results

Sort and filtering tools

Summary report listing existing, new


and removed neighbours
Forsk 2011

Confidential Do not share without prior permission

Commit selected
neighbours only
Slide 45 of 79

Planning Inter-technology Neighbours (1/5)


Possibility to define neighbourhood constraints to be considered during the automatic
neighbour allocation

List of neighbour relations you may force


or forbid

Forsk 2011

Confidential Do not share without prior permission

Slide 46 of 79

Planning Inter-technology Neighbours (2/5)


Allocation Parameters
Maximum Number of Neighbours

Global value for all cells or value specified for each cell

Maximum Inter-site Distance


2 Allocation Strategies

Forsk 2011

Based on distance
Based on overlapping between coverage areas

Confidential Do not share without prior permission

Slide 47 of 79

Planning Inter-technology Neighbours (3/5)


Inter-technology Neighbour Automatic Allocation

Calculation options

Coverage conditions
Overlapping criterion
Start allocation

Forsk 2011

Confidential Do not share without prior permission

Do not select the option if


you want to keep existing
neighbours
Slide 48 of 79

Planning Inter-technology Neighbours (4/5)


Coverage Conditions
GSM

BCCH signal level


Area where the BCCH signal level of the cell is either the highest one or within a margin of the highest
one

UMTS

Pilot quality (Ec/I0)


Area where the cell is either the best server in terms of pilot quality or a cell of the active set

LTE

Forsk 2011

Reference signal level


Area where the reference signal level of the cell is either the highest one or within a margin of the
highest one

Confidential Do not share without prior permission

Slide 49 of 79

Planning Inter-technology Neighbours (5/5)


Allocation Result

Sort and filtering tools

Allocation results

Summary report listing existing, new


and removed neighbours
Forsk 2011

Confidential Do not share without prior permission

Commit selected
neighbours only
Slide 50 of 79

Displaying Neighbour Relations on the Map (1/3)


Select the icon

Forsk 2011

in the toolbar and click a transmitter on the map

Confidential Do not share without prior permission

Slide 51 of 79

Displaying Neighbour Relations on the Map (2/3)


Additional Display Options
Click the icon

from the toolbar

Symmetric link: site10_2(0) is


neighbour of site22_3(0) and
vice-versa
Direction of the neighbour
relation
Inwards link: site22_3(0) is
neighbour of site9_3(0)

Outwards link: site1_2(0) is


neighbour of site22_3(0)
Forsk 2011

Confidential Do not share without prior permission

Slide 52 of 79

Displaying Neighbour Relations on the Map (3/3)


Possibility to display coverage area of cells neighbours according to any neighbour
characteristics on the map
Calculate and display a coverage by transmitter on the map
Display neighbour relations of the desired transmitter
Click the icon

Forsk 2011

from the toolbar

Confidential Do not share without prior permission

Slide 53 of 79

Modifying Neighbour Relations Manually


Possibility to add/remove neighbour relations on the map using the ctrl and shift
shortcuts
Possibility to add/remove neighbours in the transmitter property dialogue
Neighbour list of BRU038_G2

List of transmitters within a 30 km


radius from the selected one
(sorted in a ascending inter-site
distance order)

Forsk 2011

Confidential Do not share without prior permission

Slide 54 of 79

Exporting Neighbour Relations


Possibility to Copy/Paste or to Export the List of Neighbours

Forsk 2011

Confidential Do not share without prior permission

Slide 55 of 79

Training Programme

1. UMTS HSPA Workflow in Atoll


2. Modelling a UMTS HSPA Network

3. UMTS, HSDPA and HSUPA Predictions


4. Neighbour Allocation
5. Scrambling Codes Planning
6. Monte-Carlo Based Simulation

Forsk 2011

Confidential Do not share without prior permission

Slide 56 of 79

5. Scrambling Code Planning


General Settings

Automatic Allocation

Scrambling Code Search Tool

Scrambling Code Histograms

Scrambling Code Interference Zone Prediction

Forsk 2011

Confidential Do not share without prior permission

Slide 57 of 79

General Settings
512 Scrambling Codes Available (0-511)
Management of Coordination Problems and Separations Between Scrambling Codes
Definition of Domains and Groups of Scrambling Codes

1 domain = set of groups


1 group consists of several scrambling codes

A domain of scrambling codes may be assigned to each cell

Cells table

Possibility to specify pairs of cells which cannot have the same scrambling code

Forsk 2011

Confidential Do not share without prior permission

Slide 58 of 79

Automatic Allocation
Allocation Criteria
First, Second and Third Order Neighbours
Additional Conditions on Ec/Io
Reuse Distance

Comparison between the inter-transmitter distance and the reuse distance (can be defined at the cell level)

SC Domain Assigned to the Cell


Number of Scrambling Codes per Cluster
Forbidden Pairs

Allocation Strategies
Clustered

Use a minimum number of clusters

Distributed per Cell

Use as many clusters as possible

One cluster per Site


Distributed per Site

Use a group of adjacent clusters per site

Allocation Options
Possibility to force the largest spectrum possible
Possibility to allocate carriers identically
Forsk 2011

Confidential Do not share without prior permission

Slide 59 of 79

Automatic Allocation
Examples of Allocation Strategies

Conditions

Clustered

Distributed
per cell

One cluster
per site
Forsk 2011

3 clusters consisted of 8
codes :
cluster 0 : 0 to 7
cluster 1 : 8 to 15
cluster 2 : 16 to 23
maximum use of codes

Distributed
per site
Confidential Do not share without prior permission

Slide 60 of 79

Automatic Allocation
Constraints on neighbour relations

Allocation
strategy

Start allocation

Forsk 2011

Confidential Do not share without prior permission

Slide 61 of 79

Automatic Allocation

Allocation result

Commit scrambling
codes to cells
Forsk 2011

Confidential Do not share without prior permission

Slide 62 of 79

Scrambling Code Search Tool


Tool to View Scrambling Code Reuse on the Map

Calculate a coverage by transmitter and


display it on the map

Scrambling code or group of scrambling


codes to be located on the map

Colours given to
transmitters
Red : transmitters which
cells have the specified
scrambling code
List of transmitters
which cells have the
defined scrambling
code

Forsk 2011

Confidential Do not share without prior permission

Grey : other
transmitters

Slide 63 of 79

Scrambling Code Histograms


View of the Scrambling Code Distribution
Scrambling code or
cluster distribution

Distribution table

Forsk 2011

Confidential Do not share without prior permission

Slide 64 of 79

Scrambling Code Interference Zone Prediction


Display of Scrambling Code Interference Zones according to the Interfered
Transmitter
Scrambling code interference when the best server and other transmitters satisfying
conditions to enter the user as have the same scrambling code

Forsk 2011

Confidential Do not share without prior permission

Slide 65 of 79

Training Programme

1. UMTS HSPA Workflow in Atoll


2. Modelling a UMTS HSPA Network

3. UMTS, HSDPA and HSUPA Predictions


4. Neighbour Allocation
5. Scrambling Codes Planning
6. Monte-Carlo Based Simulation

Forsk 2011

Confidential Do not share without prior permission

Slide 66 of 79

6. Monte-Carlo Based Simulation


Simulation Process

Simulation Creation

Simulation Results

Analysis of Simulations

Forsk 2011

Confidential Do not share without prior permission

Slide 67 of 79

Simulation Process
Whats a Simulation in Atoll?
Distribution of Users at a Given Moment (= Snapshot)

Purpose
Simulate the network regulation mechanisms for a user distribution
Analyse the network capacity

Simulations can be calculated in


UMTS Documents => Single-technology Simulation
LTE Documents => Single-technology Simulation
Multi-RAT Documents => Multi-RAT Simulation

Forsk 2011

Confidential Do not share without prior permission

Slide 68 of 79

Simulation Process
Steps of the Single-technology Simulation
1. Obtaining a Realistic User Distribution
2. Modelling the Network Regulation Mechanisms

3. Calculating Network Parameters

Forsk 2011

Confidential Do not share without prior permission

Slide 69 of 79

Simulation Process
Requirement: Traffic Maps and/or Subscriber Lists
Traffic Maps
Managed from the Traffic Maps Folder

Geo tab of the Explorer window

Based on Service and User Modelling


Main Types of Traffic Maps

Forsk 2011

User profile environment based traffic maps


Sector traffic maps

Confidential Do not share without prior permission

Slide 70 of 79

Obtaining a Realistic User Distribution


The user distribution is generated using a Monte-Carlo algorithm
Based on traffic database and subscriber list/traffic map(s)
Weighted by a Poisson distribution

Each user is assigned


A service, a mobility type, a terminal and an activity status by random trial

According to a probability law using traffic database

A geographic position in the traffic zone by random trial

Forsk 2011

According to the clutter weighting and indoor ratio (user location is the same as subscriber location if
the simulation is based on a subscriber list)

Confidential Do not share without prior permission

Slide 71 of 79

Modelling the Network Regulation Mechanisms


Iterative Algorithm
Same User Distribution Considered for Each Iteration
During each iteration, all the users attempt to connect one by one to network transmitters

Process Repeated Until Convergence

Regulation Mechanisms
UMTS Network

Forsk 2011

Power control, radio resource management performed for R99 bearers


Scheduling and fast link adaptation in order to select HSDPA bearers
Noise rise scheduling in order to select HSUPA bearers

Confidential Do not share without prior permission

Slide 72 of 79

Simulation Creation

Constraints to be respected during the


simulation and convergence criteria

Multiplying factor to increase the user density

Selection of traffic map(s)


as traffic input

Number of simulations to run


for the current session

Click the button to calculate the simulation immediately

Forsk 2011

Confidential Do not share without prior permission

Slide 73 of 79

Simulation Results (1/3)


Analysis Provided Over the Focus Zone
Results for each Technology
Statistics Tab

Total number of users who try to connect, etc.


Number and percentage of rejected users, etc.

Sites Tab

Forsk 2011

Throughput for each service, etc.

Confidential Do not share without prior permission

Slide 74 of 79

Simulation Results (2/3)


Results for each Technology
Subcells (GSM) and Cells (UMTS, LTE) Tabs

GSM: Traffic load, mean power control, etc.


UMTS: Total transmitted power, UL load factor, etc.
LTE: DL load, UL load, UL noise rise, etc.

Mobiles Tab

Connection status, best server, etc.

Updates the cell traffic load values


with the simulation results

Initial Conditions Tab

Forsk 2011

Input parameters defined when creating the simulation


Clutter classes-specific parameters
Confidential Do not share without prior permission

Slide 75 of 79

Simulation Results (3/3)

Display according to the connection status

Forsk 2011

Confidential Do not share without prior permission

Slide 76 of 79

Analysis of Simulations (1/2)


Calculation of UMTS, HSDPA and HSUPA Prediction Studies Based on Simulations
Analysis of a Single Simulation
Prediction based on the results of the selected simulation
UMTS: DL power, UL load factor, etc.
LTE: DL load, UL noise rise, etc.

Average Analysis of all Simulations in a Group

Prediction based on the average results of simulations in the


group

UMTS: average DL power, average UL load factor, etc.


LTE: average DL load, average UL noise rise, etc.

Forsk 2011

Confidential Do not share without prior permission

Slide 77 of 79

Analysis of Simulations (2/2)


AS Analysis Based on Simulations for UMTS
Analysis of a Single Simulation

Prediction based on the results of the selected simulation (DL power, UL load factor, etc.)

Average Analysis of all Simulations in a Group

Prediction based on the average results of simulations in the group (average DL power,
average UL load factor, etc.)

Forsk 2011

Confidential Do not share without prior permission

Slide 78 of 79

THANK YOU!

Das könnte Ihnen auch gefallen