Journal of Computer Networks and Communications

VolumeÂ 2011Â (2011), Article IDÂ 560528, 14 pages

http://dx.doi.org/10.1155/2011/560528

## A Comparative Study of Relaying Schemes with Decode and Forward over Nakagami- Fading Channels

^{1}Broadband Wireless and Sensor Networks Laboratory, Athens Information Technology, 19.5 km Markopoulo Avenue, Peania, 19002 Athens, Greece^{2}Department of Signals and Systems, Chalmers University of Technology, 412 96 Gothenburg, Sweden^{3}School of Electronic and Electrical Engineering, University of Leeds, Leeds LS2 9JT, UK

Received 30 March 2011; Revised 28 June 2011; Accepted 4 August 2011

Academic Editor: W.Â Hamouda

Copyright Â© 2011 George C. Alexandropoulos et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

Although relaying can be very beneficial for wireless systems, understanding which relaying schemes can achieve specific performance objectives under realistic fading is crucial. In this paper we present a general framework for modeling and evaluating the performance of dual-hop decode-and-forward (DF) relaying schemes over independent and not necessarily identically distributed (INID) Nakagami- fading channels. We obtain closed-form expressions for the statistics of the instantaneous output signal-to-noise ratio of repetitive transmission with selection diversity. Furthermore, we present a unified statistical overview of other three significant relaying schemes with DF, one based on repetitive transmission with maximal-ratio diversity and the other two based on relay selection (RS). To compare the considered schemes, we present closed-form and analytical expressions for the outage probability and the average symbol error probability under various modulation methods, respectively. Importantly, it is shown that when the channel state information for RS is perfect, RS-based schemes always outperform repetitive ones. Furthermore, when the direct link between the source and the destination nodes is sufficiently strong, relaying may not result in any gains, and it should be switched off.

#### 1. Introduction

The significance of multiple-input multiple-output (MIMO) techniques for modern wireless systems has been well appreciated. Multiple collocated antennas can improve transmission reliability and the achievable capacity through diversity, spatial multiplexing, and/or interference suppression [1, 2]. However, the cost of mobile devices is proportional to their number of antennas, and this creates a serious practical limitation for the use of MIMO [3]. Cooperative diversity is a promising new avenue which allows cooperation amongst a number of wireless nodes which effectively profit from MIMO techniques without requiring multiple collocated antennas [4â€“6].

Dual-hop cooperative diversity entails that the transmission of the source node towards a destination node is assisted by one or more relay nodes which can be seen to form a conceptual MIMO array [4]. Relay nodes can either be fixed, being part of the system infrastructure, or mobile, that is, mobile nodes that relay signals intended for other mobile nodes [7, 8]. Cooperative diversity can improve the transmission reliability and the achievable capacity, and it can extend coverage. Essentially, it can achieve diversity gains and has the additional advantage over conventional MIMO that the remote cooperating antennas experience very low or inexisting correlation [4, 9â€“11]. The performance of a system exploiting cooperative diversity depends on the employed relaying protocol and scheme, that is, the way of utilizing relay nodes [4, 9â€“19]. Consequently, it is crucial to gain insights on which relay scheme is most suitable for achieving a particular objective; some common objectives are the minimization of the outage probability (OP) or the average symbol error probability (ASEP) [20, 21].

In the present work, we consider the decode-and-forward (DF) relaying protocol assuming that the message transmitted by the source is decoded and retransmitted to the destination by one or more relays in a dual-hop fashion. We take into account four relaying schemes, two based on repetitive transmission and the other two based on relay selection (RS). According to repetitive transmission, all relays that decode the transmitted symbol by the source retransmit it repetitively to the destination node which employs diversity techniques to combine the different received signal copies [22, 23]. One version of RS entails that, amongst the relays that have decoded the sourceâ€™s symbol, only the node with the strongest relay-to-destination channel is selected to retransmit it to the destination [9, 24]. Another version of RS utilizes the best relay only when it achieves greater capacity than the direct source-to-destination transmission [10, 21]. In the literature the performance of such schemes has been analyzed over independent and identically distributed (IID) Rayleigh fading channels [9, 22, 24]. Recently, the Nakagami- fading model has received a lot of attention as it can describe more accurately the fading process and helps in understanding the gains of cooperative diversity [20, 21, 25â€“31]. In [26], closed-form expressions for the OP of repetitive transmission with maximal-ratio diversity (MRD) have been derived under independent and not necessarily identically distributed (INID) Nakagami- fading, whereas for the same fading conditions the OP and ASEP of the aforementioned RS-based schemes have been analyzed in [21]. However, there has not been a complete study that addresses the question of which relaying scheme is preferable and under which channel conditions.

