Power allocation in repetition time diversity hybrid automatic repeat request feedback

This paper addresses the problem of optimal power allocation for hybrid automatic repeat request (HARQ) feedback over slowly-fading channels. We mainly focus on the repetition time diversity HARQ scheme where the results are obtained for both continuous and bursting communication models. Moreover, the effect of an outage probability constraint on the system data transmission efficiency is studied under different transmission power constraints. Simulation results show that 1) for Nakagami fading channels, the optimal HARQ-based (re)transmission powers maximizing the system throughput should be decreasing in every (re)transmission round, 2) higher rates are achieved in the continuous communication, when compared with the bursting model, and 3) HARQ feedback leads to considerable performance improvement even in outage-limited conditions

Relay Switching Aided Turbo Coded Hybrid-ARQ for Correlated Fading Channel

Hybrid-Automatic-Repeat-reQuest (HARQ) has become an indispensable technique in reliable communications systems. However, its performance is inevitably affected by the channel’s fading correlation. In this paper, we proposed a novel relay-switching aided HARQ scheme in order to mitigate the detrimental effects of correlated fading without unduly increasing the system’s complexity and delay. Our results show that the proposed relay-switching regime operates efficiently in correlated channels, hence significantly reduces the error floor of turbo-coded HARQ. Additionally, a HARQ scheme using Segment Selective Repeat (SSR) is incorporated in the relay-switching scheme for achieving further improvements. Quantitatively, the proposed relay-switching aided turbo-coded HARQ scheme using SSR may achieve an approximately 2 dB gain, compared to the conventional amplify-and-forward aided turbo coded HARQ arrangement using Chase Combining. Index Terms - Relay switching, correlated fading channel, Hybrid-ARQ, turbo codes, chase combining, incremental redundancy, selective segment repeat

Truncated-ARQ aided adaptive network coding for cooperative two-way relaying networks: cross-layer design and analysis

Network Coding (NC) constitutes a promising technique of improving the throughput of relay-aided networks. In this context, we propose a cross-layer design for both amplifyand- forward (AF-) and decode-and-forward two-way relaying (DF-TWR) based on the NC technique invoked for improving the achievable throughput under specific Quality of Service (QoS) requirements, such as the maximum affordable delay and error rate.We intrinsically amalgamate adaptive Analog Network Coding (ANC) and Network Coded Modulation (NCM) with truncated Automatic Repeat reQuest (ARQ) operating at the different OSI layers. At the data-link layer, we design a pair of improved NC-based ARQ strategies based on the Stop-andwait and the Selective-repeat ARQ protocols. At the physical layer, adaptive ANC/NCM are invoked based on our approximate packet error ratio (PER). We demonstrate that the adaptive ANC design can be readily amalgamated with the proposed protocols. However, adaptive NC-QAM suffers from an SNR-loss, when the transmit rates of the pair of downlink (DL) channels spanning from the relay to the pair of destinations are different. Therefore we develop a novel transmission strategy for jointly selecting the optimal constellation sizes for both of the relay-to-destination links that have to be adapted to both pair of channel conditions. Finally, we analyze the attainable throughput, demonstrating that our truncated ARQ-aided adaptive ANC/NCM schemes attain considerable throughput gains over the schemes dispensing with ARQ, whilst our proposed scheme is capable of supporting bidirectional NC scenarios

On Noisy ARQ in Block-Fading Channels

Assuming noisy feedback channels, this paper investigates the data transmission efficiency and robustness of different automatic repeat request (ARQ) schemes using adaptive power allocation. Considering different block-fading channel assumptions, the long-term throughput, the delay-limited throughput, the outage probability and the feedback load of different ARQ protocols are studied. A closed-form expression for the power-limited throughput optimization problem is obtained which is valid for different ARQ protocols and feedback channel conditions. Furthermore, the paper presents numerical investigations on the robustness of different ARQ protocols to feedback errors. It is shown that many analytical assertions about the ARQ protocols are valid both when the channel remains fixed during all retransmission rounds and when it changes in each round (in)dependently. As demonstrated, optimal power allocation is crucial for the performance of noisy ARQ schemes when the goal is to minimize the outage probability