 Research
 Open Access
 Published:
Relay selection in cooperative networks with frequency selective fading
EURASIP Journal on Wireless Communications and Networking volume 2011, Article number: 171 (2011)
Abstract
In this article, we consider the diversitymultiplexing tradeoff (DMT) of relayassisted communication through correlated frequency selective fading channels. Recent results for relays in flat fading channels demonstrate a performance and implementation advantage in using relay selection as opposed to more complicated distributed spacetime coding schemes. Motivated by these results, we explore the use of relay selection for the case when all channels have intersymbol interference. In particular, we focus on the performance of relaying strategies when multiple decodeandforward relays share a single channel orthogonal to the source. We derive the DMT for several relaying strategies: best relay selection, random relay selection, and the case when all decoding relays participate. The best relay selection method selects the relay in the decoding set with the largest sumsquared relaytodestination channel coefficients. This scheme can achieve the optimal DMT of the system under consideration and generally dominates the other two relaying strategies which do not always exploit the spatial diversity offered by the relays. Different from flat fading, we found special cases when the three relaying strategies have the same DMT. We further present a transceiver design which is proven to asymptotically achieve the optimal DMT. Monte Carlo simulations are presented to corroborate the theoretical analysis and to provide a detailed performance comparison of the three relaying strategies in channels encountered in practice.
1 Introduction
Cooperative relay networks have emerged as a powerful technique to combat multipath fading and increase energy efficiency [1, 2]. To exploit spatial diversity in the absence of multiple antennas, several spatially separated singleantenna nodes can cooperate to form a virtual antenna array. Such systems usually employ halfduplex relays and come in two flavors [3–6]: those where the relays transmit on orthogonal channels so that transmission from the source and each relay is received separately at the destination, or those where a single nonorthogonal channel is shared between the source and relays so that all nodes may transmit on the same common channel at the same time. Here, we focus on the former class of systems which employ orthogonal relay channels, where the orthogonality is often accomplished through time division.
Cooperative relay systems with orthogonal channels typically either employ multiple orthogonal relay subchannels in conjunction with repetition coding, or all relays use a single orthogonal relay channel along with distributed spacetime coding (DSTC) [7]. While the use of repetition codes is attractive for its simplicity, this approach requires relay scheduling and dedicated orthogonal channels for each relay which uses up precious system resources. On the other hand, when using a single orthogonal relay channel with DSTC, the scheduling of relays is of no concern, but DSTC requires synchronization between relays which is very difficult in distributed networks. Asynchronous forms of spacetime coding have been proposed (e.g. [8]), but the decoding complexity may still be prohibitively complex to permit their use in lowcost wireless ad hoc networks. Furthermore, the nonlinearity of most existing RF frontends poses additional implementation challenges for DSTCbased approaches [9].
More recently, relay selection schemes have been proposed [10, 11] which use simple repetition coding, very simple scheduling, and a single relay channel. Remarkably, these schemes can achieve the same diversitymultiplexing tradeoff (DMT) [12] as DSTC relaying, and can even outperform DSTC systems in terms of outage probability [11, 13]. Using relay selection is an attractive alternative to avoid the spectral inefficiency of repetition coding and the increased decoding complexity required for DSTC.
Most existing cooperative diversity research assumes that the fading channels have flat frequency responses. In high datarate wireless applications, however, the coherence bandwidth of the channels tends to be smaller than the bandwidth of the signal, resulting in frequency selective fading [14]. For such high rate communication in cooperative relay networks, existing techniques for flat fading channels need to be adapted, or new techniques need to be designed for frequency selective fading channels. In [15], the authors considered a system with a single amplifyandforward (AF) relay over frequency selective channels, and proposed three DSTCs. In [16], the authors consider a multipleAFrelay OFDM system and proposed a distributed spacefrequency code. The three DSTCs in [15] and the distributed spacefrequency code in [16] can achieve both cooperative diversity and frequency diversity where the frequency diversity through a relay is up to the minimum of the sourcerelay channel length and the relaydestination channel length. Simpler, nonDSTC approaches that employ relay selection have been proposed for communication through frequencyselective fading channels. For example, in [17, 18], uncoded OFDM is studied, and it was shown that if relay selection is done on a persubcarrier basis, full spatial diversity can be achieved. However, neither of these OFDMbased relay selection methods were able to exploit the frequency diversity of the ISI channel [19]. A linearly precoded OFDM system was proposed in [20] which uses multiple amplifyforward relays with linear transmit precoding; a simulationbased study showed that two relay selection schemes exhibited a coding gain improvement compared to an orthogonal roundrobbin relaying scheme.
This article investigates the performance limits of relay selection with frequency selective fading, and focuses on the DMT for singlecarrier systems without transmit channel state information (CSI) and transmit precoding. We analyze three different relay selection methods, including best relay selection, random relay selection, and alldecodingrelay participation. The relays in these three methods use a single orthogonal subchannel with repetition coding. We derive the DMT for the relay selection methods and then propose a practical lowcomplexity system which asymptotically attains the DMT by using uncoded QAM with guard intervals between blocks along with linear zeroforcing (ZF) equalizers.
2 System model
2.1 Channel model
We consider a system as in Figure 1, which consists of a single source node (S), K relay nodes (R_{1},_{2},...,_{ K }), and a single destination node (D). We assume that all nodes have the same average power constraint P watts and transmission bandwidth W Hz. While this model has been wellstudied in the case of static flat channels [21], here the links between the nodes are assumed to be frequency selective quasistatic fading channels, modeled as complex FIR filters. In the subscript, we denote s as source node, r_{ i }as i th relay and d as destination. Thus, the sourcetodestination channel coefficients are contained in the vector h_{ sd }. Similarly, for i ∈ 1, 2,..., K, the sourcetorelay R_{ i }channels are contained in {\mathit{h}}_{s{r}_{i}} and the relay R_{ i }to destination channels are contained in {\mathit{h}}_{{r}_{i}d}. Most analyses of diversity through frequency selective channels focus on the case where the channel taps are i.i.d. [22, 23]. Even when multiple paths in the continuous time channel experience independent fading, however, the channel taps themselves can be highly correlated due to pulse shaping [14]. In addition, pulse shaping typically causes the number of discrete time channel taps to be quite a bit larger than the number of (possibly independent) fading paths. To incorporate correlated fadingas well as the effects of path loss, shadowing and imperfect timing synchronizationwe assume that the channel taps arise as h_{ jk }= Γ_{ jk }δ_{ jk }where jk could be sd, sr_{ i }or r_{ i }d, {\mathit{\delta}}_{jk}~\mathcal{C}\mathcal{N}\left(\mathbf{0},{\mathbf{I}}_{{L}_{jk}}\right) represents the L_{ jk }independent fading paths. The autocovariance of the M_{ jk }channel taps can then be specified by appropriate choice of {\Gamma}_{jk}\in {\mathbb{R}}^{{M}_{jk}\times {L}_{jk}} whose maximum singular value and minimum singular value are denoted as ξ_{ jk },_{max} and ξ_{jk,min}, respectively. Without loss of generality, we assume that Γ_{ jk }is full column rank and M_{ jk }≥ L_{ jk }so that the number of coefficients in the effective channel impulse response may be greater than the number of fading paths in the physical channel.
The channel coefficients are assumed to be constant over a block and are independent from one block to the next. We assume perfect CSI at the destination and no CSI at the source. Furthermore, the transmission is presumed to be perfectly synchronized at the block level. In addition, all links have additive noise which is assumed to be mutually independent, zeromean circularly symmetric complex Gaussian with variance N_{0} and the discretetime signaltonoise ratio is defined as
While the assumption of equal node powers and equal noise variances may seem impractical, the case of unequal powers and variances does not change the asymptotic highSNR analysis which follows since these constants disappear in the derivation; consequently, we make this simplifying assumption to aid the clarity of the exposition.
2.2 Diversitymultiplexing tradeoff
The DMT has proven to be a useful theoretical tool that has considerably advanced the design of codes in the MIMO context. By restricting attention to system behavior in the highSNR regime, DMT analysis permits a mathematically tractable comparison of various transmission and relaying schemes.
We define the outage probability as the probability that the mutual information I between source and destination falls below rate R, and this is denoted as Pr[I < R(ρ)]. The multiplexing gain and the diversity gain are then defined as [14]
respectively, where I is the mutual information between the source and the destination, and R(ρ) denotes the source data rate which is assumed to scale as R(ρ) = r log ρ. The notation ≐ denotes asymptotic equality in the large ρ limit with A ≐ B meaning
2.3 Upper bound on the DMT
The MFB assumes that the source only sends a single symbol x[0] and the relay R_{ i }only sends a single symbol {x}_{{r}_{i}}\left[0\right] where E\left[{\leftx\left[0\right]\right}^{2}\right]=E\left[{\left{x}_{{r}_{i}}\left[0\right]\right}^{2}\right]=P\u2215W. For each sourcetorelay link, the received signal at the relay is {\mathit{y}}_{{r}_{i}}={\mathit{h}}_{s{r}_{i}}x\left[0\right]+{\mathit{w}}_{{r}_{i}} where {\mathit{w}}_{{r}_{i}} is the noise at R_{ i }, and for each relaytodestination link, the received signal at the destination can be expressed as {\mathit{y}}_{{r}_{i}d}={\mathit{h}}_{{r}_{i}d}{x}_{{r}_{i}}\left[0\right]+{\mathit{w}}_{{d}_{i}} where {\mathit{w}}_{{d}_{i}} is the noise at the destination D when R_{ i }is transmitting. For the sourcetodestination link, the received signal can be written as {\mathit{y}}_{sd}={\mathit{h}}_{sd}x\left[0\right]+{\mathit{w}}_{{d}_{s}} where {\mathit{w}}_{{d}_{s}} is the noise at the destination D when the source S is transmitting. Thus, the mutual information between source and destination can be written as I_{ sd }= log(1 + h_{ sd }^{2}ρ). Similarly we can find the mutual information between source and i th relay as {I}_{s{r}_{i}}=log\left(1+{\u2225{\mathit{h}}_{s{r}_{i}}\u2225}^{2}\rho \right) and the mutual information between i th relay and destination as {I}_{{r}_{i}d}=log\left(1+{\u2225{\mathit{h}}_{{r}_{i}d}\u2225}^{2}\rho \right). Define set \mathcal{R} consisting of all K relay nodes, and define a partition of \mathcal{R} as \left(\mathcal{V},\mathcal{R}\backslash \mathcal{V}\right). For the network as presented in the channel model with a single source S and a single sink D, a cut \left(\mathcal{S},\mathcal{T}\right) is defined as \mathcal{S}=\left\{\mathbf{S}\right\}\cup \mathcal{V} and \mathcal{T}=\left\{\mathbf{D}\right\}\cup \left(\mathcal{R}\backslash \mathcal{V}\right). The capacity of a minimum cut of such a network can be upper bounded as [24]
The outage probability is lower bounded as
For a particular partition of relay nodes \mathcal{V}, we have the outage probability
where (3) follows from log A + log B = log(AB), (4) follows from the fact that Pr(a + b < c) ≤ Pr(a < c) for any a, b, c ≥ 0, (5) follows from the fact that {\xi}_{jk,min}^{2}{\u2225{\mathit{\delta}}_{jk}\u2225}^{2}\le {\u2225{\mathit{h}}_{jk}\u2225}^{2}\le {\xi}_{jk,max}^{2}{\u2225{\mathit{\delta}}_{jk}\u2225}^{2}, and (6) holds as {\u2225{\mathit{\delta}}_{sd}\u2225}^{2}+{\sum}_{{\mathbf{R}}_{i}\in \left(\mathcal{R}\backslash \mathcal{V}\right)}{\u2225{\mathit{\delta}}_{s{r}_{i}}\u2225}^{2}+{\sum}_{{\mathbf{R}}_{i}\in \mathcal{V}}{\u2225{\mathit{\delta}}_{{r}_{i}d}\u2225}^{2} is chisquare distributed with {L}_{sd}+{\sum}_{{\mathbf{R}}_{i}\in \left(\mathcal{R}\backslash \mathcal{V}\right)}{L}_{s{r}_{i}}+{\sum}_{{\mathbf{R}}_{i}\in \mathcal{V}}{L}_{{r}_{i}d} degrees of freedom.
Substituting (6) into (2), the outage probability is lower bounded as
Thus, the DMT is upper bounded as
as the minimum is attained when relay R_{ i }is in \mathcal{V} if {L}_{{r}_{i}d}<{L}_{s{r}_{i}} and is not in \mathcal{V} otherwise.
For halfduplex orthogonal relays, the multiplexing gain is halved [25] and the upper bound on the DMT for the same channel model but with halfduplex relaying becomes
3 Outage probability analysis of decodeandforward relay system
We now focus on the decodeandforward relay system and derive its outage probability and DMT under several different relaying strategies. We assume the message sent by the source node is encoded to a block of N source symbols. The relays operate in halfduplex mode, and thus do not transmit and receive at the same time. In addition, the relay nodes and the source use the same transmission bandwidth but employ time division so that the relays transmit on a channel orthogonal to the source. The transmission of a complete message is divided into two phases:

