Resource Allocation

Resource Allocation
in WiMAX
Laura Cottatellucci
laura.cottatellucci@eurecom.fr
I. Outlines 2
Outlines
1. Single-Cell OFDMA Networks

2. Multicell OFDMA Networks
3. OFDMA Networks with Relays
Cottatellucci: Resource Allocation in WiMAX c Eurecom 11 February 2008

°
II. WiMAX Physical Layer 3
Variants of WiMAX PHY
Designation Function LOS/NLOS Frequency Duplexing

WiMAN-SC Point-to-Point LOS 10-66 GHz TDD, FDD
WiMAN-SCa Point-to-Point NLOS 2-10 GHz TDD, FDD
WiMAN-OFDM Point-to-Multipoint NLOS 2-10 GHz TDD, FDD
WiMAN-OFDMA Point-to-Multipoint NLOS 2-10 GHz TDD, FDD
WiMAN-HUMAN Point-to-Multipoint NLOS 2-10 GHz TDD
We focus on WiMAN-OFDMA

°
III. Single-Cell OFDMA Networks 4
System Model
h11 • K : number of users

• N : number of subcarriers
h1N
user 1
• hkn : channel gain of user k in subcarrier
h21 base station
n
h22
. h2N • pkn : power of user k in subcarrier n
2
hK1
hK2
hKN
• γkn = |hσkn2 | : normalized SNR of user k
user 2 in subcarrier n
• rkn = log(1 + pknγkn) : maximum achiev-
user K able rate by user k on tone n
In single-hop OFDMA resource allocation consists in jointly

assigning subcarriers and allocating powers.
°
Resource Allocation in Downlink: Problem Definition

Sum Rate Maximization Problem
K X
X
maximize log2(1 + pknγkn)
k=1 n∈Sk
Object: maximize the sum XK X
rate under a constraint on the subject to pkn ≤ Ptot,

k=1 n∈Sk
maximum transmitted power.
Sj ∩ Sk = ∅ ∀j 6= k
∪K
k=1 Sk ⊆ {1, 2, . . . , N }
SUM RATE
pkn ≥ 0 ∀k and ∀n
• Sk : set of subcarriers allocated to user k

°

K X
X
k=1 n∈Sk

k=1 n∈Sk
Sj ∩ Sk = ∅ ∀j 6= k
∪K
k=1 Sk ⊆ {1, 2, . . . , N }
MAXIMUM POWER CONSTRAINT

°

K X
X
k=1 n∈Sk

k=1 n∈Sk
Sj ∩ Sk = ∅ ∀j 6= k
∪K
k=1 Sk ⊆ {1, 2, . . . , N }
ORTHOGONALITY CONSTRAINT
Nonconvex optimization problem

with exponential complexity in the number of users and subcarriers.

°
Resource Allocation in Downlink: Problem Definition (2)
Power Minimization Problem

K X
X
minimize pkn
k=1 n∈Sk
Object: minimize the trans- X
mitted power under con- subject to log2(1 + pknγkn) ≥ Rk ∀k
n∈Sk
straints on the minimum Sj ∩ Sk = ∅ ∀j 6= k
transmitting rates. ∪K
k=1 Sk ⊆ {1, 2, . . . , N }
SUM POWER
• Rk : Target rate for user k

°

K X
X
minimize pkn
k=1 n∈Sk
n∈Sk
k=1 Sk ⊆ {1, 2, . . . , N }
MINIMUM RATE CONSTRAINTS

°

K X
X
minimize pkn
k=1 n∈Sk
n∈Sk
k=1 Sk ⊆ {1, 2, . . . , N }
ORTHOGONALITY CONSTRAINT

with exponential complexity in the number of users and subcarriers.
°
Resource Allocation in Uplink: Problem Definition

K X
X
Object: maximize the sum k=1 n∈Sk
X
rate under independent con- subject to pkn ≤ P k , ∀k
n∈Sk
straints on the maximum
Sj ∩ Sk = ∅ ∀ 6= k
transmitted power for each
∪K
k=1 Sk ⊆ {1, 2, . . . , N }
user.

