On the performance of selection decode-and-forward relay networks over Nakagami-m fading channels

Duong, Trung Q.; Bao, Vo Nguyen Quoc; Zepernick, Hans‐Jürgen

doi:10.1109/lcomm.2009.081858

Cited by 170 publications

(86 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this work the signals are combined only with the current information of the signal and channel. A number of diversity combining methods, e.g., equal gain combining (EGC) [29], maximal ratio combining (MRC) [29][30][31], selection combining [29,32,33], etc. are available in the literature.…”

Section: Combining Methodsmentioning

confidence: 99%

Timing Synchronization for Cooperative Communications with Detect and Forward Relaying

Hossain

Smith

Kandeepan

2010

Wireless Pers Commun

View full text Add to dashboard Cite

A non-data-aided near maximum likelihood (NDA-NML) symbol timing estimator is presented, which is applied to a cooperative communication system with a source, relay and destination. A Cramer rao bound (CRB) for the estimator for asymptotically low signal-to-noise (SNR) ratio case is derived. The timing complexity of the NDA-NML estimator is derived and compared with the correlation based data-aided maximum likelihood (DA-ML) estimator. It is demonstrated that the complexity of the NDA-NML estimator is much less than that of correlation based DA-ML estimator. The bit-error-rate (BER) performance of this system operating in a detect-and-forward (DAF) mode is studied where the channel state information (CSI) is available at the receiver and the symbol timings are estimated independently for each channel. SNR combining (SNRC) and equal ratio combining (ERC) methods are considered. It is found that timing estimation error has a significant effect on BER performance. It is also found that for large timing error the benefit of cooperative diversity could vanish. It is demonstrated that significant gains can be made with both combining methods with cooperation and timing estimation, where the gains are the same for both estimators.

show abstract

Section: Combining Methodsmentioning

confidence: 99%

Timing Synchronization for Cooperative Communications with Detect and Forward Relaying

Hossain

Smith

Kandeepan

2010

Wireless Pers Commun

View full text Add to dashboard Cite

show abstract

“…Due to the fact that the numbers of available links for S − R and R − D transmissions at state s u are N u SR and N u RD , respectively, using the results in [35] and [36] leads to the probability p u SR in Eq. (12) is written as where…”

Section: Identically Distributed and Asymmetric Relay Channelsmentioning

confidence: 99%

Diversity and delay performance of max link selection relay cooperation systems over non-identical Nakagami-m fading channels

Jia

Zhou

Dang

et al. 2016

J Wireless Com Network

View full text Add to dashboard Cite

The work focuses on the max link selection (MLS) schemes of buffer-aided relaying over the independent and non-identically distributed (i.ni.d) Nakagami-m fading channels in terms of outage probability, average packet delay, and improved diversity-delay trade-off schemes. By modeling the transition of buffer states as a Markov chain, we first obtain the outage probability and average packet delays for MLS schemes, which are given with closed-form expressions. The achieved results show that the i.ni.d fading channels impose severe loss in the diversity and coding gains of MLS schemes. Especially, when the disparity among the channel powers is very large, the diversity order provided by the MLS schemes is less than the ones provided by the traditional best relay selection (T-BRS) and max-max link selection (MMLS) schemes even if the buffers' size is large enough. For the average packet delay of MLS schemes, our results show that they are impacted by the transmit power and the fading severity factors. In general, in the low transmit power, the average packet delays are varying with the transmit power. However, in the high transmit power, the average packet delays approach the stationary values. Besides of this, it is also achieved that the i.ni.d fading makes the average packet delays of MLS schemes at all relays are different. When the powers of relay-destination links are greater than the ones of source-relay links, the average packet delays can be reduced evidently. Motivated by the observations, a weight-based MLS (W-MLS) diversity-delay trade-off scheme is proposed. The proposed W-MLS diversity-delay trade-off schemes not only have the low packet delays at all relays but also provide enough diversity and coding gains over T-BRS and MMML, which can overcome the performance loss caused by non-identical distribution on MLS schemes.

show abstract

“…Denoting the optimal source and relay powers by P * 1 and P * 2 , respectively, and defining, α * = P * 1 P * 2 , the OPA can be obtained from (27) as P * 1 = P T /(1 + α * ) and P * 2 = α * P T /(1 + α * ), with…”

Section: Sr Rdmentioning

confidence: 99%

Performance analysis and power allocation for multi-hop multi-branch amplify-and-forward cooperative networks over generalized fading channels

Mohammadi

Ardebilipour

Mobini

et al. 2013

J Wireless Com Network

View full text Add to dashboard Cite

In this article, efficient power allocation strategies for multi-hop multi-branch amplify-and-forward networks are developed in generalized fading environments. In particular, we consider the following power optimization schemes: (i) minimizing of the all transmission powers subject to an outage constraint; and (ii) minimizing the outage probability subject to constraint on total transmit powers. In this study, we first derive asymptotically tight approximations for the statistics of the received signal-to-noise ratio (SNR) in the system under study with maximal ratio combining and selection combining receiver. With the statistical characterization of the received SNR, we then carry out a thorough performance analysis of the system. Finally, the asymptotic expression of the outage probability is used to formulate the original optimization problems using geometric programming (GP). The GP can readily be transformed into nonlinear convex optimization problem and therefore solved efficiently and globally using the interior-point methods. Numerical results are provided to substantiate the analytical results and to demonstrate the considerable performance improvement achieved by the power allocation.

show abstract

On the performance of selection decode-and-forward relay networks over Nakagami-m fading channels

Cited by 170 publications

References 10 publications

Timing Synchronization for Cooperative Communications with Detect and Forward Relaying

Timing Synchronization for Cooperative Communications with Detect and Forward Relaying

Diversity and delay performance of max link selection relay cooperation systems over non-identical Nakagami-m fading channels

Performance analysis and power allocation for multi-hop multi-branch amplify-and-forward cooperative networks over generalized fading channels

Contact Info

Product

Resources

About