Cooperative OFDMA

1 Introduction
Relay selection methods for OFDM and Cooperative OFDM systems
The authors in [2] have compared the diversity gains for selective OFDM and
selective OFDMA relay selection strategies. They have considered an M hop
cooperative system that conveys the information of the source node to the des-
tination. Each hop has a relay cluster where there are L relays.The selective
OFDM relaying chooses the best relay, which has the one with the highest com-
bined SNR, at each hop and the entire OFDM block is sent through this selected
relay. However in selective OFDMA relaying, the relaying is done on a per sub-
carrier basis. Each subcarrier selects the best relay according to the SNR, at
each hop. The relaying schemes are shown in figure 2. Decode and forward
relaying strategies can be used for selective OFDM relaying on the other side
symbol detection for selective OFDMA relaying is enough, which makes it more
beneficial by reducing the level of processing computation and decoding delay.
However the authors also showed that even more gain can be obtained by also
using decode an forward relay strategy in selective OFDMA relaying. The most
time requiring problem in selective OFDMA relaying is to gain the information
of the channel states of each relay. The authors have considered this problem by
also presenting distributed relay selection [4]. According to this model each re-
lay has a timer for their channel gain and the higher the channel gain the shorter
the timer. So the relay with the best channel condition expires first and sends
a flag message. All other relays that remain silent back off when they hear this
message. This technique can be applied to selective OFDM relaying, by setting
the timer the sum of all the subchannel gains. The one with the highest sum
would be selected. However for selective OFDMA relaying this must be done for
each subcarrier, where it brings an increase in the delay. This happens to be a
trade off between performance and delay. The authors have suggested a solution
by grouping N subcarriers into G groups and the performance of grouping has
been shown in figure 4. As we have mentioned about distributed relay selection
methods the authors in [7] have adopted this method and analyzed delay queue
aware power and relay selection control for delay sensitive systems. They have
also considered delay optimal relay selection and power control in [8]. However
these papers will be considered later in detail.
The selective OFDMA relaying strategy has been adopted by the authors
in [6] along with an additional power minimization problem under total power

1
and transmission rate constraints. They have also considered multi battery
operated source destination pairs. The allocation guarantees different target
and bit error rates demanded by the users.determining the best assignment of
relays and sub-channels,it will provide possibility to trade-off between overall
transmission power, users QoS constraints and network lifetime. The source
sunchannel decides whether it communicates directly or cooperatively and at
the relay the same subchannel is used to be forwarded. So the authors have
calculated the powers based on each subcarrier-user pair, that will be used if
there is cooperation or not.Pmax is the total allowed transmit power for each
user and Rm and bmn are the target rate and bit rates. The objective is to
allocate subchannel, bits and power in order to minimize the total tranmit
power Pt under BER and rate constraint. The users themselves have a rate and
power constraint. This problem is said to be a non convex and NP hard, so
they propose a new suboptimal algorithm that iteratively solves this problem
in three steps. step 1 chooses a privileged user based on fairness criteria. Step
2 assigns relays and subcarriers to the selected user inorder to minimize its
transmission power under BER and data rate constraints. Step 3 power and
bits are allocated to the assigned subcarriers using water filling so that it reaches
its target bit rate. During the algorithm process, if allocating more subcarriers
to a user would not decrease its transmission power, the user is removed from the
allocation process. The algorithm will terminate when all users leave the process
or all subcarriers would be occupied by users. Some fairness criterions have been
considered in this paper which can be named as criteria A: Minimization of the
power consumption of the least privileged user, i.e. the user with the most
transmission power or worse channel conditions, criteria B: Minimization of the
power consumption of the least privileged user, i.e. the user suffering from the
weakest remaining battery level, criteria C: Combination of criterion (A) and
(B). The iteration graph can be shown in figure 1.
paper 14:
Since the complexity of a per subcarrier relay selection is high even for a
centralized system, some authors have found it more preferable to use selective
OFDM relaying. Such as the authors in [9] have focused on a decode and for-
ward distributed relay system, where one relay is selected to transmit the whole
OFDM block. The authors considered multiple relays serving a single source
and a single destination and it is assumed that there are no direct links between
them. The authors have calculated the outage performance and presented six
relay selection methods. The total required rate is Rtot and so the subcarrier
rate is Rtot /N . Next Pout is calculated as the multiplication of the probability
of outage for each relay. Probability of outage for each relay is calculated as the
multiplications of probabilities for each subchannel outage, which is the mini-
mum of the channel rates SI and ID bening less than R for the selected relay
i. Moreover the channel gain of the relay i is computed as Gi = min(Gsi , Gid ).
The six relay selection schemes are presented below:

