Professional Documents
Culture Documents
05-Dimensioning/graduation Project
05-Dimensioning/graduation Project
p
Here only one circuit switched service is taken into account and hence the
calculations can use the standard Erlang blocking probabilities.
The packet data service offered is of the type
Jt is therefore difficult to
provide a dimensioning of packet data stating an exact average throughput. However.
For dimensioning we can assume that only the 64 kbps bearer will be available in the
speech Busy Hour (BH).
Jn the Figure below a sample RAN dimensioning process is shown. This method is by
no means the only way to dimension a network but it is a common method of doing
so.
p
pNaturally, the process is dependent on the particular scenario being dimensioned. The
process illustrated in the Figure below merely attempts to cover the most important
aspects.
pp p
p
"
" p
p
The uplink iteration process is designed to find the number of sites and loading that
produces a balance between the number of sites needed for coverage and capacity. As
the uplink load increases the number of sites required for capacity reduces since more
channels are available. However since the uplink interference margin (BJ )
increases with load the number of sites for capacity increases. This convergence of
site numbers is depicted in Figure below.
p
p
p
p
p pp
pp p
p
"
" p
p
p
p
pp
pp
p
pp p
p
"
" p
p
1- CALCULATE AVERAGE TRAFFIC PROFILE:
p
1-1 TRAFFIC:
p
Traffic theory attempts to obtain useful estimates, for example, the number of
channels needed in a cell. These estimates depend on the selected system and the
assumed or real behavior of the subscribers.
Traffic refers to the usage of channels and is usually thought of as the holding time
per time unit (or the number of "call hours" per hour) for one or several circuits
(trunks or channels). Traffic is measured in Erlangs (E).
An 'Erlang' is defined as one busy circuit for one hour. Jf the Mean Holding Time
(MHT) and Busy Hour Call Attempts (BHCA) of a system can be determined then
traffic per sub for the Busy Hour (BH) can be determined using the Equation below:
ppp
p
p
p
p
Where
The average traffic profile must be calculated for dimensioning purposes. The BH
traffic per sub for the CS services is given by the Equation below:
p p ppppp
pp p
The weighting factor is required in cases where the number of subscribers using the
different services is not the same.
We achieved our calculations on MATAB for two services (video and speech calls):
p
p
p
p p
! p
pp
" #
#
p p
" " ! p
pp
pp p"
$%& p
"!'(
#)!'( #) p
pp p
p
"
" p
p
pp
!'( #)!'( #) p
pp
#)$ " "&*$ &p p!)p p
pp
+,$!$ #)-+&& pp
p!)
pp
pp
p
!pp+ p
#) #)* p
pp
$+& p
#)!'( #)p .!/p0
12p3
p p
p
p
p
p
p
p
p
1-3 AVERAGE TRAFFIC PROFILE FOR PACKET SWITCH:
For dimensioning purposes it is necessary to calculate the average PS traffic profile
per sub, for the BH.
Ê ppp
pppp
ppp p
The Weighting factor is required in cases where the number of subscribers using the
PS services is different from the total MTS subscribers
We achieved our calculation on MATAB for the uplink and down link as the
following:pp
p
p
p
'454
#)#6'454
#)#
$789&p .6
/p5p:!
p'4*54 p
p
54
#)#6'454
#)#6$*
'454& p
p
'4
#)#654
#)#6'
454 p
pp
"!'( "#)!'( #) p
'4"'4
#) #6 " p
54"54
#)#6 " p
pp p
p
"
" p
p
2- ASSUME AN UPLINK LOAD:
We do not dimension for loads less than 20% and the maximum allowed load in this
network is 70% for and D. An initial loading figure of40% (a noise rise of 2.2
dB) is probably a good starting value.
We know that the conversational load (Qc) is equal to the number of speech channels
(M) divided by Mpole. Where Mpole is the theoretical limit for the number of Es
that a cell can support ( plinkMpo1e for Speech for a 3-sector urban site is 70),
therefore the number of channels can be derived from the formula below:
p pp!p
p
Assuming a GOS 2% the offered traffic for M channels can be calculated from the
Erlang table. Then we can calculate the number of subscriber per cell by the equation
below:
The number of capacity sites equal to the result of dividing the number of network
subscribers over the number of subscriber per site.
(
'4= p
pppp!(
'4'4 p
pppp>2
8* p
pppp?#
$ @A4 0B@&p
pppp$!*->& p
pppp!#)
$$ #);&& p
pppp!#)#
#
!#)
p
ppppp
pppp!#
$!'( #)!#)#
&p p
pppp p
pppp p
pp p
p
"
" p
p
4-UPLINK LINK BUDGET CALCULATION:
The margins that are relevant in the uplink are listed below:
p plink Jnterference margin (BJ ) [dB]
p og-Normal Fading margin (BNF) [dB]
p Power Control margin (BPC) [dB]
The maximum uplink path loss (r ) is given by the Equation below:
pp p
p
"
" p
p
4-3 SITES REQUAIRED FOR UPLINK COVAREGE:
After calculating the uplink maximum path loss for both PS and CS, we choose the
minimum path loss in order to calculate the cell radius.
,*+3p
p
Where
Į = (pmax ± a)/b
a and b are constant numbers and they differ according to the area (urban, rural «.)
Now after calculating the cell radius we can calculate the site coverage by the formula
below considering that the cell shape is a hexagon:
We can calculate the number of coverage sites by dividing the network area over the
site coverage area.
p p p
p
"
" p
p
- CHECK FOR COVERAGE J CAPACITY BALANCE:
On this step of our algorithm we will check if the number of capacity sites and
coverage sites are equal. So, if they are equal we will move to the next part, if not we
will increase the uplink load (step 3) and we will repeat the capacity and coverage
sites calculation (step 4&5).
p
1
$!#
H!#
& p
pppp%,p
#p p
pppp(
'4= p
pppp!$(
'4'4& p
pppp>2
8* p
pppp?#
$ @A4 0B@&p
pppp$!*->& p
pppp!#)
$$ #);&& p
pppp!#)#
#
!#)
p
pppp p
pppp!#
$!'( #)!#)#
&p .#
#/p
"D p
pppp p
pppp p
pppp9,p
#p
p
ppppC'4 $$ ,'4&& p'4p( p"87 p
pppp p
pppp44% p
pppp43=;+*;=*44*7*>!## p
pppp4!?'!?1 ,'4,C'4,43* p
pppp p
pppp44" p
pppp43"=;+*;=*44"*7*>!## p
pppp4!?"'!?1 ,'4",C'4,43"* p
pppp p
pppp41
#4!?!$4!?-4!?"& p
ppppp
pppp%9;Dp pEp')p
p32!pp"9D p
pppp)%+;88 p
pppp p
pppp$41
#4!? ,&) p
ppppAFp p
pA
p.6!/p"D p
pppp p
pppp#
$D7&$#G$%&&$AF8&p p#
p.6!8/ p
pppp!#
$
#
&p .#
#/p"D p
pppp p
pppp p
pppp'4'4*; p
pppp p
ppppp$'4I;=& p
pppppppp!# )?$@0p
#pp)
p
@ &p
ppppppp!! p
pppppppp)
2 p
pppp
p
pppp p
p
'4'4 ,;p
pp p
p
"
" p
p
- CHECK THAT MAXIMUM LOADING IS NOT EXCEEDED:
Conversational traffic has priority over packet (best effort) traffic. Therefore the best
effort load is the remaining system load available on top of the conversational load.
The maximum load Qmax is defined as the conversational load Qc for CS and the best
effort load Qbe for PS as shown in the Equation below:
p
p p
p
"
" p
p
ö- PERFORM DOWNLINK COVERAGE CHECKS:
The following downlink coverage limits must not be exceeded for the number of sites
we calculated it in previous steps.
Before these checks can be made the nominal power at the reference point, cell range
and load must be calculated.
The nominal power at the reference point is calculated by the following equation:
6Ê
pp"p(p"7(p*+p!p,p(p%"p-$ .p
p
2- Calculate the path loss at lkm cell range using the simplified Okumura-Hata as tha
Equation below:
3- Calculate the CPJCH signal attenuation (sa) at this range using the Equation below:
p
p p
p
"
" p
p
4- Calculate the downlink Jnterference margin (BlD ) at maximum load using the
Equation below:
ÊÊ
6 pprp(p 6Êp( rp-$ .p
p
p
6- We must check that this is below the limit (PCPJCH, ref <= 0.1 Pnom,ref) in order to
make sure that the limit is not exceeded.
p
p p
p
"
" p
p
pppp0,=9 p
pppp0= p
ppppA%79 p
pppp,p
pppp'p0*0*$ $A&&* p
pppp )p4 p
pppp%9;D p
ppppA;+9 p
pppp)%+;88 p
pppp4*$) $A&& p
pppp p
pppp )ppp4)p4p4)p4>pB p
pppp7;9 p
pppp p
pppp4)% p
pppp4 p
pppp4)7 p
pppp4>;8 p
ppppB7;+ p
pppp4#8)
$
$
#;
%9-@# @&& p
pppp4#4***4)*4*4)*4> ,Bp
pppp#
$
#;
98-@# @-4#& p
pppp4#
p;F$4#& p
pppp p
pppp )ppp
1p
p
pppp
1#8)
$
$
#;
==-@# @&& p
pppp
1;=+ p
pppp#
$
#;
9-@# @-
& p
pppp p
pppp p
pppp0#8)
$
$
#;
=D-@# @&& p
pppp0#8)
$
$
#;
7-@# @&& p
ppppE8; p
pppp p
pppp*E p
pppp0$;F$0&& ! p
pppp0;F$0& p
pppp)p00A p
pppp) p
pppp
4#
p
pppp
p
pppp*
p
ppppC54 $& p
pppp p
pppp"
4#*'*C54 p
pppp"
"
,% p
pppp"
;F$$"
,%&& p
ppppppppp#
$
#;
=-@# @-"
& p
pppp p
pppp"
1 p
p
p p
p
"
" p
p
ö-2 TOTAL POWER (PToT, REF <= 0.ö PNOM.REF):
To check the following calculations and whether it realizes this condition or not we
need the following calculation:
Ê6 pp Ê
6 pp (p
pprp%p!'
p
p
;'pCheck that Ptot,ref <= o.75 Pnom,ref ,pp if this condition is not realized then the limit
is exceeded and more sites will be needed.
p
p p
p
"
" p
p
ö-3 DCH POWER (PDCH REF <= 0.3 PNOM.REF):
6Ê
pp"p(p"7(p*+p!p,p(p%"p-$ .p
p
2- Calculate the downlink Jnterference margin (B l) at the specified load using the
Equation below:
p
PDCH,ref = sa + S E +BJD [dbm]
4- Check that PDCH,ref <= 0.3 PNOM.REF to make sure that the limit is not exceeded.
p
p
6Ê
pp"p(p"7(p*+p!p,p(p%"p-$ .p
p
2- Calculate the downlink Jnterference margin (BJD) at the specified load using the
Equation below:
Ê
6 p prp(p p( !rp-$ .p
4- Check that PDCH,Rf <= 0.3 Pnom,rof to make sure that the limit isn¶t exceeded
p
p p
p
"
" p
p
ppppA+ p
pppp)=;8 p
pppp'0*0* $A&*) p
pppp p
pppp p
pppp4#
p
pppp p
pppp;9 p
pppp0#8)
$
$
#;
=D-@# @&& p
pppp0#8)
$
$
#;
7-@# @&& p
ppppE;=8 p
ppppA%79 p
pppp
#8)
$
$
#;
=-@# @&& p
pppp4#
#8)
$
$
#;
=7-@# @&& p
pppp*E p
pppp0$;F$0&& ! p
pppp0;F$0& p
pppp)p00A p
pppp) p
pppp"
4#
p
pppp
p
pppp*
p
ppppC54 $& p
ppppC54C54 p
pppp p
pppp p
pppp#
$
#;
=+-@# @-C54& p
pppp p
pppp p
pppp p
pppp"
p'*pC54*p4# p
pppp"
"
,% p
pppp"
;F$$"
,%&& p
ppppp#
$
#;
D-@# @-"
& p
pppp"
1 p
pppp p
pppp p
p
p p
p