In this paper, we present a general analytical framework for modeling and evaluating performance of relaying schemes with DF under INID Nakagami- fading channels. More specifically, we obtain closed-form expressions for the OP and ASEP of repetitive transmission when selection diversity (SD) is employed at the destination node. Further to this, we present a comparative study in terms of OP and ASEP performance of RS-based and repetitive transmission schemes. We conclude that the RS-based transmission always performs better in terms of OP and ASEP than repetitive transmission when channel state information (CSI) for RS is perfect. In addition, when the direct source-to-destination link is sufficiently strong, relaying should be disabled when the objective is the minimization of OP. Although RS requires only two time slots for transmission (the repetitive scheme needs as many time slots as the number of decoding relays), its performance heavily relies on the quality of CSI for RS.

The remainder of this paper is structured as follows. Section 2 outlines the system and channel models. Section 3 presents closed-form expressions for the statistics of the instantaneous output SNR of the considered DF relaying schemes over INID Nakagami- fading channels. In Section 4 closed-form and analytical expressions are derived for the OP and ASEP performance, respectively, of all relaying schemes. Section 5 contains numerical results and relevant discussion, whereas Section 6 concludes the paper.

*Notations*

Throughout this paper, represents the cardinality of the set , and denotes the expectation operator. denotes probability, denotes the inverse Laplace transform, and represents a random variable (RV) following the complex normal distribution with mean and variance . is the Gamma function [32, equation (8.310/1)], and is the lower incomplete Gamma function [32, equation (8.350/1)]. Moreover, is the Dirac function, is the unit step function, and is the Kronecker Delta function.

#### 2. System and Channel Model

We consider a dual-hop cooperative wireless system, as illustrated in Figure 1, consisting of wireless nodes: one source node , a set of relay nodes, each denoted by , , and one destination node . All â€™s are assumed to operate in half-duplex mode; that is, they cannot transmit and receive simultaneously, and node is assumed to possess perfect and , for all , CSI. We consider orthogonal DF (ODF) relaying [4] entailing that each that successfully decodes â€™s signal retransmits it to ; during each â€™s transmission to , node remains silent. Repetitive transmission [4] requires time slots to forward â€™s signal to in a predetermined order, whereas only two time slots are needed for RS-based transmission [9]. In both transmission strategies during the first time slot, broadcasts its signal to all â€™s and also to . Considering quasi-static fading channels, the received signal at â€™s and in the first time slot can be mathematically expressed as where and denote the and complex-valued channel coefficients, respectively, and denotes the transmitted complex message symbol with average symbol energy . Moreover, the notations and in (1) represent the additive white Gaussian noise (AWGN) at and , respectively, with . For both and , it is assumed that they are statistically independent of .

Let us assume that a set contains the relay nodes that have successfully decoded â€™s signal during the first time slot of transmission. Repetitive transmission requires that more time slots are used for â€™s belonging to to forward to ; each retransmits during the th time slot (Note that the assignment of each time slot to â€™s is performed in a predetermined order [4]. Thus, due to different for all channel conditions and ODF relaying, there might be some unused time slots.). Hence, for quasi-static fading, the received signal at at the th time slot can be expressed as with representing the complex-valued channel coefficient and the AWGN that is again assumed statistically independent of .

When RS-based transmission is used, one time slot is needed for the relay node with the most favourable channel conditions to forward â€™s signal to . Thus, for this transmission strategy and during the second time slot, the received signal at for quasi-static fading can be expressed as where and denote the complex-valued channel coefficient and the AWGN, respectively. As in (1) and (2), it is assumed that is statistically independent of .

The quasi-static fading channels , , and , for all , and are modeled as INID Nakagami- RVs [33]. Let and , , denote the instantaneous received SNRs of the and link, respectively, with corresponding average values represented by and , respectively. Clearly, each , , is gamma distributed with probability density function (PDF) given by [34, Tableâ€‰â€‰2.2] where denotes the Nakagami- fading parameter and . Integrating (4), the cumulative distribution function (CDF) of each is easily obtained as The PDFs and CDFs of the instantaneous received SNRs of the first hop, for all , are given using (4) and (5) by and , respectively. The fading parameters and average SNRs are denoted by and , respectively.

