System Level Simulations For Cellular Networks Using Matlab
System Level Simulations For Cellular Networks Using Matlab
1
Cellular Systems
Link Establishment
(BS-UE Association)
Scheduler
(PF / RR)
Channel Generation
(LoS/NLoS Channel)
Throughput
Modules
Metrics Mobility
(Throughput & Handover) Modules
3
Deployment: BS & UE Placement
Uniform Dropping
Discard region
10
11 9
12 2 8
3 1
[2] [1]
13 [3] [0] 7
[4] [5]
4 6
14 5 18
15 17
16
10 11 9
11 9 12 2 8
12 2 8 3 1
3 1 13 7
13 7 4 6
4 6 14 5 18
14 5 18 15 17 10
15 17 10 16 11 9
10 16 11 9 12 2 8
11 9 12 2 8 3 1
12 2 8 3 1 13 7
[2] [1]
3 1 13 [3] [0] 7 4 6
[4] [5]
13 7 4 6 14 5 18
4 6 14 5 18 15 17
14 5 18 15 17 10 16
15 17 10 16 11 9
16 11 9 12 2 8
12 2 8 3 1
3 1 13 7
13 7 4 6
4 6 14 5 18
14 5 18 15 17
15 17 16
16
10 11 9
11 9 12 2 8
12 2 8 3 1
3 1 13 7
13 7 4 6
4 6 14 5 18
14 5 18 15 17 10
15 17 10 16 11 9
10 16 11 9 12 2 8
11 9 12 2 8 3 1
12 2 8 3 1 13 7
[2] [1]
3 1 13 [3] [0] 7 4 6
[4] [5]
13 7 4 6 14 5 18
4 6 14 5 18 15 17
14 5 18 15 17 10 16
15 17 10 16 11 9
16 11 9 12 2 8
12 2 8 3 1
3 1 13 7
13 7 4 6
4 6 14 5 18
14 5 18 15 17
15 17 16
16
• Find the set of neighboring 19cells for each UE according to the wrap around
model
6
Link Establishment: Single Tier Case (3/5)
10
10 11 9
11 9 12 2 8
12 2 8 3 1
3 1 13 7
13 7 4 6
4 6 14 5 18
Path loss calculation
including shadow17effect
14 5 18 15 10
15 17 10 16 11 9
10 16 11 9 12 2 8
11 9 12 2 8 3 1
12 2 8 3 1 13 7
[2] [1]
3 1 13 [3] [0] 7 4 6
[4] [5]
13 7 4 6 14 5 18
4 6 14 5 18 15 17
14 5 18 15 17 10 16
15 17 10 16 11 9
16 11 9 12 2 8
12 2 8 3 1
3 1 13 7
13 7 4 6
4 6 14 5 18
14 5 18 15 17
15 17 16
16
10 11 9
11 9 12 2 8
12 2 8 3 1
3 1 13 7
13 7 4 6
4 6 14 5 18
14 5 18 15 17 10
15 17 10 16 11 9
10 16 11 9 12 2 8
11 9 12 2 8 3 1
12 2 8 3 1 13 7
Serving Cell/Sector
[2] [1]
3 1 13 [3] [0] 7 4 6
[4] [5]
13 7 4 6 14 5 18
4 6 14 5 18 15 17
14 5 18 15 17 10 16
15 17 10 16 11 9
16 11 9 12 2 8
12 2 8 3 1
3 1 13 7
13 7 4 6
4 6 14 5 18
14 5 18 15 17
15 17 16
16
• Find serving cell and sector : Lowest path loss including shadow effect
8
Link Establishment: Single Tier Case (5/5)
10
10 11 9
11 9 12 2 8
12 2 8 3 1
3 1 13 7
13 7 4 6
14 5 18
Interferers
4 6
14 5 18 15 17 10
15 17 10 16 11 9
10 16 11 9 12 2 8
11 9 12 2 8 3 1
12 2 8 3 1 13 7
Serving Cell/Sector
[2] [1]
3 1 13 [3] [0] 7 4 6
[4] [5]
13 7 4 6 14 5 18
4 6 14 5 18 15 17
14 5 18 15 17 10 16
15 17 10 16 11 9
16 11 9 12 2 8
12 2 8 3 1
3 1 13 7
13 7 4 6
4 6 14 5 18
14 5 18 15 17
15 17 16
16
•SINR Profile
Coverage •Throughput Profile
Maps
•Handover Parameters
•UE Mobility Pattern
Mobility
•Full Buffer
•Partial Buffer: Arrival Rates • Iterative
Data Traffic • Time Consuming
•Throughput
•Mobility
Metrics
10
Design of Parameters Using Symbolic Math Toolbox
Fig. Deployment of Base Stations and Users Fig. Deployment of Base Stations by a major
according to a Poisson Point Process Model (PPP) cellular network provider in 40 X 40 Km area.
Figs. obtained from: “A Tractable Approach to Coverage and Rate in Cellular Networks,” J. G. Andrews, F. Baccelli, and R. K. Ganti
Ergodic Rate as given in, “Modeling, Analysis and Design for Carrier Aggregation in Heterogeneous Cellular Networks,” X. Lin, J.G. Andrews and A. Ghosh 11
Design of Deployment Parameters Using Symbolic Math Toolbox
•Inter BS/Pico Distance and Number of Picos/Sector, UE’s/Sector
BS & Pico •Transmit Power Levels and Antenna patterns
Deployment
•Handover Parameters
•UE Mobility Pattern
Mobility
•Full Buffer
•Partial Buffer: Arrival Rates
Data Traffic
•Throughput
•Mobility
Metrics
12
Scheduler
• Preliminaries:
• Each time-frequency resource is called Resource Element (RE) Slot 1 Slot 2
• A group of RE’s form an Allocation Unit (AU)
• Each spatial layer has N AU’s 1 2
• Assumptions:
• K Users in set U={U1, U2, …UK} 3 4
• L possible Transmission Modes (one at a time)
5 6
• Role of Scheduler:
• Allocate M*N resources among K Users in time-frequency : :
• Let w be a metric that indicates the weight considering
proportional fairness criterion, say N-1 N
• Then, the resource allocation is according to:
N L
iˆ, ˆj , aˆ , lˆ arg max wia, ,jl xia, ,jl
a 1 l 1 iU jU
NP-Hard Problem
s.t. x
a 1...U l 1... L
a ,l
i, j NL, i, j 1,2, , K Non-convex
x _ opt (iˆ, ˆj , aˆ , lˆ) 1
13
Scheduler: Numerical Solution Using MATLAB
s.t. x
a 1...U l 1...L
a ,l
i, j NL, i, j 1,2, , K
• Link the script for optimization to C++ SLS using dynamic linked libraries
14
Scheduler: Numerical Solution Using MATLAB
Advantages:
• Give insights to standards on limits of performance, paving way for improved system design
15
Summary
• Faster Turn-Around Time Using Symbolic Math Toolbox for design of
deployment and mobility parameters
16