Performance Analysis of Two-Way Amplify and Forward Relaying with Adaptive Modulation over Multiple Relay Network

Hwang, Kyu-Sung; Ko, Young-Chai; Alouini, Mohamed‐Slim

doi:10.1109/tcomm.2010.111710.090617

Cited by 39 publications

(35 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…channel links that means equivalent average Signal-to-Noise Ratios (SNRs) for the links S → R k and R k → D [17]. Although this assumption simplifies the analysis and it is used in several studies in the literature [18]- [21], it can be implemented by an appropriate longterm routing process which selects the clustered nodes to be closed together [19], [20].…”

Section: System Modelmentioning

confidence: 99%

Buffer-Aided Relay Selection for Cooperative Diversity Systems without Delay Constraints

Krikidis

Charalambous

Thompson

2012

IEEE Trans. Wireless Commun.

356

420

View full text Add to dashboard Cite

In this paper, we study the relay selection problem for a finite buffer-aided decode-and-forward cooperative wireless network. A relay selection policy that fully exploits the flexibility offered by the buffering ability of the relay nodes in order to maximize the achieved diversity gain is investigated. This new scheme incorporates the instantaneous strength of the wireless links as well as the status of the finite relay buffers and adapts the relay selection decision on the strongest available link by dynamically switching between relay reception and transmission. In order to analyse the new relay selection policy in terms of outage probability and diversity gain, a theoretical framework that models the evolution of the relay buffers as a Markov chain (MC) is introduced. The construction of the state transition matrix and the related steady state of the MC are studied and their impact on the derivation of the outage probability is investigated. We show that the proposed relay selection scheme significantly outperforms conventional relay selection policies for all cases and ensures a diversity gain equal to two times the number of relays for large buffer sizes.

show abstract

Section: System Modelmentioning

confidence: 99%

Buffer-Aided Relay Selection for Cooperative Diversity Systems without Delay Constraints

Krikidis

Charalambous

Thompson

2012

IEEE Trans. Wireless Commun.

356

420

View full text Add to dashboard Cite

show abstract

“…In order to simplify the analysis, we assume that the clustered relay configuration ensures independent and identically distributed (i.i.d.) channel links that means equivalent average Signal-to-Noise Ratios (SNRs) for the links S → R k and R k → D [8]. Although this assumption simplifies the analysis and it is used in several studies in the literature [9]- [11], it can be implemented by an appropriate long-term routing process which selects the clustered nodes to be closed together [10], [11].…”

Section: System Modelmentioning

confidence: 99%

Opportunistic relay selection for cooperative networks with secrecy constraints

2010

View full text Add to dashboard Cite

Abstract-In this paper, a relay selection policy is proposed that fully exploits the flexibility offered by the buffering ability of the relay nodes in order to maximize the achieved diversity gain. The suggested scheme incorporates the instantaneous strength of the wireless links as well as the status of the finite relay buffers and adapts the relay selection decision on the strongest available link by dynamically switching between relay reception and transmission. We show that the proposed relay selection scheme significantly outperforms conventional relay selection policies for all cases and ensures a diversity gain equal to two times the number of relays for large buffer sizes. I. INTRODUCTIONWe focus on a simple decode-and-forward (DF) cooperative network where a source communicates with a destination through a set of half-duplex relay nodes with the objective of performance optimisation. For this fundamental problem, the max − min relay selection scheme [1], [2], where the selected relay holds the strongest end-to-end relaying path, achieves the optimal performance and ensures a full diversity equal to the number of the relays. However, this relay selection policy refers to a two-slot cooperative transmission where the selected relay receives the source's data during the first time slot and immediately in the next time slot forwards the data towards the destination. In order to overcome this limitation imposed by the max − min selection scheme, recently in [3] the authors introduced data buffers at the relay nodes that allow the selection of a different relay for reception and transmission in order to extract further diversity gains. In that work, the max − max relay selection scheme that selects the relay with the strongest source-relay channel and the strongest relaydestination channel for reception and transmission, respectively, has been investigated. The max − max scheme refers to applications without critical delay constraints and provides a significant coding gain in comparison to the conventional max − min selection scheme. However, despite the efficient use of the channel fading and the related performance benefits, the max − max relay selection policy requires a predefined schedule for the relaying transmission (e.g., the second slot is always allocated for relaying) and therefore the available diversity degrees are not fully exploited. It is worth noting that the use of buffers in order to boost the achieved performance (in terms of throughput) has been reported in the literature in different contexts ( [4]-[7] and references therein).

show abstract

“…For example, if i = 2, L = 10 and m = 2, then user 2 can make error about (10-3-2) = 5 user pairs (i.e. user pair (3,5), (4,6), (5,7), (6,8) or (7,9). In this case, messages of users 3 and 5 can be incorrectly decoded by wrong detection ofV 2,3 ,V 3,4 ,V 4,5 andV 5,6 .…”

Section: Probability Of K = 2 Error Eventsmentioning

confidence: 99%

Error performance analysis of decode‐and‐forward and amplify‐and‐forward multi‐way relay networks with binary phase shift keying modulation

2013

View full text Add to dashboard Cite

In this study, we analyse the error performance of decode and forward (DF) and amplify and forward (AF) multi-way relay networks (MWRNs). The authors consider a MWRN with pair-wise data exchange protocol using binary phase shift keying (BPSK) modulation in both additive white Gaussian noise (AWGN) and Rayleigh fading channels. The authors quantify the possible error events in an L-user DF or AF MWRN and derive accurate asymptotic bounds on the probability for the general case that a user incorrectly decodes the messages of exactly k (k ∈ [1, L − 1]) users. They show that at high signal-to-noise ratio (SNR), the higher order error events (k ≥ 3) are less probable in AF MWRN, but all error events are equally probable in a DF MWRN. They derive the average BER of a user in a DF or AF MWRN in both AWGN and Rayleigh fading channels under high SNR conditions. Simulation results validate the correctness of the derived expressions. The authors results show that at medium to high SNR, DF MWRN provides better error performance than AF MWRN in AWGN channels even with a large number of users (e.g. L = 100). Whereas, AF MWRN outperforms DF MWRN in Rayleigh fading channels even for much smaller number of users (e.g. L > 10).

show abstract

Performance Analysis of Two-Way Amplify and Forward Relaying with Adaptive Modulation over Multiple Relay Network

Cited by 39 publications

References 13 publications

Buffer-Aided Relay Selection for Cooperative Diversity Systems without Delay Constraints

Buffer-Aided Relay Selection for Cooperative Diversity Systems without Delay Constraints

Opportunistic relay selection for cooperative networks with secrecy constraints

Error performance analysis of decode‐and‐forward and amplify‐and‐forward multi‐way relay networks with binary phase shift keying modulation

Contact Info

Product

Resources

About