#### 3. Statistics of ODF Relaying Schemes

Relay nodes that decode the transmitted signal from constitute the decoding set . Based on [4, 24], for both transmission strategies the elements of are obtained as where is â€™s transmit rate and for repetitive transmission, whereas for RS-based transmission. Hence, the probability that does not belong to is easily obtained as By plugging (5) into (7), we obtain the following closed-form expression for in INID Nakagami- fading:

To analyze the performance of ODF relaying schemes, the direct channel and the , for all , relay-assisted channels are effectively considered as paths between and [22, 26]. Let the zeroth path represent the direct link and the th path the cascaded link. We define the instantaneous received SNR at related to these paths as and , respectively. By plugging (4) into [22, equation (4)], the PDFs of â€™s, , are given by where is the probability that belongs to . Clearly, the direct path is not linked via a relay; that is, , yielding . Integrating (9) and using (5) yields the following expression for the CDF of the th cascaded path: Note again that for the direct path .

##### 3.1. Repetitive Transmission

The incoming signals at sent by and , for all , may be combined using a time-diversity version of MRD [4] and SD [23]. In particular, combines â€™s signal received in the first time slot with the signals received from , for all , in the subsequent time slots using either MRD or SD.

###### 3.1.1. Repetitive with MRD

With MRD the instantaneous SNR at â€™s output is expressed as Since â€™s, , are independent, the moment-generating function (MGF) of can be easily obtained as the product of the MGFs of â€™s. As shown in [26] for INID Nakagami- fading, using (9) and the definition of the MGF of , , yields . Similarly, using (4) the MGF of is easily obtained as . Hence, the following closed-form expression for the MGF of in INID Nakagami- is deduced: Using the MGF-based approach [34], the CDF of can be obtained as By plugging (13) into (14) and similarly with [26], we obtain the following closed-form expression for of repetitive transmission with MRD over INID Nakagami- fading with integer â€™s and distinct â€™s: The symbol is used for short-hand representation of multiple summations and with . For , for all , with arbitrary values for â€™s and following a similar analysis as for the derivation of (15), a closed-form expression for can be obtained as

###### 3.1.2. Repetitive with SD

An alternative to MRD is a time-diversity version of SD allowing to combine the received signals from and for all [23]. With this diversity technique, the instantaneous SNR at â€™s output is given by where . The â€™s, , are assumed to be independent; therefore, of (17) can be easily obtained as the product of the CDFs of â€™s. With the use of (5) and (10) for and for all , respectively, a closed-form expression for of repetitive transmission with SD under INID Nakagami- fading channels can be derived as where is the CDF of the instantaneous SNR of the channel, that is, of which is easily obtained using (10) for INID Nakagami- fading as

Differentiating (18), the PDF of is given by
where is the PDF of . To obtain an expression for [21], we first use [32, equation (8.352/1)] to obtain (20) for integer â€™s yielding
Then, differentiating (22) and using the formula
a closed-form expression for over INID Nakagami- fading channels with integer â€™s is obtained as [21, equation (6)]
In (24), parameters â€™s, with and being positive integers, are given by
Using (4) and (5) for integer â€™s, that is, after using [32, equation (8.352/1)] for expressing â€™s, as well as (22) and (24) to (21), and after some algebraic manipulations, we obtain the following *novel* closed-form expression for :
which is valid for INID Nakagami- fading with integer values of â€™s and distinct â€™s.

To derive the MGF of , we plug the expression of (26) to the definition of the MGF given by (12), that is, after replacing with in (12), and use [32, equation (3.381/4)] to solve the resulting integrals. In particular, by first deriving using (24) the following closed-form expression for the MGF of in INID Nakagami- fading with integer values of â€™s and distinct â€™s:
a *novel* closed-form expression for the MGF of of repetitive transmission with SD over INID Nakagami- fading channels with integer values of â€™s and distinct â€™s is given by
It is noted that (28) corrects a typo that appears in [28, equation (7)]. For equal â€™s, that is, IID Nakagami- fading with and for all , following a similar procedure as for the derivation of (28) and using the binomial and multinomial theorems [32, equation (1.111)], we first obtain the following closed-form expression for for integer :
where , for all , , and symbol is used for short-hand representation of multiple summations . Using (21) for IID Nakagami- fading, (29) and after some algebraic manipulations, a *novel* closed-form expression for for repetitive transmission with SD in IID Nakagami- fading channels with integer is obtained as
where function , with and being positive integers, is given by

