Professional Documents
Culture Documents
= =
= =
=
+
=
=
(4)
where
total
P is the total system power constraint.
, i k
can only
be either 1 or 0, indicating whether the relay
i
r is chosen to
forward the data of
th
k subcarrier. Note that first constraint is
based on the aggregate power. And the last constraint
indicates that each subcarrier can only be allocated to one
relay to forward to the base station for the opportunistic
relaying strategy.
Theoretically, the optimization problem is a mixed binary
integer programming. Since the relay selection and power
allocation are coupling to make the optimization complicated,
it is hard to find the global optimum in terms of computational
complexity. Thus, the suboptimal algorithm with low
computational complexity should be found for practical
implementation. Therefore, we decomposed the joint resource
allocation problem into two sub-problems of opportunistic
relaying strategy and power allocation between source and
relay.
III. OPPORTUNISTIC RELAYING STRATEGY
For each subcarrier, there are potential Rrelays could
help forward the data to destination in the network, which
correspond to R possible relay selection strategy. Due to
simplification of the signaling and feedback overhead,
opportunistic relaying was adopted in this work. Thus the
source node compares the R relay channels and selects the
best relay node to send uplink data. Thus, in order to decide
the relay selection strategy, a criterion should be found to
evaluate the performance of each subcarrier at first.
For given total transmission power ( ) P k on
th
k subcarrier,
let , 1 (0,1) denote the fractions factor of total power
( ) P k allocated at the source and relay respectively. So we
have
,
( ) ( )
i
s r
P k P k = and
.
( ) (1 ) ( )
i
r d
P k P k = .Thus the
corresponding channel capacity on
th
k subcarrier in (3) can be
re-written as:
,
, , 2
0
,
2
0
( ) ( )
( ) min{ log (1 ),
2 /
(1 ) ( ) ( )
log (1 )}
2 /
i
i
i
s r
s r d
r d
P k G k
B
R k
N N B N
P k G k
B
N N B N
= +
+
(5)
Note that the first term is a monotonically increasing
function of , and the second term is a monotonically
decreasing function of in (5). Therefore, the optimal power
allocation at
th
k subcarrier can be easily gotten:
, ,
2 2
0 0
( ) ( ) (1 ) ( ) ( )
log (1 ) log (1 )
2 / 2 /
i i
s r r d
Pk G k Pk G k
B B
N NB N N NB N
+ = +
(6)
Thus the fractional factor of power allocation can be
deduced as:
,
, ,
( )
( ) ( )
i
i i
r d
s r r d
G k
G k G k
=
+
(7)
So the optimization rate of
th
k subcarrier can be written
as:
Joint Optimization of Opportunistic Relaying and Power Allocation in Cooperative OFDM Networks
, , *
, , 2
0
( ) ( )
( ) log (1 )
2 /
i
i
s r d
s r d
P k G k
B
R k
N N B N
= + (8)
where the equivalent channel power gain at
th
k subcarrier can
be expressed as:
, ,
, ,
, ,
( ) ( )
( )
( ) ( )
i i
i
i i
s r r d
s r d
s r r d
G k G k
G k
G k G k
=
+
(9)
Therefore, for given total average transmission power of
( ) P k at
th
k subcarrier, our opportunistic relaying strategy is to
select the relay with the largest equivalent channel gain, which
results in the largest channel capacity at
th
k subcarrier. That is,
the best relay
i
r node for
th
k subcarrier is selected as:
*
, ,
arg max ( )
i
i s r d
i R
r G k
= (10)
Hence in our opportunistic relaying strategy, the
equivalent gain on each subcarrier in (9) is computed and the
best relay node is found according to (10).
IV. SUBOPTIMAL POWER ALLOCATION
With the opportunistic relaying strategy proposed in
Section III, the optimization problem in (4) can be simplified
as:
( )
* *
* *
, ,
* *
* *
, ,
( ), ( )
1
, ,
1
, ,
max min{ ( ), ( )}
:
( ) ( )
( ), ( ) 0
i i
s r r d
i i
i i
i i
N
s r r d
P k P k
k
N
total
s r r d
k
s r r d
R k R k
subject to
P k P k P
P k P k i R
=
=
+
(11)
where relay
*
i
r is chosen according to (10) for each
subcarrier.
It can be seen that the original problem in (4) is
transformed into a convex optimization problem. And the
computably complexity of this convex optimization problem
would increase rapidly with the number of subcarriers. Thus a
suboptimal method with low-complexity power allocation
scheme should be proposed.
Let us assuming that N=1, which means that only one
subcarrier in the networks, it can be easily calculated that the
optimal power allocation scheme should be satisfied with:
* *
, ,
, ,
( ) ( ) ( ) ( )
i i
i i
s r r d
s r s r
P k G k P k G k = .It means that if the power
allocation among each subcarrier is given, then the optimal
power fractional faction between source and relay is gotten.
Motivated by this extreme condition, thus we decomposed the
power allocation problem into two steps as followings.
A. Power Allocation among the subcarriers
Note that if our opportunistic relaying strategy at each
subcarrier is gotten, then the corresponding equivalent channel
power gain ( ) G k at
th
k subcarrier can be calculated as (9).
Thus the power allocation problem among subcarriers can be
written as:
2
( )
1 0
1
( ) ( )
max log (1 )
2 /
:
( )
N
P k
k
N
total
k
B P k G k
N N B N
subject to
P k P
=
=
+
(12)
where ( ) P k stands for the total power allocated at
th
k subcarrier. It is clear that the optimal power allocation is
water-filling solution [12]. So using Lagrange optimization
method, power allocation scheme among the subcarriers is
calculated as:
0
/ 2 ln 2
( )
( )
N B N N
P k
B G k
+
=
(13)
where ( ) max( , 0) x x
+
.And should satisfied the total
system power constraint.
B. Power Allocation between the source and the relay on
each subcarrier
If the power allocation among subcarriers is gotten, the
optimal power faction between source and relay should satisfy
with:
, , , ,
( ) ( ) ( ) ( )
i i i i
s r s r r d r d
P k G k P k G k = .Thus, the power
allocation distributed at the source and relay is calculated as:
,
,
, ,
,
,
, ,
( ) ( )
( )
( ) ( )
( ) ( )
( )
( ) ( )
i
i
i i
i
i
i i
r d
s r
s r r d
s r
r d
s r r d
G k P k
P k
G k G k
G k P k
P k
G k G k
=
+
=
+
(14)
So our sub-optimal power allocation algorithm can be
summarized as:
1) calculate the equivalent channel power gain in (9)
and allocate the power among each subcarrier according
to (13).
2) allocate the power between source and relay for each
subcarrier using (14).
Therefore, the complexity of the suboptimal power
allocation algorithm presented in this section consists of two
parts: 1) PA among subcarriers with the complexity of O(K),
2) PA between source and relay on each subcarrier with the
complexity of O(K). Hence, the complexity of the proposed
algorithm is O(2K), in which the complexity is linear in the
number of subcarrier, which is attractive in practical
application for OFDM networks.
V. SIMULATION RESULTS
In this section, we present simulation results to show the
performance of the proposed joint opportunistic relaying
strategy and power allocation algorithm.
In our simulation, the wireless channel is modeled as a
frequency-selective channel consisting of six independent
Rayleigh multi-paths. Each multi-path component is modeled
as Clarkes flat fading model. It is assumed that the power
delay profile is exponentially decaying with
2l
e
, where l is
the multi-path index. The total available bandwidth is 1 MHz.
Proceedings of the 15th Asia-Pacific Conference on Communications (APCC 2009)-078