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

Utilizing relaying techniques to improve performance of wireless systems is a promising avenue. However, it is crucial to understand what type of relaying schemes should be used for achieving different performance objectives under realistic fading conditions. In this paper, we present a general framework for modelling and evaluating the performance of relaying schemes based on the decode-and-forward (DF) protocol over independent and not necessarily identically distributed (INID) Nakagami-m fading channels. In particular, we present closed-form expressions for the statistics of the instantaneous output signal-to-noise ratio of four significant relaying schemes with DF; two based on repetitive transmission and the other two based on relay selection (RS). These expressions are then used to obtain closed-form expressions for the outage probability and the average symbol error probability for several modulations of all considered relaying schemes over INID Nakagami-m fading. Importantly, it is shown that when the channel state information for RS is perfect, RS-based transmission 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 in this case it should be switched-off.Comment: Submitted to Journal of Computer Systems, Networks, and Communication

Bringing Mobile Relays for Wireless Access Networks into Practice - Learning When to Relay

Adding fixed relay nodes (RNs) to wireless access networks requires additional costly infrastructure. Utilising mobile RNs, that is, user terminals that relay signals intended for other users being the destination nodes (DNs), is an appealing cost-effective solution. However, the changing node topology increases the required signalling for relay selection (RS). The signalling overhead consists of control signals that need to be exchanged between the RNs, the source node (SN) and the DN, to achieve the objectives of cooperation. To reduce signalling without penalising performance, the authors propose a three-step approach exploiting statistical knowledge on the likelihood of attaining performance gains by using RNs as a function of the node position (position of DNs and RNs). In the first step only the cell DNs that are likely to gain from relaying request the assistance of RNs. In the second step, for each DN that requests relaying, a limited set of RN candidates is formed. These decisions are made with the aid of thresholds applied to inter-node distances whose values are based on the acquired statistical knowledge. In the final step, RN candidates feed back the relevant channel state information to the SN that performs RS. Furthermore, the authors investigate the attained gains from mobile RNs as a function of the fading environment and they show that mobile RNs can help overcome the effects of severe fading

Data-precoded algorithm for multiple-relay-assisted systems

A data-precoded relay-assisted (RA) scheme is proposed for a system cooperating with multiple relay nodes (RNs), each equipped with either a single-antenna or a two-antenna array. The classical RA systems using distributed space-time/frequency coding algorithms, because of the half-duplex constraint at the relays, require the use of a higher order constellation than in the case of a continuous link transmission from the base station to the user terminal. This implies a penalty in the power efficiency. The proposed precoding algorithm exploits the relation between QPSK and 4 L -QAM, by alternately transmitting through L relays, achieving full diversity, while significantly reducing power penalty. This algorithm explores the situations where a direct path (DP) is not available or has poor quality, and it is a promising solution to extend coverage or increase system capacity. We present the analytical derivation of the gain obtained with the data-precoded algorithm in comparison with distributed space-frequency block code (SFBC) ones. Furthermore, analysis of the pairwise error probability of the proposed algorithm is derived and confirmed with numerical results. We evaluate the performance of the proposed scheme and compare it relatively to the equivalent distributed SFBC scheme employing 16-QAM and non-cooperative schemes, for several link quality scenarios and scheme configurations, highlighting the advantages of the proposed scheme

Codificação distribuída em sistemas com diversidade cooperativa

Doutoramento em Engenharia ElectrotécnicaO presente trabalho propõe-se a divulgar as mais significativas técnicas de esquemas cooperativos, de forma a ultrapassar alguns dos problemas dos sistemas móveis sem fios da próxima geração, estendendo a área de cobertura destes sistemas, assim como a sua capacidade e fiabilidade. O estudo de diversos esquemas cooperativos é efetuado em termos de capacidade e de taxa de erros, fazendo variar o número de relays e de antenas em cada elemento do sistema. Diversos algoritmos com aplicação em sistemas cooperativos são desenvolvidos e propostos ao longo desta tese, como códigos espaço-frequência aplicados de forma distribuída nos relays, para sistemas baseados na tecnologia OFDM e sob diversos cenários próximos da realidade. Os sistemas cooperativos são particularmente úteis em situações em que o caminho direto entre dois terminais não está acessível ou tem uma fraca qualidade de transmissão. Tendo este aspeto em consideração, e pretendendo ter a máxima eficiência espetral e máxima diversidade, um algoritmo com precodificação é também proposto para múltiplos relays, cada um equipado com uma ou duas antenas. A formulação matemática associada aos algoritmos propostos é apresentada, assim como a derivação da probabilidade de erro teórica. O desempenho dos sistemas assistidos por relays usando os algoritmos propostos é comparado em relação a outros esquemas cooperativos equivalentes e a esquemas não-cooperativos, considerando cenários com diferentes qualidades de canal, daí advindo importantes conclusões em relação a estes sistemas.Cooperative schemes are promising solutions for cellular wireless networks aiming to improve system fairness, extend coverage and increase capacity. Measurements of these system performances are made in terms of BER and capacity for different configurations, by varying the number of relays and of antennas equipping each node. In this work we propose and evaluate distributed space-frequency codes applied to cooperative systems in a distributed way, with application in OFDM systems and considering realistic scenarios. Moreover, the use of relays is of significant interest to allow radio access in situations where a direct path is not available or has poor quality. Thus, a data precoded relay-assisted scheme is also proposed for a system cooperating with multiple relays, each equipped with either a single antenna or two-antenna array. Mathematical formulation of the proposed algorithms is derived as well as the pairwise error probability. We further present the performances of the proposed algorithms apllied in relay-assisted schemes, and compare them with equivalent cooperative and non-cooperative schemes, for several channel quality scenarios, through which important conclusions are achieved.FCT/FS