##### 3.2. RS-Based Transmission

When RS-based transmission is utilized, RS is first performed to obtain [11, 21, 28]. Relay node is the one experiencing the most favorable , for all , channel conditions; that is, its instantaneous SNR is given by (19). Using expressions derived in Section 3.1, we present closed-form expressions for the statistics of a pure RS scheme [21, 24] that combines at the received signals from and using a time-diversity version of MRD as well as of a rate-selective one [11, 21] that utilizes pure RS only if it is beneficial in terms of achievable rate over the direct transmission.

###### 3.2.1. Pure RS

With pure RS, utilizes MRD to combine the signals from and [24]; therefore, the instantaneous SNR at â€™s output is given, using (19), by Similar to the derivation of (13), the MGF of for pure RS can be obtained as the following product: where is given by (27) for INID Nakagami- with integer â€™s and distinct â€™s, whereas, by (29) for IID Nakagami- with integer for all and . Therefore, by plugging (27) into (33), a closed-form expression for of pure RS under INID Nakagami- fading with integer â€™s and distinct â€™s is given by [21, equation (7)] For IID Nakagami- fading channels with integer , by plugging (29) into (33) the following closed-form expression for of pure RS is obtained [21, equation (10)]:

To obtain for pure RS under INID Nakagami- fading with integer â€™s and distinct â€™s, we plug (34) into (14), and, after some algebraic manipulations, the following closed-form expression is derived [21, equation (8)]: where , with being positive real, and for , and 3. In the above two equations for all , and . Moreover, for all , , and as well as , for all , , , and . For , for all, and integer , and similar to the derivation of (36), by plugging (35) into (14), a closed-form expression for of pure RS is obtained which is given by [21, equation (11)]â€‰ where , , and .

###### 3.2.2. Rate-Selective RS

Dual-hop transmission incurs a pre-log penalty factor of . To deal with this rate loss, pure RS is considered only if it provides higher achievable rate than that of the direct transmission [10, 21, 35], that is, higher than . Using instantaneous CSI and (32), rate-selective RS chooses between direct (non-relay-assisted) and RS-assisted transmission based on the following criterion [21, equation (14)]: As shown in [21], the MGF of can be obtained using the of pure RS as where is an RV with CDF given by which can be obtained using inverse sampling [36]. By plugging (34) and (36) into (40), a closed-form expression for of rate-selective RS over INID Nakagami- fading channels with integer â€™s and distinct â€™s is derived as By plugging (35) and (38) into (40), we obtain the following closed-form expression for for rate-selective RS under IID Nakagami- fading channels with integer :

#### 4. Performance Analysis of ODF Relaying Schemes

In this section, the performance of the presented ODF relaying schemes with repetitive and RS-based transmission over INID Nakagami- fading channels is analyzed. To this end, we present closed-form and analytical expressions, respectively, for the following performance metrics: (i) OP and (ii) ASEP of several modulation formats.

##### 4.1. Repetitive Transmission

Using the closed-form expressions for and presented in Section 3.1, the OP and ASEP of repetitive transmission with both MRD and SD are easily obtained as follows.

*OP:* The end-to-end OP of repetitive transmission is easily obtained using as
By plugging (15) and (16) into (43), closed-form expressions for the of repetitive transmission with MRD over INID Nakagami- fading channels with integer â€™s and distinct â€™s, as well as with arbitrary â€™s and , for all , are obtained [26]. Similarly, by plugging (5) into (18) and (20) into (43), we obtain a *novel* closed-form expression for the of repetitive transmission with SD over INID Nakagami- fading channels with arbitrary values for â€™s.

