Professional Documents
Culture Documents
Ravi R. Mazumdar
School of Electrical and Computer Engineering
Purdue University
E-mail: mazum@ecn.purdue.edu
Utility
Concave
Sigmoidal
Convex
Resource allocation
f(γ)
BPSK
DPSK
FSK
0
0 γ 20
Packet transmission success probability
max
M
X
Ui (x̄)
⇒ min Q(λ̄)
i=1 s. t. λ̄ ≥ 0̄,
s. t. gk (x̄) ≥ 0,
k = 1, 2, · · · , K
⇐ Q(λ̄) = max{
x̄∈X
M
X
Ui (x̄) +
K
X
λk gk (x̄)}
x̄ ∈ X i=1 k=1
max
M
X
Ui (x̄)
⇒ min Q(λ̄)
i=1 s. t. λ̄ ≥ 0̄,
s. t. gk (x̄) ≥ 0,
k = 1, 2, · · · , K 6⇐ Q(λ̄) = max{
x̄∈X
M
X
Ui (x̄) +
K
X
λk gk (x̄)}
x̄ ∈ X i=1 k=1
convex optimization
non-convex optimiza-
tion simpler constraints
smaller dimension
W Pi
γi (Ri , P̄ ) =
Ri θ( M
P
m=1 Pm − Pi ) + Ai
BPSK
DPSK
FSK
0 P 10
ECE, Purdue University – p. 17/50
Problem formulation
M
X
(A) max Ri fi (γi (Ri , P̄ ))
Pi ,Ri
i=1
PM
s. t. Pi ≤ P T
i=1
0 ≤ Pi ≤ PT , ∀i
0 ≤ Ri ≤ Rimax , i∈V
Ri = Ri∗ , i 6∈ V
4 W Pi W Pi
γi (Ri , Pi )= = = γi (Ri , P̄ )
R i PT − P i + A i Ri M
P
j=1 Pj − Pi + Ai
M
X
(B) max Ui (Pi )
i=1
PM
s.t. Pi ≤ P T
i=1
0 ≤ Pi ≤ PT , ∀i,
λmax
i = min{λ ≥ 0 | max {Ui (P ) − λP } = 0}, ∀i
0≤P ≤PT
User selection
Select users from 1 to K that satisfies
j
X
K = max { Pi (λmax
j ) ≤ PT }
1≤j≤M
i=1
Power allocation
PK
Find λ such that i=1 Pi (λ∗ ) = PT
∗
W : chip rate
γi∗ : constant that depends on fi
Ai = Ii /Gi : transmission environment of user i
Ii : intercell interference and background noise at user i
Gi : path gain from the base-station to user i
If P1 (λmax
2 ) ≥ PT , selecting only user 1 is optimal
Otherwise, selecting a subset of users can be optimal
Condition for optimal multiple access strategy depends on
time-varying parameters such as
number of users
type of users (utility functions)
channel condition of users
Static multiple access strategy could be inefficient
1
fi (γ) = ci { − di }
1+ e−ai (γ−bi )
BS BS BS
BS BS BS
BS BS BS
f1 = f 2
R1max 6= R2max (R2max = 6250)
Selection ratio of class i: the ratio of the number of selected
users to the number of users in class i
R1max = R2max
f1 6= f2 (a1 = a2 , b2 = 3.5)
If bi < bj , then fi (γ) ≥ fj (γ), ∀γ
class i has a more efficient transmission scheme than
class j
R1max = R2max
f1 = f 2
Class 1: inner region
Class 2: outer region
Ni Ps,i
γs,i (Ps,i ) =
θ(PT − Ps,i ) + As,i
Define
4
Us,i (Ps,i )= Ui (γs,i (Ps,i ))
The utility function varies randomly according to the
channel condition
M
X M X
X S
(C) max E{Ui }(= πs Us,i (Ps,i ))
Ps,i
i=1 i=1 s=1
S
X
s. t. E{Ui }(= πs Us,i (Ps,i )) ≥ Ci , i = 1, 2, · · · , M
s=1
M
X
Ps,i ≤ PT , s = 1, 2, · · · , S
i=1
0 ≤ Ps,i ≤ PT , ∀s, i
M
Usmp
X
(n)
(E) max (n) ,i (µ̄ , Ps(n) ,i )
i=1
M
X
s. t. Ps(n) ,i ≤ PT
i=1
0 ≤ Ps(n) ,i ≤ PT , i = 1, 2, · · · , M
mp (n) 4 (n)
Us(n) ,i (µ̄ , Ps(n) ,i )= (1 + µi )Us(n) ,i (Ps(n) ,i )
Similar to our previous problem
Ui∗ − Ci
P
i∈H
→ 0 as M → ∞
M
Asymptotically optimal
3.5
2.5
1.5
1
2 4 6 8 10
σ