°
IV. Fundamental Results in Optimization 8
Lagrange Duality
Primal Problem Define:
L
• Lagrange multipliers: λ = (λ1, . . . , λM )T
X
maximize f`(x) • Lagrangian:P
`=1 T P
M
L(x, λ) = ` f`(x) + λ (P − m hm(x))
X
subject to hm(x) ≤ P
m=1 • Dual objective: g(λ) = maxx L(x, λ)
Dual Problem
• f`(x) : not necessarily concave
• hm(x) : not necessarily convex minimize g(λ)
subject to λ≥0
x∗ : solution primal problem (λ4, x4) : solution dual problem

PL
For convex problems `=1(f`(x∗) − f`(x4)), the duality gap is zero!...
....We can equivalently solve the dual unconstraint problem!
°
Fundamental Results in Nonconvex Optimization∗

Definition of Time Sharing Condition : Consider the maximum value of the primal problem
as a function of the constraint P. If such a function is concave in P then the primal
problem satisfies the time sharing condition.
If the primal optimization problem satisfies the time sharing property,

then it has zero duality gap,
i.e. the primal problem and the dual problem have the same optimal value.
slope=λ
P ∗
P ∗
n fn (x ) λ∗ n fn (x )
g(λ) λ∗
P
λT (P − x∗ )
hm (b f ∗ = g∗ g∗
f ∗ 6= g ∗
P
x∗ )
n fn (b
P P P
x∗ )
hm (b P hm (x∗ ) P hm (x∗ )
(*) W. Yu and R. Lui, Dual methods for nonconvex spectrum optimization of multicarrier systems, 2006.

°
Application to Multicarrier Systems

As the number of subcarriers tends to infinity the sum rate maximization and the sum
power minimization problems in uplink and down link satisfy asymptotically the time sharing
conditions (Yu et al. 2006, Seong et al. 2006).
This property holds also when additional constraints (e.g. integer bit loading) are enforced
We can solve the unconstrained dual problem

and obtain an almost optimum solution!
When applied to OFDMA systems the joint search over users

and subcarriers decouples and the search has linear complexity
in the number of users and tones, i.e. O(KN ).
Joint subcarrier and power allocation is feasible in real-time systems!!!

°
An Example:
Sum Rate Maximization in Downlink via Duality
Dual function Algorithm
N X
X K XX
g(λ) = max rkn + λ(P − pkn)
{pkn } Initialization: set λ = λ0 > 0, ε > 0
n
n=1 k=1 k
Ã K !
XN X repeat
= max rkn − λpkn +λP for n = 1 . . . N
{pkn }
n=1 k=1
| {z } select k ∗ maximizing gn(λ)
gn(λ)
X determine pk∗n maximizing gn(λ)
= gn(λ) + λP
n
endfor
The maximization of the dual function re-
update λ according to
duces to N independent concave maximiza- gradient/elipsoid criterion
X
tion problems! until |P − pk∗n| < ε
n
max g(λ) with λ≥0
λ

°
An Example:
N X
X K XX
n
n=1 k=1 k
Ã K!
XN X repeat
{pkn }
n=1 k=1
LINEARXCOMPLEXITY gn(λ) IN K ! determine pk∗n maximizing gn(λ)
= gn(λ) + λP
n
endfor
update λ according to
X
n
maxg(λ) with λ≥0
λ

°
An Example:
N X
X K XX
n
n=1 k=1 k
Ã K!
XN X repeat
{pkn }
n=1 k=1
gn(λ)
X determine pk∗n maximizing gn(λ)
= gn(λ) + λP
endfor
LINEAR COMPLEXITY IN KN !update λ according to
n

X
n
maxg(λ) with λ≥0
λ

°
V. Single Cell: State of Art 12
Resource Allocation in Downlink: State of Art
• Max-min problem: it maximizes the worst user rate.

• Proportional fairness: like the sum rate maximization problem but with the
additional constraints of given ratios among the user rates, i.e. Rk is a given
fraction α of the total rate.
Shen, Andrews, and Evans, Adaptive resource allocation in multiuser OFDM systems
with proportional fairness, December 2005
• Hard fairness, which coincides with the sum power minimization problem.
• Unified framework for a large class of utility functions.
Song and Li, Crosslayer optimization for OFDM wireless networks. Part I: Theoretical
framework, March 2005.
These approaches do not exploit Lagrange duality for joint optimization
If the optimization problem with fairness satisfied the time-sharing condition,
the dual approach would improve performance and complexity!!

°
V. Single Cell: State of Art 13
Resource Allocation in Uplink: State of Art

• Game theory tools to enforce fairness in centralized approaches.
Han, Ji,Ray Liu, Fair multiuser channel allocation for OFDMA networks using NAsh
Bargaining and coalitions, August 2005.
• Bayesian games to develop distributed algorithms with partial and/or sta-
tistical knowledge of the channel state information at the transmitters.
He, Gault, Debbah, and Altman, Correlated and non-correlated equilibria for multiuser
OFDM systems, January 2008
Advantages: No feedback channel for information on resource allocation.
Resource allocation possible also in critical situation when complete CSI
is not available or not reliable.
Disadvantages: Possible performance degradation.
Possible collisions on the same subcarrier with consequent nonzero out-
age probability for slow fading channels.

°
VI. Multicell OFDMA Networks 14
Frequency Reuse
The system band is divided in different rf sub-bands. Each cell communicates only on
a sub-band. Adjacent cells transmit on disjoint sub-bands. r1 is the reuse factor.
f
The inter-cell interference can be ne-

glected. Single-cell resource allocation al-
gorithms are applicable.
Drawbacks
• Loss in spectral efficiency
• Complex coloring problem (even more complex
with relays)
Frequency reuse factor 1 • Cell planning

3

°
Dynamic Frequency Reuse
All cells can use the whole available bandwidth but the resource
allocation takes into account the global interference in the network.
• Scalability problems
• Scalability faced with distributed resource allocation algorithms
• Distributed approach available for statistical knowledge of the interference
Kiani, Øier, Gesbert, Maximizing multicell capacity using distributed power allocation and
scheduling, March 2007
Applicable to dense networks under the assumption of two power levels

°
Centralized Power Allocation for Two-Cell Network

Ponukumati et al. 2008
(1) (2)
h1k h2k
base station 1 base station 2
(2) (1)
h1k h2k
user 2
user 1
cell 1 cell 2
K1 users in cell 1
K2 users in cell 2
• Cooperative resource allocation (maximization of the sum rate in both cells).

• Centralized approach with perfect CSI.
• Single user detector at the receiver.
• Joint subchannel and power allocation via duality.
• Complexity order linear in the number of subcarrier and linear in K1K2, i.e.
O(N K1K2)

°
Optimum Resource Allocation vs Frequency Reuse 1/2

System Setting 130
sum rate with optimal allocation
• Rayleigh fading channels 120

sum rate with frequency reuse 0.5
• Subcarriers N = 16 110
Sum capacity in bits/channel use

100
• Users K1 = K2 = 2 90
• Variance of the channel gains 80

(1) (2)
h1k and h2k , σd2 = 1 70
• Variance of the channel gains 60
(2) (1)
h1k and h2k , σi2 = 0.1 50
40
10 20 30 40 50 60 70
Total power available in two cells in watts
Huge gain with optimum resource allocation!

°
Duality Gap for Finite N
32 70
total power allocated with optimal allocation total power allocated with reuse 0.5
total power allocated with reuse 0.5 total power allocated with optimal power allocation
30
60
Total power allocated in both cells in watts

28
50
Total power allocated in watts
26
40
24
22 30
20 20
18
10
16
0
0 10 20 30 40 50 60 70
14
16 18 20 22 24 26 28 30 32 Total power available in both cells in watts
Total power available in both cells in watts
Subcarriers N = 8 Subcarriers N = 16
The duality gap decreases rapidly when the number of subcarriers increases

°
Optimum Resource Allocation vs Frequency Reuse 1/2

System Setting 70
• Rayleigh fading channels

65
• Subcarriers N = 8
Sum capacity in bits/channel use

60
• Users K1 = K2 = 2
55
• Variance of the channel gains

50
depending on the distance
from the base station 45
40
35
16 18 20 22 24 26 28 30 32
Total power available in two cells in watts
Huge gain with optimum resource allocation!

°
VII. OFDMA Networks with Relays 20
Relay Channel and...

Relay Channels
The source transmits a signal to the relay and des-
Relay tination, the relay forwards the received signal to
the destination
• Orthogonal/Nonorthogonal
Source Sink
• Decode-Forward (DF), Compress-Forward (CF),
Amplify-Forward (AF)
The best strategy depends on the channel conditions.
Roughly, DF is optimum if the source-relay channel
is good compared to the relay-destination channel.
Viceversa, CF is preferable.
• Relay deployed or end users acting as relays.

• Increase capacity and diversity and decrease outage
probability.

°
...Cooperative Diversity
T1 T3 data T1 T1 T2 T2
Tx T1 T2 T2 T1
T2
The nodes cooperate to create a virtual multiele-
T4
ment antenna system used for half of time by T1
and half time by T2.

°
Resource Allocation in Relay Assisted OFDMA Networks

The optimal allocation implies joint optimization of:
1. Selection/Deployment of relay nodes 3. Subcarrier assignment (OFDMA)
2. Selection of a relaying strategy 4. Power allocation
(decode-forward, amplify-forward)
Main Issues Arising in Relay Networks

1. High complexity of joint resource allocation
2. Signalling very costly for centralized resource allocation
(source-relay, relay-destination, source-destination CSI)
3. Scaling problems
Research Objectives
Design of resource allocation algorithms which are
• joint (relay node and strategy selection/ power and subcarrier allocation)
• distributed (to reduce signaling, improve scalability)
• low complexity.

°
Joint Resource Allocation: Problem Definition
• Uplink and downlink traffic: K + 1 nodes.
• 2K possible flows {(1, K + 1), . . . (K, K + 1), (K + 1, 1), . . . (K + 1, K)}.
• P: (K + 1) × N matrix of power allocation with at most two nonzero elements per column.
• R: 2K × N matrix of rates with at most one nonzero elements per column.
• (P1)m : total transmitted power by node m.
• (R1)m : total achievable rate by node m.
K+1
X
maximizeP,R Um((R1)m)
m=1
subject to P1 ¹ Pmax and R ∈ C(P)

°
Joint Resource Allocation via Duality

Ng and Yu, 2007
Equivalent problem
K+1
X
maximizeP,R,t Um((t)m)
m=1
subject to P1 ¹ Pmax and R1 º t R ∈ C(P)
The dual method splits into two problems

X
gappl(λ) = max (Um(t) − λmtm)
t
and
 P P
max λm
n R(m, n)
gphy (λ) = P,R
s.t.P1 ¹ Pmax, R ∈ C(P).
The physical problem can be split further.

°
VIII. Further Topics in Resource Allocation 25
Cross-layer Resource Allocation

Typically, power and subcarrier allocation
in uplink and downlink are performed ignoring the scheduling needs.
As a consequence, the resource allocation algorithm may allocate resources

for an empty queue and assign very low resources to a queue in overflow
Object: joint scheduling and resource allocation!
• Maximum weight matching scheduling (developed for OFDM downlink systems) takes
into account the instantaneous state of the queue and the channel.
• Queue proportional scheduling (developed for broadcast fading channels and OFDM
fading channels) takes into account the queuing process and channel statistics and
implies a more long term policy.

°
VIII. Further Topics in Resource Allocation 26
Further Topics
Bitloading
MIMO systems
Resource allocation and adaptive coding and modulation
Crosslayer: Routing and power allocation
Distributed versus centralized algorithms.
Fairness.

°
IX. Conclusions 27
Conclusions
Joint resource allocation in single cell is doable in practical systems.
Joint resource allocation in certain relay assisted networks can be

decomposed in sub-problems without loss in performance.
Frequency reuse 1 provides huge improvement in spectral efficiency in

multicell networks. There is still a problem of scalability for
implementation in practical systems.
The time sharing condition for optimization problems can be exploited

really efficiently in multicarrier systems.

°
28
Thank You for Your Attention!
Questions?

°

Resource Allocation

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Resource Allocation

Uploaded by

Copyright:

Available Formats

Resource Allocation

1. Single-Cell OFDMA Networks

Cottatellucci: Resource Allocation in WiMAX c Eurecom 11 February 2008

Variants of WiMAX PHY

Designation Function LOS/NLOS Frequency Duplexing

WiMAN-SCa Point-to-Point NLOS 2-10 GHz TDD, FDD

WiMAN-OFDM Point-to-Multipoint NLOS 2-10 GHz TDD, FDD

WiMAN-OFDMA Point-to-Multipoint NLOS 2-10 GHz TDD, FDD

WiMAN-HUMAN Point-to-Multipoint NLOS 2-10 GHz TDD

Cottatellucci: Resource Allocation in WiMAX c Eurecom 11 February 2008

h11 • K : number of users

In single-hop OFDMA resource allocation consists in jointly