*ASEP:* Following the MGF-based approach [34] and using the expressions given by (13) for repetitive transmission with MRD and (28) and (30) for repetitive transmission with SD, the ASEP of several modulation formats for the presented repetitive relaying schemes over INID Nakagami- fading channels can be easily evaluated. For example, the ASEP of noncoherent binary frequency shift keying (NBFSK) and differential binary phase shift keying (DBPSK) modulation schemes can be directly calculated from ; the average bit error rate probability (ABEP) of NBFSK is given by and of DBPSK by (1). For other schemes, including binary phase shift keying (BPSK), -ary phase shift keying (-PSK) (It is noted that for modulation order , gray encoding is assumed so that .), quadrature amplitude modulation (-QAM), amplitude modulation (-AM), and differential phase shift keying (-DPSK), single integrals with finite limits and integrands composed of elementary functions (exponential and trigonometric) have to be readily evaluated via numerical integration [34]. For example, the ASEP of -PSK is easily obtained as
where , while for -QAM, the ASEP can be evaluated as
with .

##### 4.2. RS-Based Transmission

The closed-form expressions for the statistics of pure and rate-selective RS presented in Section 3.2 can be used to evaluate the OP and ASEP of both RS-based schemes as follows.

*OP:* Using the expressions of (36) and (38) for INID and IID Nakagami- fading channels, respectively, with integer fading parameters, the end-to-end OP of pure RS is easily obtained as [21, equation (12)]

For rate-selective RS, a closed-form expression for over INID Nakagami- fading with arbitrary â€™s can be easily obtained by plugging (5) and (20) into [21, equation (15)] which yields

*ASEP:* Following the MGF-based approach and using the expressions for pure RS of (34) and (35) for INID and IID Nakagami- fading channels, respectively, with integer fading parameters, the ASEP of several modulation formats for pure RS can be easily calculated. Similarly, the ASEP for rate-selective RS can be easily evaluated using the expressions of (41) and (42) for INID and IID Nakagami- fading channels, respectively, with integer values for the fading parameters.

#### 5. Numerical Results and Discussions

The analytical expressions of the previous section have been used to evaluate the performance of ODF cooperative systems utilizing repetitive and RS-based transmission over INID Nakagami- flat fading channels. Without loss of generality, it has been assumed that transmits at a rate â€‰bps/Hz and that the fading parameters of the first and the second hop of all links are equal, that is, for all , as well as for all . Moreover, for the performance evaluation results, we have considered the exponentially power decaying profile with being the power decaying factor. Clearly, when ID fading is considered, and for all . In all figures that follow, analytical results for the and match perfectly with the results obtained by means of Monte Carlo simulations, validating our analysis.

Figure 2 plots the of the considered relaying schemes with both repetitive and RS-based transmission as a function of for average transmit SNR dB over IID Nakagami- fading channels with different values of . As clearly shown, improves with increasing for both RS-based transmission schemes whereas it degrades severely for both repetitive ones. In particular, utilizing repetitive transmission for dB is unavailing for irrespective of the fading conditions. As for RS-based transmission, the gains from RS diminish as increases; the smaller the value of , the greater the gain from relaying on . Furthermore, pure RS is inefficient when is small, and rate-selective RS results in significant gains on over the pure one as decreases. The impact of increasing on the performance of all four relaying schemes is also demonstrated in Figure 3 for different values of and IID Rayleigh fading conditions. As shown from this figure and Figure 2 for both repetitive and RS-based transmission, degrades with decreasing and/or . For example, although for dB repetitive transmission does not benefit from relaying for , this happens for dB when . Moreover, for dB the improvement on the of pure RS with increasing is very small, while performance of rate-selective RS does not vary with . It turns out that the smaller the , the smaller the gains from relaying as fading conditions become more severe and transmit SNR reduces.

In Figure 4, the decoding probability of (8) is plotted versus for both repetitive and RS-based transmission over IID Nakagami- fading conditions for the source-to-relay channels with different values of and for all . As expected, decreasing and/or reduces the decoding probability. Moreover, this probability is severely degraded with increasing for repetitive transmission, whereas it remains unchanged with increasing for the RS-based one. The performance of pure and rate-selective RS is depicted in Figure 5 versus for relays over INID Nakagami- fading channels with different values of , , and . As expected, for both RS-based schemes, improves with increasing and/or any of the fading parameters. More importantly, it is shown that, as the fading conditions of the relay-to-destination channels become more favorable than those of the direct source to destination channel, RS-based transmission improves . On the contrary, whenever the fading conditions of the relay-to-destination channels are similar to the direct one, non-relay-assisted transmission results in lower than RS-based one.

