Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
Schemes in UMTS
Kamala Subramaniam
Advisor
Dr. Arne A. Nilsson
Outline
Overview of UMTS
Conclusions
What is UMTS?
Overview of UMTS
Conclusions
Rationale behind CAC
schemes
A UMTS network showing cellular architecture, where each cell is served by the Node-B and the Radio
Network Controller (RNC) serving a bunch of Node-B’s
CAC Terminology
New Call: When a mobile user wants to communicate to another, the Mobile Terminal (MT) obtains a
new channel from the Base Station (BS) it hears best. If a channel is available, the BS grants it and a new
call originates
New Call Blocking Probability (or simply blocking probability): If all channels are busy, the MT is
not granted the channel and the call is blocked.
Handoff Call: The procedure of moving between cells when a call is in progress is called a “handoff”.
During handoff the MT requests resources from the BS in the cell it is moving to.
Handoff Call Dropping Probability (or simply dropping probability): When the MT is denied a
channel in the cell it is moving to, the call is dropped.
Priority: Forced termination of a call in progress is more annoying than blocking of a new calling attempt
from the users point of view. Clearly, handoff calls must be given a higher priority.
Cell Dwell Time: After entering a cell, the time a MT resides in it.
Outline
Overview of UMTS
Conclusions
CAC Schemes
C = CA + CH;
C: Total Number of Channels
CA: Channels allocated to handle admitted calls (handoff and new)
CH: Guard channels allocated to handle handoff calls
New Call Admitted: if total number of calls (handoff and new) < CA
Handoff Call Admitted: if CA + CH < C
policy1.2
1
0.8
0.6
0.6
0.5
0.4
0.3
0.4 0.2
0.2 0.1
0 0
1 0.7
0.6
0.8
0.5
0.6 0.4
0.4 0.3
0.2
0.2
0.1
0 0
1.5
Probability : Phb Handoff Blocking
Blocking
“Hot” Vs “Cold”
Pr (call will request a handoff sometime after T) = Lh (t,T) for high-speed ; Ll (t,T) for low-speed
1
Directional Factor: α ij = ; Ni is the set of neighboring cells to cell i
| Ni |
1 ~
B ≤ C − R j − Bnew
used
Pnew = ~
0 B > C − R j − Bnew
used
Variations
Conservative: Ceiling value of Rj; may waste resources
Aggressive: Floor value of Rj; may increase dropping rate.
1 I
B used ≤ C - R j - B new - 1
F I
Pnew = 1 − R j B used = C - R j - B new
I
0
B used > C - R j - B new
where RjI is the integral part and RjF is the fractional part
Mobility Based Schemes
1. New Call Bounding Scheme
1
B ≤N &B ≤ C − Bnew
Pnew = usednew bnd used
0 otherwise
Hybrid Scheme
1 ~
B ≤ C - R - Bnew & B ≤N
Pnew = usednew j usednew bnd
0 otherwise
Results: Mobility Based
Schemes
N
1
ηUL = (1 + i ).∑ uplink load
W
j =1
1+
( Eb / N o ).Ri .υi
W = Chip Rate,R j = Bit rateof Jth user,υ i = voiceactivityfactor
E b /No = Signal energy per bit / Noise spectralDensity
∆L = 1
W
1+
υ.Eb / N o .R
Interference Based Schemes
1. Throughput Based Admission Control Strategy
N
1
ηUL = (1 + i ).∑ uplink load
W
j =1
1+
( Eb / N o ).Ri .υi
W = Chip Rate,R j = Bit rateof Jth user,υ i = voiceactivityfactor
E b /No = Signal energy per bit / Noise spectralDensity
υ j ( Eb / N o ) j
η DL = ∑ j =1 R j .
N
.[(1 − αav )+ iav ]
W
α av : average orthogonality of the cell
i av : the average downlink other - to - own cell interference ration of the cell
Interference Based Schemes
1. CAC Based on Signal to Noise Interference Ratio
uplink algorithm:
Eb Ci / Ri C PG
= = i i
N o ( N + I − Ci ) / W ( N + I i )
PG i : Processing Gain; I i = I - Ci : intereference experienced by the user i.
M-1 users in system, Mth user requesting access, minimum required power for new user is:
~ ( Eb / No ) target , M ( IM + N )
CM =
PGM
I M : interference seen by new user if accepted
I M +N : total power that the BS is receiving
downlink algorithm:
power with which the ith user channel is received at the ith MT:
(1 + N ) i
Ci =
1+( PGi /( Eb / N o ) i )
Power-based CAC, downlink, homogeneous traffic distribution: offered traffic vs. accepted traffic and
maximum dropping probability for different values of the ratio Pthr/Pmax.
Interference-based CAC, uplink, homogeneous traffic distribution: offered traffic vs. accepted traffic and
maximum dropping probability for different values of the threshold level.
Adaptive Call Admission Control
(ACAC)
Limit on acceptable interference threshold ↔ number of users of each service class
in local and neighboring cells
Obtain tradeoff between the number of voice and data users according to
outage/blocking probability.
(E )
Acceptable Interference level: γk ≅ b k = S k .W (k = 1,....., L)
I I .R k
o
∑ N ko Rkoγ ko + ∑
k =1 c =1
∑ ∑α
k =1 i =1
kic Rkcγ kc < W (1 − η )
where η = upper bound on the total received interference (0.1 < η < 0.25)
CAC schemes classified as capacity based, interference based, mobility based and adaptive
Guarantee QoS
Minimize Blocking/Dropping Probabilities
Minimize Interference
Provide priority to Handoff Calls
Handle Mobility
Adaptive CAC’s which may be a combination of the above CAC’s are best for a system design