Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
1. Introduction
Mobile operators are now taking another step in the
development of their broadband networks by launching
3G+ and providing customers with faster mobile data
services. 3G+, or mobile broadband, is a natural
evolution of the current (Release 99) 3G networks [1]
and promises much faster data speeds, based on
HSDPA (High Speed Downlink Packet Access) in the
forward link [2] and HSUPA (High Speed Uplink
Packet Access) in the reverse link [3].
In this context, capacity calculations are needed in
order to dimension the system and determine whether
an upgrading of the existing UMTS base stations is
necessary, and, if necessary, is it better to add a new
carrier or to share the existing band between 3G and
3G+? In this paper, we present a capacity analysis of a
network carrying both real time and elastic traffic, over
classical 3G Dedicated Channels (DCH), or on
HSUPA Enhanced DCH (E-DCH) and HSDPA High
Speed Downlink Shared Channels (HS-DSCH).
While considerable attention has been directed
toward the study of the capacity of HSDPA systems
2. Downlink model
2.1. UMTS R99 model
In the downlink of WCDMA, the SINR achieved for
user u situated at distance r0 from the target cell base
station is given by:
SINRuD (r0 ) =
S D Pu,0 /q u,D0
I intD er,u + I intD ra,u + N 0
I intD er ,u =
Ptot ,l
l 0
q u ,l
I intD ra ,u =
Ptot , 0 Pu , 0
qu ,0
is
the
intra-cell
D Pmax ,
where
D is
the
SINRuD (r0 ) =
S D Pu,0
(Ptot,0 Pu,0 ) + D Pmax Fu + N 0 q u,D0
SINRuD
, we obtain:
u = D
S + .SINRuD
Pu , 0
u =
D
.Ptot , 0 + Pmax Fu + N 0 quD, 0
(1)
MD
1 v M
i =1
Ptot ,0 =
c =1
1 ( c M iD,c )
c =1
c =1
c=1C, where this condition is verified. The steadystate probabilities are then given by solving the set of
linear balance equations, obtained by writing the
transition rates:
R D (..., M 1D, c ,..., M iD, c ,..., M nD, c ,... ..., M 1D, c ,..., M iD, c + 1,..., M nD, c ,...) = c S i
R D (..., M 1D, c ,..., M iD, c ,..., M nD, c ,... ..., M 1D, c ,..., M iD, c 1,..., M nD, c ,...) = M iD, c
Tc
, NRT depart.
E[ ]
R D (..., M 1D, c ,..., M iD, c ,..., M nD, c ,... ..., M 1D, c ,..., M iD, c 1,..., M nD, c ,...) = M iD, c c , RT departure
Ptot , 0 =
D =
Pr(M D )
(1 v M D ) Pmax
and the blocking probability of class-c calls is equal to:
i =1 c =1
MD A D
bcD =
i =1
Si D
bi , c , where biD, c is the class-c blocking
Stot
rate in region i:
biD =
M
Pr(M
AiU,c
SINR (M ) =
DH
j
Ti DH (M D ) =
1
n
D
d DH SINR DH
j (M )
DH
j
where d
(SINR ) are
Ti
DH
(M )
.
E[ ]
3. Uplink model
M iDH
E c Rc
is the required
N0 W
c =1
Ncell
i, j
i =1
( 0)
i, j
qi(,0j)
U
int er , 0
= E[ M
U
c ,i
Ncell
Pc ] E [
i =1
q i(,i j)
q i(,0j)
Pc
~
SINRcU =
c
U
U
N 0 + I int ra , 0 + I int er , 0 Pc
U
c
Pi e, j
Pi ,ej
Ncell
c =1
U
int ra , 0
U
int er , 0
i =1
j =1
DH
Let f = E[
Ncell
q i(,i j)
q
i =1
(0 )
i, j
in the uplink. P = E[
U
c ,i c
P ] is the average
c =1
~
c =
Pc
C
N 0 + M mU Pm + P . f Pc
m =1
~
c
Defining c =
~ , we can obtain:
1 + c
C
Pc = c ( N 0 + P . f + M mU Pm ) .
Leading
to:
m =1
U
m
Pm =
( N 0 + P . f ) M mU m
C
m =1
1 M mU m
m =1
m =1
and Pc =
( N 0 + P . f ) c
C
1 M m
m =1
(2)
U
m
M c < 1
U
c
c =1
q00, j ( N 0 + P . f ) m
(3)
Pmax
0
U
c
c < 1
c =1
q j ( N 0 + P . f ) m
(4)
Pmax
I tot
, where Itot is the overall
I tot + N 0
=
U
U
m
Pm + P . f
m =1
N 0 + M mU Pm + P . f
N 0 M m + P. f
U
m
m =1
N0 + P. f
m =1
U
< max
, leading to the condition:
U
max
( N0 + P . f ) P . f
c =1
N0
M cU c <
(5)
UH
UH
U
c ,i
Pc ] can be obtained
c =1
from
averaging
C
= E[
M
c =1
C
U
c
Eqn.
(2).
Defining
1 M c
] , we have:
U
c
c =1
P=
N0
1 f
(6)
2.
3.
ACK Throuphput
depends on
DL Throuphput
6. Results
5. Capacity dimensioning
We are able to dimension the network. The
dimensioning process is launched when the blocking
rate exceeds a critical threshold. For a cell with only
R99 DCHs, the following actions are possible:
1) Add HSPA channels (HS-DSCH and E-DCH)
to carry elastic traffic, on the same carrier.
2) Add a new 5 MHZ carrier that could be
shared between 3G and 3G+ or dedicated to
3G+.
The traffic being known, the dimensioning algorithm
aims to find the best configuration with the lowest cost,
for attaining a given blocking:
7. Conclusion
8. References
[1] H. Holma and A. Toskala, "WCDMA for UMTS: Radio
access for third generation mobile communications",
John Wiley & Sons, 3rd Ed. (2004).
[2] 3GPP TR 25.855, "HSDPA; Overall UTRAN
Description"; Release 5.
[3] 3GPP TS 25.309-640, "FDD Enhanced Uplink, Overall
Description, Stage 2, Release 6, 2005.
[4] T. Bonald and A. Proutire, "Wireless Downlink Data
Channels: User Performance and Cell Dimensioning",
ACM Mobicom'03, San Diego, September 2003.
[5] P. Zanierand D. Soldani, "A simple approach to HSDPA
dimensioning", IEEE PIMRC'05, September 2005.
[6] T. Chen, M. Kuusela and E. Malkamaki, "Uplink
Capacity of VoIP on HSUPA", IEEE VTC-spring'06,
April 2006.
[7] M. Bertinelli and E. Malkamaki, "WCDMA enhanced
uplink: HSUPA link level performance study", IEEE
PIMRC'05, September 2005.