In Figure 6, the performance of square 4-QAM is plotted as a function of over IID Nakagami- fading channels with different values of . The average SNR per bit is assumed to be dB for all second hop channels and dB. It is clearly shown that the of RS-based transmission improves with increasing and/or , whereas for both repetitive schemes, although improves with increasing , it does not benefit from increasing . Interestingly, for RS-based transmission, as and/or increase, the improvement of pure compared with rate-selective RS increases; as shown by (39), rate-selective RS might choose the direct transmission even in cases where the received SNR from the best relay is larger than that from the source node. Assuming IID Rayleigh fading conditions, Figure 7 plots for DBPSK versus for all considered relaying schemes and for different values of . As shown in this figure and Figure 6, for both repetitive and RS-based transmission improves with increasing and/or . It was shown in Figure 4 that more favorable fading conditions and larger increase the decoding probability; thus, both repetitive transmission schemes become unavailing for larger , whereas the gains from RS increase. The performance of pure and rate-selective RS is depicted in Figure 8 versus for DBPSK over INID Nakagami- fading channels with different values for the fading parameters with , 2, and 3 relay nodes (dB). Clearly, for both RS-based transmission schemes, improves with increasing and/or and/or . It is shown that as increases and as the fading conditions of the relay-to-destination channels become more favorable than those of the direct source to destination channel, RS-based transmission results in larger improvement. More importantly, even for strong source-to-destination channels, as increases, the improvement on with RS-based transmission becomes larger than that of the non-relay-assisted one.

#### 6. Conclusion

Cooperative diversity is a very promising avenue for future wireless communications. However, it is necessary to investigate how relays should be utilized in order to achieve certain objectives. In this paper, we presented a general analytical framework for modeling and evaluating the performance of four DF relaying schemes under INID Nakagami- fading channels. More specifically, we obtained closed-form expressions for the OP and the ASEP performance of repetitive transmission when SD is employed at the destination node and presented a comparative performance study in terms of OP and ASEP of all considered DF schemes. We concluded that RS performs better than repetitive transmission when CSI for RS is perfect. Furthermore, it was shown that relaying should be switched off when the source-to-destination direct link is sufficiently strong and the aim is minimizing OP. However, in terms of ASEP, relaying was shown always to be beneficial.

#### References