A . Geometric mean-based relay selection: In this scheme, the relay with the
largest geometric mean of Gi is selected, the optimal relay, ropt , is given as;

2
 Figure 1: iteration diagram

Figure 2: relaying diagram, (a)selective OFDM relaying , (b) selective OFDMA

relaying

3
 ropt = maxi=1,...,M Geomean(Gi (n))

B . Harmonic mean-based relay selection:In this scheme, the relay with the
largest harmonic mean of ropt = maxi=1,...,M Harmmean(Gi (n))
C .Trimmed mean-based relay selection:In this scheme, the relay with the largest
trim mean of ropt = maxi=1,...,M T rimmean(Gi (n))
D .Arithmetic mean-based relay selection:In this scheme, the relay with the
largest arithmetic mean of ropt = maxi=1,...,M mean(Gi (n))
E .Maximum mean-based relay selection:In this scheme, the relay with the
largest maximum mean of ropt = maxi=1,...,M maxn (Gi (n))
F .Minimum-based relay selection:In this scheme, the relay with the largest
minimum mean of ropt = maxi=1,...,M min(Gi (n))

Monte Carlo simulations have been used to find the theoretical solution of
the outage problem. According to ?? the simulation results are presented. It
can be seen that all these methods are much better than direct solutions and
the minimum based relay selection has almost the same performance as the
theoretical solutions.

Resource Allocation for Multi Cell Cooperative OFDMA: the previ-

ous works in literature have considered resource allocation problems for single
cell transmissions. However when multiple cells are considered the performances

Figure 3: Outage probability of the six relay selection methods

4
may not be as good as it is for single cells. The main problems that occur in
multi cell communications is intercell interferance. This factor degrades the
system performance and occurs more when the cell sizes are small (close base
stations) and frequency reuse factor is high. Joint resource allocations must be
considered for these systems. When relays and cooperation come in to use, there
may be another factor that should be considered in these joint optimal resource
allocation problems. The problem solutions in literature have been considered
in below.
The authors in [1] considered a joint power, scheduling time, subcarrier
resource allocation problem for multi cell cooperative OFDM systems. They
claimed that this problem solution was NP hard and their aim was to reduce the
complexity of this problem. So they divide the problem into two stages. In the
fist stage they allocate subcarrier an scheduling time, in the second stage they
perform power control by geometric programming.According to their system
model, the Bs’s can cooperate easily with direct wires, so the actual problem
occurs in downlink. Since the base station transmission powers are much higher
the interference is more likely to occur during these transmissions. ..... situations
in figure 1.

Other Resource allocation problems:

Cognitive Radio:

Figure 4: outage performance of selective OFDMA relaying, with G groups

5
2 Conclusions
I worked hard, and achieved very little.

References
[1] Y. Hou ”Resource Allocation in Multi-cell OFDMA-based Relay Networks”
infocom 2010
[2] B. Gui ”Selective Relaying in OFDM Multihop Cooperative Network”
WCNC 07
[3] B. Gui ”Selective Relaying in Cooperative OFDM Systems: Two-Hop Ran-
dom Network” WCNC 08
[4] A. Bletsas, A. Khisti, D. P. Reed, and A. Lippman, A simple cooperative
diversity method based on network path selection, IEEE JSAC, vol. 24, no.
3, pp. 659-672, Mar. 2006.

[5] Truman Chiu-Yam Ng,”Joint Optimization of Relay Strategies and Resource

allocations in Cooperative Cellular Networks” IEEE Journal on Selected
Areas in Communications, vol. 25, no. 2, Feb 2007
[6] H. Banizaman,”Joint Subchannel-Relay Assignment and Bit Allocation for
Multi-user Cooperative OFDMA Systems based on Fairness”

[7] R. Wang,”Queue-Aware Distributive Power and Relay Selection Control for

Delay-Sensitive Two-Hop OFDM Cooperative Systems”

[8] R. Wang”Delay Optimal Power Control and Relay Selection for Two-Hop
Cooperative OFDM Systems via Distributive Stochastic Learning”

[9] W. Yang, ”Distributed Relay Selection in OFDM-Based Cooperative Wire-

less Networks”