1.
In phase one, the source broadcasts the message to the destination and the relays, and each relay attempts to decode the message.

2.
In phase two, the source is silent. Depending on the relay selection strategy, some or all of the relays that successfully decoded the message (if any) forward the message to the destination.
The source and relays then alternate between these two phases; this is shown in Figure 2 for the case where two relays R_{1} and R_{ K }participate in the second phase, and we note that the destination receives the composite signal corrupted by intersymbol interference, interblock interference, and additive noise. Only the relays which can correctly decode the message from the source can participate in forwarding the decoded message to the destination. We define such relays as decoding relays and they form a decoding set. In practice, the decision of whether the message is decoded successfully can be made with the help of a checksum (e.g. CRC) and we assume the relays which pass this checksum do not contain any errors in the decoded message. We consider several relaying strategies in this article, including a best selection scheme, a random selection scheme, and a scheme where all decoding relays participate.
We continue to use the MFB to derive the upper bound on outage probability for the three relaying strategies and assume that a single symbol x[0] is sent by the source.
In the first phase of transmission, the received signals at the destination and at each relay are given by
For classical direct transmission where the source transmits continuously without help from the relays, the mutual information between the source and R_{ i }[14] would be log\left(1+{\u2225{\mathit{h}}_{s{r}_{i}}\u2225}^{2}\rho \right)\mathsf{\text{bits/s/Hz}}. In our system model, however, the use of timedivision constrains the source to be silent half of the time which halves the mutual information but doubles the power, giving the mutual information between source and R_{ i }in the first phase as
Next, in phase two, each relay attempts to decode the message. Those relays which are able to successfully decode the message comprise the decoding set \mathcal{D} where \mathcal{D}\subseteq \left\{{\mathbf{R}}_{\mathsf{\text{1}}},\dots ,{\mathbf{R}}_{K}\right\}. Depending on the relay selection strategy that is employed, some nodes in the decoding set will participate in the relaying.
To calculate the outage probability, we seek the overall mutual information I between the source and the destination. Conditioning on the random set D, the total probability theorem gives the outage probability as
with the summation over all possible decoding sets. To calculate the probability of a given decoding set Pr[\mathcal{D}], first let
where we note that b ≐ ρ^{2r1}and 0 ≤ r ≤ 1/2. The probability that a relay node is in the decoding set is
where the penultimate asymptotic equality follows from {\xi}_{s{r}_{i},min}^{2}\left\right{\mathit{\delta}}_{s{r}_{i}}{}^{2}\le \phantom{\rule{0.3em}{0ex}}\left{\mathit{h}}_{s{r}_{i}}\right{}^{2}\le {\xi}_{s{r}_{i},max}^{2}\left\right{\mathit{\delta}}_{s{r}_{i}}{}^{2} and the last asymptotic equality follows as \left\right{\mathit{\delta}}_{s{r}_{i}}{}^{2} is chisquare distributed with {L}_{s{r}_{i}} degrees of freedom. Since each relay independently decodes the message, and since the channels from source to each relay are independent, the probability of the decoding set is
Referring back to (12), we now need to calculate Pr\left[I<R\mathcal{D}\right], which depends on the particular choice of relay selection strategy. Next, we complete the outage probability and DMT derivation for each of the three selection strategies.
3.1 Best relay selection DMT
We first analyze the outage of the best relay selection scheme, where the "best" relay is defined as the one with the largest sumsquared relaytodestination channel coefficients. The chosen relay uses repetition coding, and simply forwards the decoded signal to the destination in phase two. The best relay selection process can be completed either centrally at the destination or in a distributed fashion by relays, as follows:

Centralized selection: In turn, each decoding relay transmits some known information to the destination, and the destination estimates each relaytodestination channel. The destination chooses the relay with the largest sumsquared relaytodestination channel coefficients, and feeds back this decision to the relays. The feedback requires \left\mathcal{D}\right bits and is assumed to be fed back reliably.

Distributed selection: The relaytodestination channel and the destinationtorelay channel are assumed to be the same due to reciprocity. The destination broadcasts some known information to all the relays, each of which individually estimate its relaytodestination channel. Each relay waits for a time duration which is inversely proportional to its sumsquared relaydestination channel coefficients before sending its signal to the destination, so the relay with the largest sumsquared relaytodestination channel will be the first to send its signal to the destination. Other relays do not start transmission if they overhear any signal from the best relay. The detailed process for this distributed relay selection is discussed in [10].
The system designer may choose which of these two approaches to adopt depending on the application. The centralized selection might consume more time since the channels between relays and destination would need to be estimated sequentially. Centralized selection also puts more estimation load on the destination. Distributed selection, on the other hand, is more spectrally efficiently since relays concurrently estimate the channels; however, the relays need to resolve collisions which may complicate the implementation. The practical details of the selection process itselfsuch as the overhead in performing the selection, as well as the possibility of poor channel estimates that result in a suboptimal relay selectionare beyond the scope of the present study. Throughout our analysis, we assume that the best relay is always selected with negligible overhead.
Again, transmission takes place in two alternating phases, where the received signals in the first phase are given by (10) and (11). Here, however, only the selected relay participates in the second phase. Let the selected relay index be m and denote its relaydestination channel coefficients as {\mathit{h}}_{{r}_{m}d} so that
The received signal at the destination becomes
Due to the use of repetition coding by the selected relay and the orthogonality of the sourcedestination and sourcerelay channels, the conditional mutual information of the best relay selection scheme can be written as
Denote {\xi}_{max}=max\left({{max}_{\mathbf{R}}}_{{}_{i}\in \mathcal{D}}{{\xi}_{{r}_{i}d}}_{,max,}{\xi}_{sd,max}\right),{\xi}_{min}=min\left({{min}_{\mathbf{R}}}_{{}_{i}\in \mathcal{D}}{\xi}_{{r}_{i}d,min,}{\xi}_{sd,min}\right), we have the following upper bound and lower bound on I_{best} as
Let Y ≜  δ_{ sd }^{2} and f_{ Y }(y) be the pdf of Y which is chisquare distributed with L_{ sd }degrees of freedom. The conditional outage probability for best relay selection is then
where (18) follows by applying (16), (19) follows from [26, equation 2.321], (20) follows from the change of variable y = αb with 0 ≤ α ≤ 1, (21) comes by dropping terms in the polynomial of b with order higher than {L}_{{r}_{i}d}, and (22) follows from the fact that the integration in (21) is not a function of b.
Substituting (13) and (22) into (12), the outage of best relay selection is then
where (24) follows as the minimum in (23) is attained when relay R_{ i }is in decoding set if {L}_{{r}_{i}d}<{L}_{s{r}_{i}} and is not in decoding set otherwise. We see that full spatial diversity is achieved by this relay selection method since there are K + 1 terms in (24), but the achieved frequency diversity through each relay is the minimum of the length of the sourcetorelay and relaytodestination channels.
3.2 Random relay selection DMT
In this subsection, we analyze the outage of a random relay selection scheme, where a random relay in the decoding set handles the forwarding. While this strategy would appear to be suboptimal compared to the best relay selection scheme, random selection is attractive for its simplicity and the fact that it requires no feedback nor CSI. In random selection, the probability of a decoding relay being selected as the forwarding relay is 1\u2215\left\mathcal{D}\right. The chosen relay employs repetition coding for the second phase of transmission. Similar to Section 3.1, this relay selection method can also be operated in a centralized mode or a distributed mode. Under centralized mode, there is no need to estimate the relaytodestination channel, and the destination broadcasts the index number of a randomly selected relay in the decoding set; in distributed mode, each decoding relay waits for a random time which is uniformly distributed within a range with the maximum predefined by the system, and the first to transmit becomes the chosen relay. The mutual information conditioned on selecting relay {\mathbf{R}}_{i}\in \mathcal{D} can be written as
We have
Let Y ≜  δ_{ sd }^{2} and f_{ Y }(y) be the pdf of Y which is chisquare distributed with L_{ sd }degrees of freedom. The conditional outage probability for the random relay selection method is
where (27) follows from the same steps used in going from (17) to (22), but with only one relay in the decoding set. From (28), we see that within the decoding set, random relaying offers no spatial diversity but only frequency diversity, where the diversity order equals the shortest channel length. Substituting (13) and (28) into (12), the outage of the random relay selection is
where the last line follows from the fact that \underset{{R}_{i}\in \mathcal{D}}{min}{L}_{{r}_{i}d}\ge \underset{i\in 1,\dots ,K}{min}{L}_{{r}_{i}d} for any decoding set \mathcal{D}. A detailed explanation for the last step in the above derivation follows. Denote
Let {\mathcal{D}}_{n} be a set with n decoding relays so that \left{\mathcal{D}}_{n}\right=n. Then, Z\left({\mathcal{D}}_{K}\right)=\underset{i\in 1,\dots ,K}{min}{L}_{{r}_{i}d} when all the relays are in the decoding set and Z\left({\mathcal{D}}_{0}\right)={\sum}_{i\in 1,\dots ,K}{L}_{s{r}_{i}} when no relay is in the decoding set. For 1 ≤ n < K,
Thus, the minimum of Z\left(\mathcal{D}\right) over all possible decoding sets happens either when \left\mathcal{D}\right=K or \left\mathcal{D}\right=0. We can write
Comparing (29) with (23), we find that the DMT offered by the random selection method is dominated by the best relay selection method. The random selection method cannot always fully exploit the spatial diversity due to the presence of the min in (29) which results in a diversity bottleneck, though we will consider some cases in Section 3.4 where random selection can exploit full spatial diversity.
3.3 Alldecodingrelay DMT
Next, we analyze the outage of a scheme where all relays in the decoding set participate. Since all decoding relays participate in the forwarding, no overhead, no feedback, and no CSI is needed to perform selection. We assume perfect symbol synchronization now and will comment on this later.
As the decoding relays participate in the second phase of transmission and employ repetition coding, the effective channel from the relays to the destination becomes
For a fair comparison, we assume each relay transmits at the power of 2P\u2215\left\mathcal{D}\right where 2 is due to halfduplex relaying. We can write the conditional mutual information between the source and the destination through the decoding set as
We denote {\xi}_{max}=max\left\{{max}_{{\mathbf{R}}_{i}\in \mathcal{D}}\phantom{\rule{2.77695pt}{0ex}}{\xi}_{{r}_{i}d,max,}\phantom{\rule{2.77695pt}{0ex}}{\xi}_{sd,max}\right\},\phantom{\rule{2.77695pt}{0ex}}{\xi}_{min}=min\left\{{min}_{{\mathbf{R}}_{i}\in \mathcal{D}}\phantom{\rule{0.3em}{0ex}}{\xi}_{{r}_{i}d,max,}\phantom{\rule{2.77695pt}{0ex}}{\xi}_{sd,max}\right\}, and we can bound I_{all} as
where {\mathit{\delta}}_{rd}={\sum}_{{\mathbf{R}}_{i}\in \mathcal{D}}{\mathit{\delta}}_{{r}_{i}d} with length {L}_{rd}\triangleq \underset{{\mathbf{R}}_{i}\in \mathcal{D}}{max}\phantom{\rule{2.77695pt}{0ex}}{L}_{{r}_{i}d}. Denote the covariance matrix of δ_{ rd }as C\in {\mathbb{R}}^{{L}_{rd}\times {L}_{rd}}. We note that C is a diagonal matrix with the largest element \left\mathcal{D}\right and the smallest element greater than or equal to 1. Define
Each element of {\overline{\mathit{\delta}}}_{rd} is then Gaussian distributed with variance 1,{\u2225{\stackrel{\u0304}{\mathit{\delta}}}_{rd}\u2225}^{2} is chisquare distributed with L_{ rd }degrees of freedom, and
Let Y ≜ δ_{ sd }^{2} and f_{ Y }(y) be the pdf of Y which is chisquare distributed with L_{ sd }degrees of freedom. We develop the conditional outage probability for the alldecodingrelay method as
where (34) follows by applying (32), (35) follows by applying (33), and (36) follows as {\u2225{\stackrel{\u0304}{\mathit{\delta}}}_{rd}\u2225}^{2}+Y is chisquare distributed with L_{ sd }+ L_{ rd }degrees of freedom. From (36), we see that within the decoding set, dividing power among transmit antennas without phase alignment does not offer spatial diversity and only offers frequency diversity where the diversity order equals the longest delay length.
Substituting (13) and (36) into (12), the outage probability of the alldecodingrelay method is
While we assume perfect symbol synchronization, we note that imperfect symbol synchronization has the effect of artificially increasing the channel lengths by adding zeros (or delays) to the front of the impulse responses. The use of intentional asynchronization to induce delay diversity was studied in [27] for the case of flat fading channels. A similar approach could be used in ISI channels; by artificially adding zeros to the front of each component relaytodestination channel, the effective sum channel from all relays to the destination can be made to have {L}_{rd}={\sum}_{{\mathbf{R}}_{i}\in \mathcal{D}}{L}_{{r}_{i}d} independent paths so that the alldecodingrelay scheme can attain performance equal to the best relay selection if the symbollevel asynchronization is chosen appropriately.
3.4 Summary
Collecting the expressions in (24), (29), and (37), we arrive at the DMT expressions for each scheme shown in Table 1. By comparing the original outage expressions, it is apparent that
Comparing each of these expressions with the DMT upper bound in (9), we see that the best relay selection method is the only one which can always achieve the DMT bound. Table 1 also includes the special case when all sourcetorelay channels have identical length L_{ sr }, and all relaytodestination channels have identical length L_{ rd }. We note that our theoretical diversity expressions agree with results reported in elsewhere in the literature. For example, in the special case of flatfading, our results coincide with those of [10, 11] which showed that the best relay selection protocol can achieve diversity equal to K + 1. Another example is that in [15], with a single relay K = 1, a system employing STBC can achieve diversity equal to the expression we found for all the three relaying schemes. Additionally, the diversity achieved when using multiple orthogonal relay subchannels in an OFDM system with precoding [20] is identical to the one achieved here by the best relay selection scheme.
It is interesting to note that even random relay selection can achieve the same diversity as best relay selection in some cases. For example, looking at the last column of Table 1, we see that all schemes have an equivalent DMT when L_{ rd }> KL_{ sr }. This situation could arise when there is significant scattering and dispersion in the relaytodestination channel (due to a high density of large buildings, for example) when compared with the sourcetorelay channel (which may have a lower density of reflecting structures and terrain). Thus, when the relaytodestination channel is sufficiently rich, the lower overhead of random relay selection is attractive. This is different from the situation in flat fading channels, since with L_{ sr }= L_{ rd }= 1, best relay selection is the only scheme which can exploit spatial diversity.
The outage probability and DMT bounds derived here are based on the MFB. As the MFB effectively ignores the intersymbol interference, these results provide an optimistic bound on the attainable outage probability and DMT. We now consider a transceiver design for attaining the bound for best relay selection.
4 OptimalDMTachieving transceiver
In the previous section, we proved that best relay selection can achieve the optimal DMT, the DMT upper bound derived in Section 2. We now propose a specific transmission and reception scheme for best relay selection and we will prove that it can asymptotically achieve the optimal DMT.
4.1 Transceiver description
In the proposed scheme, the source sends N QAMsymbols, denoted as x, which are drawn from a constellation of Q = ρ^{2r'}points where [28, Equation (2)]
and
After transmission of N symbols, a guard interval of length M_{max} 1 zeros follows. The choice of Q or r' here is to make sure the total transmission rate is still R = r log ρ with the guard interval. M_{max} is essentially an upper bound on the length of all channels in the system. In practice, it is unrealistic for the source node to have knowledge of the lengths of all channels in the system. The system designer needs only choose the parameter M_{max} to be greater than or equal to the largest channel length expected in the transmission environment. The insertion of guard time eliminates the possibility of interblock interference, but intersymbol interference is still present. Due to the insertion of guard time between alternating phases of source/relay transmission, we see from (38) that the system incurs a rate penalty that can be made arbitrarily small by increasing the block length N.
We assume channel state information at the receiver (CSIR) is perfect, but that no channel state information at the transmitter (CSIT) is needed. We also assume perfect frame synchronization though in practice the system can accommodate modest symbollevel synchronization errors since they can be lumped into the FIR channel model. Each relay and the destination uses a ZF equalizer prior to detection to compensate for the intersymbol interference.
In the first phase, the received signal at each relay is
where the {\mathit{H}}_{s{r}_{i}}\in {\u2102}^{\left({M}_{max}+N1\right)\times N} are the Tœplitz channel convolution matrices corresponding to {\mathit{h}}_{s{r}_{i}}, i.e. {\left[{\mathit{H}}_{s{r}_{i}}\right]}_{j,k}={h}_{s{r}_{i}}\left[jk\right]. Since \u2225{\mathit{h}}_{s{r}_{i}}\u2225\ne 0 with probability 1, and the minimum eigenvalue of {\mathit{H}}_{s{r}_{i}}^{H}{\mathit{H}}_{s{r}_{i}} is greater than zero due to [28, Lemma IV.1], {\mathit{H}}_{s{r}_{i}}^{H}{\mathit{H}}_{s{r}_{i}} is invertible and the ZF equalizer coefficients used at the ith relay are
The filtered estimate of x at each relay is
A given relay is declared to have successfully decoded the message only when each symbol in the block is decoded correctly. The best relay selection scheme described in the previous section is employed, which selects the relay in the decoding set with the largest sumsquared relaytodestination channel. After the completion of relay selection, in the second phase, the selected relay forwards the length N decoded message to the destination and another guard interval of length M_{max}  1 follows the relayed signal. This process continues and the source sends another block of N symbols. Let the selected relay index be m and denote its relaydestination channel coefficients as {\mathit{h}}_{{r}_{m}d} so that
Let {\mathit{H}}_{sd}\in {\u2102}^{\left({M}_{max}+N1\right)\times N},\phantom{\rule{2.77695pt}{0ex}}{\mathit{H}}_{{r}_{m}d}\in {\u2102}^{\left({M}_{max}+N1\right)\times N} be the Tœplitz channel convolution matrices corresponding to h_{ sd }and {\mathit{h}}_{{r}_{m}d}, respectively. Define
Then, the received signal to be equalized at the destination is then given by
We note that this model includes the guard intervals inserted between the two transmission phases as can be seen by the dimensions of {\mathit{H}}_{s{r}_{i}}, H_{ sd }, and {\mathit{H}}_{{r}_{m}d}. We note
Denote the minimum eigenvalue of {\mathit{H}}_{{r}_{m}d}^{H}{\mathit{H}}_{{r}_{m}d} as {\lambda}_{{r}_{m}d,min}, the minimum eigenvalue of {\mathit{H}}_{sd}^{H}{\mathit{H}}_{sd} as λ_{sd,min}, and the minimum eigenvalue of {\mathit{H}}_{\mathsf{\text{eff}}}^{H}{\mathit{H}}_{\mathsf{\text{eff}}} as λ_{eff,min}. From (41) and the fact that these three matrices are Hermitian, Weyl's Inequality [29, Theorem 4.3.1] gives
Since λ_{sd,min}> 0 and {\lambda}_{{r}_{m}d,min}>0 again due to [28, Lemma IV.1], we have λ_{eff,min} > 0 and thus {\mathit{H}}_{\mathsf{\text{eff}}}^{H}{\mathit{H}}_{\mathsf{\text{eff}}} is invertible. The destination processes the received signal with a ZF equalizer
The filtered estimate of x at the destination is then
The filtered noise z={\left({\mathit{H}}_{\mathsf{\text{eff}}}^{H}{\mathit{H}}_{\mathsf{\text{eff}}}\right)}^{1}{\mathit{H}}_{\mathsf{\text{eff}}}^{H}{\mathit{w}}_{\mathsf{\text{eff}}} has total variance
4.2 Outage analysis
We first analyze the probability of decoding set of this scheme. Define the error probability at the i th relay after ZF equalization as P_{e,i}and denote the minimum eigenvalue of {\mathit{H}}_{s{r}_{i}}^{H}{\mathit{H}}_{s{r}_{i}} as {\lambda}_{s{r}_{i},min}. Following the steps in Theorem III.6 of [28], we have
where {\xi}_{s{r}_{i},min} is the smallest singular value of {\Gamma}_{s{r}_{i}}, and
Following the steps in Theorem VII.7 of [28], we have
where {\xi}_{s{r}_{i},max} is the largest singular value of {\Gamma}_{s{r}_{i}}. Thus, we can conclude
As a relay is in the decoding set only when all N symbols are decoded correctly
Thus, the probability of the decoding set is
where asymptotic equality in (45) follows from the binomial theorem. We next analyze the error probability at the destination conditioned on the decoding set. Denote λ_{eff,k}as the k th eigenvalue for {\mathit{H}}_{\mathsf{\text{eff}}}^{H}{\mathit{H}}_{\mathsf{\text{eff}}} with k ∈ {0,1,..., N  1}. Assume we estimate each symbol in the block separately then the effective ρ for decoding the k th symbol is
where \stackrel{\u0304}{\lambda}=min\left({\stackrel{\u0304}{\lambda}}_{sd},{\stackrel{\u0304}{\lambda}}_{{r}_{m}d}\right) with
and
Using a proof identical to [28, Lemma IV.1], it can be shown that {\stackrel{\u0304}{\lambda}}_{sd}>0 and {\stackrel{\u0304}{\lambda}}_{{r}_{m}d}>0, therefore \stackrel{\u0304}{\lambda}>0.
The error probability at the destination conditioned on \mathcal{D} [28, Lemma VII.6] is
where (46) follows by applying (16), and the last step comes from steps identical to (17)(22). Combining (45) and (47) by the total probability theorem, we conclude that the proposed transmission scheme and equalization method have the following upper bound on the error probability:
Combining [28, Lemma III.1] and the result in (24), we also have
Thus, we can conclude that
which shows that the proposed scheme can asymptotically achieve the DMT for best relay selection.
We also point out that since minimum mean squarederror (MMSE) and decision feedback equalizer (DFE) performance dominates ZF equalizers [30], MMSE equalizers and DFEs should attain the same DMT curve. In practice, a system designer may prefer a MMSE or DFE equalizer for their improved BER performance.
5 Numerical results
This section presents numerical examples of the performance of the proposed relay selection methods developed in Sections 3 and 4. In evaluating performance over finite SNRs, the diversity measured as the negative slope of each outage curve often does not coincide exactly with the predicted maximal diversity [31, 32]; the predicted diversity assumes that the SNR grows arbitrarily large to permit the analysis to be mathematically tractable. We now compare the performance of the three selection schemes in a variety of scenarios at finite SNR, and show that the schemes follow the general trends predicted by the DMT results.
To illustrate the attainable frequency and spatial diversity, we consider 10 scenarios shown in Table 2 where the maximum diversity order is computed from (24), (30), and (37). The first five scenarioswhich use a single relay and therefore are unaffected by the choice of selection strategyare included to illustrate the relative improvement in spatial diversity by adding additional relays.
The outage probability for the best relay selection, random relay selection, and alldecodingrelay methods are plotted in Figures 3, 4, and 5, respectively, where the rate R = 2 bits/s/Hz and each Γ_{ jk }is a square identity matrix, i.e. each fading tap of h_{ jk }is i.i.d. Rayleigh fading with variance 1. For the best relay selection performance shown in Figure 3, the outage curves for Scenarios 1 through 3 have roughly the same slope which agrees with the trend predicted by Table 2. Scenario 4 has a higher diversity order since the minimum length of the sourcetorelay and relaytodestination channels increases, and Scenario 5 has an increased diversity order due to the increased length of the sourcetodestination channel. Similar behavior is observed for Scenarios 6 through 10, which have correspondingly larger diversity orders than Scenarios 1 through 5 because of the spatial diversity offered by the additional relay. We also notice that increasing the frequency diversity in the sourcetorelay channel results in a more pronounced coding gain than increasing the frequency diversity in the relaytodestination channel, as Scenario 3 has a larger coding gain than Scenario 2 in Figure 3. As shown by Figures 4 and 5, the random relay selection and alldecodingrelay methods have nearly the same outage performance as each other for the considered scenarios; this is another trend predicted by the maximum diversity order in Table 2. Furthermore, both of these schemes have outage performance dominated by the best relay selection method as expected.
We further verify the performance of the transceiver design with different relaying strategies. In the simulation, we use a block length N = 32 and Graymapped QPSK modulation. In Figures 6 and 7, we consider a frequency selective channel with uniform power delay profile, i.e. each tap of each channel is i.i.d. fading with variance 1/L where L is the channel length. On both figures, we have also included the performance of the optimal maximum likelihood sequence estimator (MLSE) equalizer for comparison. As we can see from Figure 6, with only two relays present in the system, the performance advantage of best relay selection over the other two relaying strategies is negligible. This suggests that in systems with a relatively small number of relays, selection strategies that do not require feedback or CSI (such as the random relay selection and alldecodingrelay methods) may be preferred for their simplicity.
When as many as K = 10 relays are available, as shown in Figure 7, the diversity order of the best relay selection may be significantly larger than the other two methods. In examining the power gain of best relay selection over the other two relaying strategies, we note an interesting trend. When the fading channels contain L = 2 taps, the power gain of the best relay selection is about 6 dB at a bit error rate of 10^{6}. When L increases to 4, however, the power gain of best relay selection is only about 2dB. Thus, when there is already sufficient frequency diversity in the system, the improvement in using sophisticated selection schemes which better exploit the spatial diversity is not as pronounced. Again, a system designer may favor one of the simpler selection schemes if it is known that the transmission environment has sufficient frequency diversity.
We next compare the BER performance of different relaying strategies under i.i.d. and correlated fading. The i.i.d. fading channel used for comparison has uniform power delay profile, and its performance is shown in Figures 6 and 7 with L = 4, and is referred to as "no correlation" in Figure 8. To introduce the correlation in the channel taps, we model each channel in the system as a GSM typical rural channel [33] which has L = 4 underlying independent fading coefficients where each of the four path arrivals have power delay profile given by [0, 2, 10, 20]dB and corresponding path arrival times τ^{T}= [0,0.2,0.4,0.6] μ s. We employ a square root raised cosine pulse shape p(t) at the transmitting end with rolloff factor 0.4 which is truncated to a length of 8 symbol periods. The symbol period is taken to be T = 0.278 μs which, with QPSK transmission, corresponds to a data rate of 7.2 Mbps. Together, these parameters determine the tap autocovariance Γ_{ jk }for each discrete baseband channel since each sampled channel h arises as
where the underlying independent fading coefficients α∈ ℂ^{4} are complex Gaussian with variance given by the GSM typical rural power delay profile. For fair comparison, we normalize the total average power in the underlying independent fading coefficients to 1. The resulting sampled channel with four independent path arrivals gives rise to a correlated discrete channel with 19 taps. As shown in Figure 8, the simulated performance demonstrates that at finite SNR the receiver is not able to exploit the diversity offered by all four independent paths since the last path which has a power of 20 dB contributes very little to the received signal, an effect masked by the highSNR analysis of the DMT. Nevertheless, the choice of relay selection method still has significant impact on system performance when the number of relays K is relatively large.
6 Conclusion
In this article, we have considered the relay selection problem for the orthogonal decodeandforward system where correlated frequency selective fading is present. We analyzed the outage performance and derived the DMT for three relay methods: best relay selection, random relay selection, and the alldecodingrelay method. Our analysis shows that best relay selection performance dominates the other two schemes with respect to outage. We further proposed a transceiver to realize the DMT offered by best relay selection with minimal complexity; the proposed scheme uses uncoded QAM transmission with guard times and uses ZF equalization at each node. The analysis and simulation results show that the proposed scheme asymptotically achieves the DMT.
While the diversity offered by relay systems in flat fading channels is fairly well understood, the deployment of relay systems in ISI channels requires consideration of a variety of new issues in order to best exploit the available diversity. For example, we presented cases where random relay selection and the alldecodingrelay method can achieve the same diversity as best relay selection, which runs counter to the situation in flat fading channels where best relay selection is always superior. We also found that only when the number of relays in the system is relatively large, the best relay selection offers a significant performance advantage over the other relaying strategies, though this tends to diminish with increased frequency diversity in the system. As the overhead of random relay selection is lower than that of the best relay selection, system designers may favor random relaying depending on the application and transmission environment.
The analytical study presented here focuses on the highSNR regime and is an important step toward understanding the diversity offered by relay systems in frequency selective fading channels. The relaying strategies presented in this article do not require sophisticated spacetime coding, they have relaxed synchronization requirements, and are spectrally efficient; these advantages make the relay selection methods ready for implementation in today's distributed networks. Future study may consider the use of alternate forwarding protocols (such as amplifyandforward or equalizeandforward) as well as the overhead tradeoff of the various relay selection methods.
References
Sendonaris A, Erkip E, Aazhang B: User cooperation diversitypart I: system description. IEEE Trans Commun 2003, 51(11):19271938. 10.1109/TCOMM.2003.818096
Sendonaris A, Erkip E, Aazhang B: User cooperation diversitypart II. Implementation aspects and performance analysis. IEEE Trans Commun 2003, 51(11):19391948. 10.1109/TCOMM.2003.819238
Nabar R, Bolcskei H, Kneubuhler F: Fading relay channels: performance limits and spacetime signal design. IEEE J Sel Areas Commun 2004, 22(6):10991109. 10.1109/JSAC.2004.830922
Laneman J, Tse D, Wornell G: Cooperative diversity in wireless networks: efficient protocols and outage behavior. IEEE Trans Inf Theory 2004, 50(12):30623080. 10.1109/TIT.2004.838089
HostMadsen A, Zhang J: Capacity bounds and power allocation for wireless relay channels. IEEE Trans Inf Theory 2005, 51(6):20202040. 10.1109/TIT.2005.847703
Azarian K, El Gamal H, Schniter P: On the achievable diversitymultiplexing tradeoff in halfduplex cooperative channels. IEEE Trans Inf Theory 2005, 51(12):41524172. 10.1109/TIT.2005.858920
Laneman J, Wornell G: Distributed spacetimecoded protocols for exploiting cooperative diversity in wireless networks. IEEE Trans Inf Theory 2003, 49(10):24152425. 10.1109/TIT.2003.817829
Shang Y, Xia XG: Shiftfullrank matrices and applications in spacetime trellis codes for relay networks with asynchronous cooperative diversity. IEEE Trans Inf Theory 2006, 52(7):31533167.
Bletsas A, Khisti A, M Win: Opportunistic cooperative diversity with feedback and cheap radios. IEEE Trans Wireless Commun 2008, 7(5):18231827.
Bletsas A, Khisti A, Reed D, Lippman A: A simple cooperative diversity method based on network path selection. IEEE J Sel Areas Commun 2006, 24(3):659672.
Beres E, Adve R: On selection cooperation in distributed networks, in 40th Annual Conference on Information Sciences and Systems. 2006, 10561061.
Zheng L, Tse D: Diversity and multiplexing: a fundamental tradeoff in multipleantenna channels. IEEE Trans Inf Theory 2003, 49(5):10731096. 10.1109/TIT.2003.810646
Bletsas A, Shin H, Win M: Cooperative communications with outageoptimal opportunistic relaying. IEEE Trans Wireless Commun 2007, 6(9):34503460.
Tse D, Viswanath P: Fundamentals of Wireless Communication. Cambridge University Press, Cambridge; 2005.
Mheidat H, Uysal M, AlDhahir N: Equalization techniques for distributed spacetime block codes with amplifyandforward relaying. IEEE Trans Signal Process 2007, 55(5):18391852.
Zhang W, Li Y, Xia XG, Ching P, Ben Letaief K: Distributed spacefrequency coding for cooperative diversity in broadband wireless ad hoc networks. IEEE Trans Wireless Commun 2008, 7(3):9951003.
Gui B, Cimini L, Dai L: OFDM for cooperative networking with limited channel state information. Military Communications Conference (MILCOM'06) 2006, 16.
Dai L, Gui B, Cimini L: Selective relaying in OFDM multihop cooperative networks. Wireless Communications and Networking Conference 2007, 963968.
Wang Z, Giannakis G: Complexfield coding for OFDM over fading wireless channels. IEEE Trans Inf Theory 2003, 49(3):707720. 10.1109/TIT.2002.808101
Ding Y, Uysal M: Amplifyandforward cooperative OFDM with multiplerelays: performance analysis and relay selection methods. IEEE Trans Wireless Commun 2009, 8(10):49634968.
Gastpar M, Vetterli M: On the capacity of large Gaussian relay networks. IEEE Trans Inf Theory 2005, 51(3):765779. 10.1109/TIT.2004.842566
Medles A, Slock D: Optimal diversity vs multiplexing tradeoff for frequency selective MIMO channels. International Symposium on Information Theory (ISIT'05) 2005, 18131817.
Zhou S, Giannakis G: Spacetime coding with maximum diversity gains over frequencyselective fading channels. IEEE Signal Process Lett 2001, 8(10):269272. 10.1109/97.957268
Cormen T, Leiserson CE, Rivest DL, Stein C: Introduction to Algorithms. The MIT press, Cambridge; 2001.
Yang S, Belfiore J: Diversity of MIMO multihop relay channels.[http://arxiv.org/PS_cache/arxiv/pdf/0708/0708.0386v1.pdf]
Gradshteyn I, Ryzhik I, Jeffrey A, Zwillinger D: Table of Integrals Series and Products. Academic Press, New York; 2007.
Wei S, Goeckel D, Valenti M: Asynchronous cooperative diversity. IEEE Trans Wireless Commun 2006, 5(6):15471557.
Grokop L, Tse D: Diversitymultiplexing tradeoff in ISI channels. IEEE Trans Inf Theory 2009, 55(1):109135.
Horn R, Johnson C: Matrix Analysis. Cambridge University Press, Cambridge; 1990.
Barry JR, Lee E, Messerschmitt D: Digital Communication. Springer, Netherlands; 2004.
Narasimhan R: FiniteSNR diversitymultiplexing tradeoff for correlated Rayleigh and Rician MIMO channels. IEEE Trans Inf Theory 2006, 52(9):39653979.
Azarian K, El Gamal H: The throughputreliability tradeoff in blockfading MIMO channels. IEEE Trans Inf Theory 2007, 53(2):488501.
3GPP2011. [http://www.3gpp.org/ftp/Specs/htmlinfo/45005.htm]
Author information
Authors and Affiliations
Corresponding author
Additional information
Competing interests
The authors declare that they have no competing interests.
Authors’ original submitted files for images
Below are the links to the authors’ original submitted files for images.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
About this article
Cite this article
Deng, Q., Klein, A.G. Relay selection in cooperative networks with frequency selective fading. J Wireless Com Network 2011, 171 (2011). https://doi.org/10.1186/168714992011171
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/168714992011171
Keywords
 cooperative communication
 relay selection
 opportunistic relaying
 diversitymultiplexing tradeoff
 outage probability
 frequency selective fading
 intersymbol interference