- G. J. Foschini and M. J. Gans, â€śOn limits of wireless communications in a fading environment when using multiple antennas,â€ť
*Wireless Personal Communications*, vol. 6, no. 3, pp. 311â€“335, 1998. View at Google Scholar Â· View at Scopus - E. Biglieri, R. Calderbank, A. Constantinides, A. Goldsmith, A. Paulraj, and H. V. Poor,
*MIMO Wireless Communications*, Cambridge University Press, Cambridge, UK, 1st edition, 2007. - G. C. Alexandropoulos,
*Performance study of space diversity receivers over correlated fading channels*, Ph.D. dissertation, University of Patras, Rio-Patras, Greece, 2010. - J. N. Laneman and G. W. Wornell, â€śDistributed space-time-coded protocols for exploiting cooperative diversity in wireless networks,â€ť
*IEEE Transactions on Information Theory*, vol. 49, no. 10, pp. 2415â€“2425, 2003. View at Publisher Â· View at Google Scholar Â· View at MathSciNet - A. Sendonaris, E. Erkip, and B. Aazhang, â€śUser coorperation diversity—part I: system description,â€ť
*IEEE Transactions on Communications*, vol. 51, no. 11, pp. 1927â€“1938, 2003. View at Google Scholar - A. Sendonaris, E. Erkip, and B. Aazhang, â€śUser coorperation diversity—part II: implementation aspects and performance analysis,â€ť
*IEEE Transactions on Communications*, vol. 51, no. 11, pp. 1939â€“1948, 2003. View at Google Scholar - A. Papadogiannis,
*Systems and techniques for multicell-MIMO and cooperative relaying in wireless networks*, Ph.D. dissertation, Telecom ParisTech, Paris, France, 2009. - A. Papadogiannis, G. C. Alexandropoulos, A. G. Burr, and D. Grace, â€śBringing mobile relays for wireless access networks into practice–Learning when to relay,â€ť
*IET Communications*, to appear. - A. Bletsas, A. Khisti, D. P. Reed, and A. Lippman, â€śA simple cooperative diversity method based on network path selection,â€ť
*IEEE Journal on Selected Areas in Communications*, vol. 24, no. 8, pp. 659â€“672, 2006. View at Publisher Â· View at Google Scholar - A. Papadogiannis, E. Hardouin, A. Saadani, D. Gesbert, and P. Layec, â€śA novel framework for the utilization of dynamic relays in cellular networks,â€ť in
*Proceedings of the IEEE ASIMOLAR*, pp. 975â€“979, Pacific Grove, Calif, USA, 2008. - A. Papadogiannis, A. Saadani, and E. Hardouin, â€śExploiting dynamic relays with limited overhead in cellular systems,â€ť in
*Proceedings of the IEEE Globecom Workshops, (Gc Workshops '09)*, Hawaii, USA, 2009. View at Publisher Â· View at Google Scholar - M. O. Hasna and M. S. Alouini, â€śEnd-to-end performance of transmission systems with relays over Rayleigh-fading channels,â€ť
*IEEE Transactions on Wireless Communications*, vol. 2, no. 6, pp. 1126â€“1131, 2003. View at Publisher Â· View at Google Scholar Â· View at Scopus - A. Stefanov and E. Erkip, â€śCooperative space-time coding for wireless networks,â€ť
*IEEE Transactions on Communications*, vol. 53, no. 11, pp. 1804â€“1809, 2005. View at Publisher Â· View at Google Scholar - M. Elfituri, W. Hamouda, and A. Ghrayeb, â€śOutage probability analysis of distributed coded cooperation for relay channels,â€ť in
*Proceedings of the IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, (PIMRC '07)*, Athens, Greece, 2007. View at Publisher Â· View at Google Scholar - A. Nosratinia and T. E. Hunter, â€śGrouping and partner selection in cooperative wireless networks,â€ť
*IEEE Journal on Selected Areas in Communications*, vol. 25, no. 2, pp. 369â€“378, 2007. View at Publisher Â· View at Google Scholar Â· View at Scopus - M. Elfituri, W. Hamouda, and A. Ghrayeb, â€śPerformance analysis of a new transmission scheme for multi-relay channels,â€ť in
*Proceedings of the IEEE Workshop on Signal Processing Systems Design and Implementation, (SIPS '06)*, pp. 34â€“38, 2006. View at Publisher Â· View at Google Scholar - M. Elfituri, W. Hamouda, and A. Ghrayeb, â€śDistributed coded cooperation for relay channels operating in the decode-and-forward mode,â€ť in
*Proceedings of the IEEE International Conference on Communications, (ICC '08)*, pp. 4586â€“4590, Beijing, China, 2008. View at Publisher Â· View at Google Scholar - M. Elfituri, A. Ghrayeb, and W. Hamouda, â€śAntenna/relay selection for coded wireless cooperative networks,â€ť in
*Proceedings of the IEEE International Conference on Communications, (ICC '08)*, pp. 840â€“844, Beijing, China, 2008. View at Publisher Â· View at Google Scholar - S. I. Hussain, M. O. Hasna, and M. S. Alouini, â€śPerformance analysis of best relay selection scheme for fixed gain cooperative networks in non-identical Nakagami-$m$ channels,â€ť in
*Proceedings of the 7th International Symposium on Wireless Communication Systems, (ISWCS'10)*, pp. 255â€“259, York, UK, 2010. View at Publisher Â· View at Google Scholar Â· View at Scopus - K. Yan, J. Jiang, Y. G. Wang, and H. T. Liu, â€śOutage probability of selection cooperation with MRC in Nakagami-$m$ fading channels,â€ť
*IEEE Signal Processing Letters*, vol. 16, no. 12, pp. 1031â€“1034, 2009. View at Publisher Â· View at Google Scholar Â· View at Scopus - G. C. Alexandropoulos, A. Papadogiannis, and K. Berberidis, â€śPerformance analysis of cooperative networks with relay selection over Nakagami-$m$ fading channels,â€ť
*IEEE Signal Processing Letters*, vol. 17, no. 5, pp. 441â€“444, 2010. View at Publisher Â· View at Google Scholar Â· View at Scopus - N. C. Beaulieu and J. Hu, â€śA closed-form expression for the outage probability of decode-and-forward relaying in dissimilar Rayleigh fading channels,â€ť
*IEEE Communications Letters*, vol. 10, no. 12, pp. 813â€“815, 2006. View at Publisher Â· View at Google Scholar - J. Hu and N. C. Beaulieu, â€śPerformance analysis of decode-and-forward relaying with selection combining,â€ť
*IEEE Communications Letters*, vol. 11, no. 6, pp. 489â€“491, 2007. View at Publisher Â· View at Google Scholar Â· View at Scopus - E. Beres and R. Adve, â€śSelection cooperation in multi-source cooperative networks,â€ť
*IEEE Transactions on Wireless Communications*, vol. 7, no. 1, pp. 118â€“127, 2008. View at Publisher Â· View at Google Scholar Â· View at Scopus - F. Xu, F. C. M. Lau, Q. F. Zhou, and D.-W. Yue, â€śOutage performance of cooperative communication systems using opportunistic relaying and selection combining receiver,â€ť
*IEEE Signal Processing Letters*, vol. 16, no. 4, pp. 237â€“240, 2009. View at Publisher Â· View at Google Scholar - C. K. Datsikas, N. C. Sagias, F. I. Lazarakis, and G. S. Tombras, â€śOutage analysis of decode-and-forward relaying over Nakagami-$m$ fading channels,â€ť
*IEEE Signal Processing Letters*, vol. 15, no. 1, pp. 41â€“44, 2008. View at Publisher Â· View at Google Scholar - A. Papadogiannis and G. C. Alexandropoulos, â€śSystem level performance evaluation of dynamic relays in cellular networks over Nakagami-$m$ fading channels,â€ť in
*Proceedings of the IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, (PIMRC '09)*, Tokyo, Japan, 2009. View at Publisher Â· View at Google Scholar - G. C. Alexandropoulos, A. Papadogiannis, and K. Berberidis, â€śRelay selection vs. repetitive transmission cooperation: analysis under Nakagami-$m$ fading,â€ť in
*Proceedings of the IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, (PIMRC'10)*, pp. 140â€“144, Istanbul, Turkey, 2010. View at Publisher Â· View at Google Scholar - T. Q. Duong, G. C. Alexandropoulos, H.-J. Zepernick, and T. A. Tsiftsis, â€śOrthogonal space-time block codes with CSI-assisted amplify-and forward relaying in correlated Nakagami-$m$ fading channels,â€ť
*IEEE Transactions on Vehicular Technology*, vol. 60, no. 3, pp. 882â€“889, 2011. View at Google Scholar - T. Q. Duong, G. C. Alexandropoulos, T. A. Tsiftsis, and H.-J. Zepernick, â€śOutage probability of MIMO AF relay networks over Nakagami-$m$ fading channels,â€ť
*Electronics Letters*, vol. 46, no. 17, pp. 1229â€“1231, 2011. View at Publisher Â· View at Google Scholar - P. C. Sofotasios, G. C. Alexandropoulos, A. Papadogiannis, Q. T. Duong, and S. Freear, â€śError probability of DF relay selection: Sensitivity of the Nakagami fading parameter,â€ť submitted to
*Electronics Letters*. - I. S. Gradshteyn and I. M. Ryzhik,
*Table of Integrals, Series, and Products*, Academic Press, New York, NY, USA, 6th edition, 2000. - M. Nakagami, â€śThe $m$-distribution—a general formula of intensity distribution of rapid fading,â€ť in
*Statistical Methods in Radio Wave Propagation*, W. G. Hoffman, Ed., pp. 3â€“36, Permagon Press, Oxford, UK, 1960. View at Google Scholar - M. K. Simon and M.-S. Alouini,
*Digital Communication over Fading Channels*, John Wiley & Sons, New York, NY, USA, 2nd edition, 2005. - K. Woradit, T. Q. S. Quek, W. Suwansantisuk, H. Wymeersch, L. Wuttisittikulkij, and M. Z. Win, â€śOutage behavior of cooperative diversity with relay selection,â€ť in
*Proceedings of the IEEE Global Telecommunications Conference (GLOBECOM '08)*, pp. 966â€“970, New Orleans, LA, USA, 2008. View at Publisher Â· View at Google Scholar - W. G. Cochran,
*Sampling Techniques*, John Wiley & Sons, New York, NY, USA, 3rd edition, 1977.