Power Control Based QoS

Provisioning for Multimedia in

W-CDMA

Presented by: Jianhua Sun

Outline
• Background
• Power Control Problem Defined
• Solution - Dynamic Resource Scheduling
• Simulation and Performance Evaluation
• Conclusion
 Background
• W-CDMA: the Potential Air Interface
Technology
• Power Control is an Important Part of
Resource Management
Power Control Problem Defined
• Conventional Power Control
• Enhancements to Conventional Approach
• Optimal Power Control for Variable QoS in
CDMA
 Conventional Power Control
• Near-far effect: Strong users degrade the
performance of weak users
• Power Control: Increase system capacity
while maintain Signal to Interference Ratio
(SIR)
• Conventional Power Control: Scaling the
transmission power levels according to rates
 Enhancements to Conventional
Approach
• Minimize the total transmitted power
• Minimize the power consumption and
maximize system capacity for the multi-rate
CDMA system
• power control function based on traffic
exponent, which maximize capacity
 Optimal Power Control for
Variable QoS in CDMA

• Uses Minimum Total Power approach

• Definitions
• QoS requirements
 Definitions
• N: number of users • Gi: spreading gain, =
admitted Rc/Ri
• Each user i specifies a • hi: channel coefficient
minimum QoS in terms
 i: power spectra
of SIR, i and its rate Ri
density
• W: communication
• Pi: Power for user i
system bandwidth
• Rc: chip rate
• the instantaneous SIR of each user:
Si = GihiPi/(kihkPk + 0W) (1)
• Find vector P = [P1, P2, ..., PN] that
minimizes the total power:
Ni=1Pi (2)
such that the QoS requirements are satisfied, i.e.
Si  i, i = 1, 2, ..., N. (3)
• second constraint, power Pi for each mobile
is limited by 0  Pi  Pi' (4)
 Solution
• Solve the above linear programming problem, the
optimal solution can be derived as:
Pi = gi0W/(hi (1-Nl=1gl) ) (5)
where gi is the power index,
gi = i / (i + Gi) (6)
• The solution exists as long as a finite and feasible
level of power can be found.
• Connection Admission Control
Nl=1gl < 1-0W/mini(Pi'hi/gi) (7)
 Solution - Dynamic Resource
Scheduling
• System Framework
• Admission Control
• QoS Maintenance
• Spreading strategies
System Framework
 Spreading strategies
• Fixed Spreading Gain DRS (FSG-DRS)
• Variable Spreading Gain DRS (VSG-DRS)
• Multi-Code DRS (MC-DRS)
 Fixed Spreading Gain DRS
(FSG-DRS)
• Constant Gi through the course of the
session
• For VBR services, the code assignment has
to be done according to the PEAK rate
• Called no code hopping DRS
 Variable Spreading Gain
DRS(VSG-DRS)
• power index gi(k) is modified for every radio frame k:
gi = i / (i + Gi(k)) (8)
• Power scheduling is modified for each radio frame k:
Pi(k) = gi(k)0W/(hi (1-Nkl=1gl(k)) ) (9)
Nk: the number of active sessions in radio
frame k.
• Called code hopping DRS
 Multi-Code DRS (MC-DRS)
• The rate for radio frame k is expressed in
multiples of basic rate Ri = mRs
• aggregate power index for session i:
gi(k) = n(k)i / (i + Gs) (12)
• poer for each stream s:
Psi(k) = g si0W/(hi (1-Nkl=1gl(k)) ) (13)
• Total power for the session
Pi(k) = n(k) Psi(k) (14)
 Simulation and Performance
Evaluation
• Simulation Model
• Experimental Results
 Simulation Model
• Optimized Network Engineering Tool's
(OPNET) Radio Modeler was used to model
the wireless network
• A single indoor cell configuration with the
mobiles scattered, mobility is not taken into
account for the time being
• DRS is implemented in both the mobile
terminals and the base station
OPNET models (a)Network Model
Mobile terminal and base station
 Experimental Results
• UBR Throughput
• Average Total Power
• QoS Stability
 UBR Throughput

Throughput comparison of conventional and DRS algorithms

 Average Total Power

Power requirements of conventional and DRS algorithms

SIR (voice)

SIR versus time

Average BER

Average BER
 Conclution
• All DRS schemes outperformed the
convention approach for global QoS
maintenance
• VSG-DRS and MC-DRS outperformed the
FSG-DRS for resource allocation + capacity
• MC-DRS is less stable
• VSG-DRS is the best compromise scheme