Resource Allocation in OFDM Based Wireless Relay Networks ...
Resource Allocation in OFDM Based Wireless Relay Networks ...
Resource Allocation in OFDM Based Wireless Relay Networks ...
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
5.4 Lifetime Maximization Scheme<br />
5.4 Lifetime Maximization Scheme<br />
Introduc<strong>in</strong>g an auxiliary variable t, we first reformulate the problem as<br />
max<br />
p n,k ,q n,k ,t<br />
t (5.6)<br />
s.t. t ≤ EDF n<br />
∑ K<br />
k=1 p , t ≤ EAF n<br />
∑ K<br />
n,k<br />
k=1 q , ∀n<br />
n,k<br />
K∑<br />
K∑<br />
r n,k ≥ R, p n,k ≤ P n ,<br />
k=1<br />
K∑<br />
q n,k ≤ Q n ,<br />
k=1<br />
k=1<br />
∀n<br />
p n,k ≥ 0, q n,k ≥ 0, ∀n, k.<br />
∀n<br />
Chang<strong>in</strong>g the variable t = 1 , we can reformulate the above problem <strong>in</strong>to an<br />
z<br />
equivalent standard convex optimization problem:<br />
m<strong>in</strong><br />
p n,k ,q n,k ,z<br />
s.t.<br />
z (5.7)<br />
K∑<br />
k=1<br />
K∑<br />
k=1<br />
R −<br />
p n,k − zE DF<br />
n ≤ 0, , ∀ n<br />
q n,k − zE AF<br />
n ≤ 0, ∀ n<br />
K∑<br />
r n,k ≤ 0,<br />
k=1<br />
K∑<br />
q n,k − Q n ≤ 0,<br />
k=1<br />
K∑<br />
p n,k − P n ≤ 0,<br />
k=1<br />
∀n<br />
z ≥ 0, p n,k ≥ 0, q n,k ≥ 0 ∀ n, k,<br />
∀n<br />
where the first two constra<strong>in</strong>ts are l<strong>in</strong>ear <strong>in</strong> z.<br />
In problem (5.7), we can always choose a large enough value of z such that<br />
the energy constra<strong>in</strong>ts are satisfied with strict <strong>in</strong>equality. In addition, we assume<br />
that there always exists a feasible solution such that the rate and the maximum<br />
power constra<strong>in</strong>ts are satisfied with strict <strong>in</strong>equality (However, at optimality the<br />
rate constra<strong>in</strong>t R − ∑ K<br />
k=1 r n,k ≤ 0, ∀n holds with equality). Thus the Slater’s<br />
88