Cooperative multiple relay system for frequency selective environment: outage analysis and power allocation

In this paper, we propose a novel cooperative relaying scheme with multiple relays for frequency selective wireless environment. In our proposed scheme, the frequency selective wireless channel is divided into flat fading sub‐channels. Cooperative relaying is then employed over each sub‐channel to improve the system diversity order. We then investigate the asymptotic behavior of the outage probability and show that the proposed scheme achieves full diversity order in both amplify and forward (AF) and adaptive decode and forward (ADF) relaying scenarios. Furthermore, we propose a power allocation strategy to minimize the system outage probability. Simulation results confirm our analysis and show that the proposed power allocation method outperforms uniform power allocation. Copyright © 2010 John Wiley & Sons, Ltd.     

Capacity Maximization through Energy-Aware Multi-Mode Relaying

In future wireless mobile networks, data rate and quality of service are expected to be comparable to those of wired deployments. To achieve this target, novel architectures must be adopted, successfully countering the disadvantages of the wireless transmission. Inspired by that, cooperative relaying was proposed because of the various gains it introduces to the network. In this work we propose a scheme consisting of multi-mode decode and forward relays facilitating the communication between a base station and a user terminal (UT). By equipping the relays with two interfaces, we can exploit the plethora of the available wireless protocols. Also, instead of performing multi-relay transmissions, we adopt an opportunistic relaying scheme due to its simplicity and outage-optimality. Additionally, we incorporate successive transmissions to improve the spectral efficiency, thus recovering the half-duplex loss in capacity due to the two-hop transmission. However, as inter-relay interference arises from successive transmissions, we propose mitigation techniques through interference cancellation and out-band transmissions using the multi-mode relays. At the same time, an energy-aware mechanism is implemented in the selected relay’s transmission, opting for power reduction, as the channel state information is acquired prior to the signal’s forwarding to the UT. Finally, we give numerical results by comparing the proposed energy-aware multi-mode relaying (EA-MMR) scheme, with two other schemes in terms of average end-to-end capacity, outage probability, delay distribution and power gain.     

Cooperative Subcarrier Allocation and Power Allocation in the Downlink of an Amplify-and-Forward OFDM Relaying System

The increasing use of relays in wireless communication systems is a driving force to explore innovative techniques that can improve the quality of service as well as enhance the coverage in wireless systems. In this article, we propose a two-step approach for subcarrier allocation and power allocation in the downlink of an OFDM-based amplify-and forward relaying system. In the first step, the total power is allocated to mobile users and relays based on the optimum power ratio derived for the single-relay system. In the second step, subcarriers are assigned to the users based on cooperative subcarrier allocation algorithms. Compared to the non-cooperative algorithm with flat power allocation, the total throughput is shown to improve by applying the two-step cooperative subcarrier allocation and power allocation algorithms.     

中继未知任何信道信息条件下中继选择的研究

由于信道情况差的中继对协作贡献小,且消耗额外的能量,基于某种标准选择出一个或者多个好的中继参加协作,可以提高协同通信系统性能,所以中继选择是协同通信系统的研究热点。针对一个发送端、接收端及每个中继都配置单根天线的无线中继网络,在假设发送方不知道信道信息而接收方已知全部信道信息前提下,本文提出了中继未知任何信道信息时的中继选择方案。首先提出基于信噪比最大的单中继选择方案,推导了单中继选择的成对错误概率表达式;其次提出基于中继排序方法的多中继选择方案,推导了选择2个中继的成对错误概率的下界;最后给出了仿真结果。理论与仿真结果都表明,中继未知任何信道信息的情况下,选择2个中继参加协作的系统错误概率却高于单中继选择。      

Secure communication in untrusted relay selection networks with wireless energy harvesting

In this paper, we consider the secrecy performance of an energy-harvesting relaying system with Kth best partial relay selection where the communication of a multi-antenna source-destination pair is assisted via single-antenna untrusted relays. To protect confidential source messages from untrusted relays, transmit beamforming and destination jamming signals are used. The relays are energy-constrained nodes that use the power-splitting policy to harvest energy through the wireless signals from both the source and destination. For performance evaluation, closed-form expressions of the secrecy outage probability and average secrecy capacity (ASC) are derived for Nakagami-m fading channels. The analytical results are confirmed via Monte Carlo simulations. Numerical results provide valuable insights into the effect of various system parameters, such as relay location, number of relays, and power splitting ratio, on the secrecy performance. Specifically, the maximum ASC is achieved when the relay is located between the source and destination.

     

BER-Constrained Incremental Relaying with Relay Selection in Cooperative Wireless Networks

One of the main drawbacks of cooperative communication systems with half-duplex relaying is inefficient use of spectrum. Incremental relaying is an effective technique that overcomes this limitation, particularly in the high-SNR regime. In this paper, for a multi-relay cooperative network with arbitrary number of relay nodes, we propose a spectrally-efficient incremental relaying scheme that eliminates redundant relay transmissions such that an average end-to-end bit error rate (BER) constraint is satisfied. For detect-and-forward relaying, under the assumption of error propagation from the relays to the destination, we analyze the performance of the system in terms of the end-to-end BER, the average spectral efficiency and the outage probability for Rayleigh fading environment. The performance of the system depends on a single threshold employed by the relays and the destination. We optimize this threshold such that the average spectral efficiency of the system is maximized under an average end-to-end BER constraint. This optimization criterion results in a constant-BER, variable-spectral efficiency relaying scheme. The proposed scheme makes use of spectrum as efficiently as possible, while providing the required quality of service at the destination.     

Wireless information and power transfer using single and multiple path relays

A relay‐based wireless communication model can relay information along with the power bidirectionally using the amplify‐and‐forward scheme. This paper studies such model extensively. Three information and power relaying protocols, that is, time‐based switching relaying, power‐based splitting relaying, and hybrid time switching‐based and power splitting‐based relaying (HTPSR) are used to carry forward bidirectional information and power transfer. First, a solo relay model is studied, for which, we derived a throughput expression for end‐to‐end information transfer, and this is done for all the three relaying protocols. The paper indicates that the system throughput depends upon the time switching and the power splitting ratio. Further, to make the system more reliable and robust, multiple relays are used in the path. Various relay selection schemes are used for path selection in each transmission, thereby yielding different throughput performances. The results show that an optimal throughput is obtained for a given relay location at an optimal set of values of splitting and switching ratio. Moreover, the HTPSR outperforms both the power splitting and time switching protocol in system throughput performance for a single as well as a multiple‐relay model. Whereas, in relay selection schemes, the best SNR selection scheme outperforms in all the schemes used. The simulated results confirm that the system throughput is an active function of relay placement.     

Asymmetric radio resource allocation scheme for OFDMA wireless networks with collaborative relays

This work addresses the radio resource allocation problem for cooperative relay assisted OFDMA wireless network. The relays adopt the decode-and-forward protocol and can cooperatively assist the transmission from source to destination. Recent works on the subject have mainly considered symmetric source-to-relay and relay-to-destination resource allocations, which limits the achievable gains through relaying. In this paper we consider the problem of asymmetric radio resource allocation, where the objective is to maximize the system throughput of the source-to-destination link under various constraints. In particular, we consider optimization of the set of cooperative relays and link asymmetries together with subcarrier and power allocation. We derive theoretical expressions for the solutions and illustrate them through simulations. The results show clear additional performance gains through asymmetric cooperative scheme compared to the other recently proposed resource allocation schemes.     

Rateless Coding for Wireless Relay Channels

We propose a novel coding framework for wireless relay channels based on rateless codes, which allows for a natural extension to multiple antenna and multiple relay settings. The relaying protocol is half-duplex, and relays independently choose when to collaborate, if at all. With a simulated fountain code based implementation of this framework, we show that the use of rateless codes is both robust and efficient when the channel state information is not available at the transmitters     

Partially-coherent distributed space-time codes with differential encoder and decoder

Distributed space-time coding is a mean of achieving diversity through cooperative communication in a wireless relay network. In this paper, we consider a transmission protocol that follows a two-stage model: transmission from source to relays in the first stage, followed by a simple relaying technique from relays to destination. The relays transmit a vector which is a transformation of the received vector by a relay-specific unitary transformation. We assume that the relays do not have any channel information, while the destination has only a partial-channel knowledge, by which we mean that destination knows only the relay-to-destination channel. For such a setup, we derive a Chernoff bound on the pairwise error probability and propose code design criteria. A second contribution is the differential encoding and decoding scheme for this setup, which is different from the existing ones. Furthermore, differential codes from cyclic division algebra are proposed that achieve full diversity. For our setup with two relays, a Generalized PSK code is shown to achieve full diversity, for which the decoding complexity is independent of code size     

一种基于源端网络编码和交替传输的中继协作方案

针对源节点通过两个中继向目的节点发送数据的无线通信系统,为了减小传统中继协作方案的复用损失,提出了一种将源端网络编码和交替传输有效结合起来的新方案,称为交替源端网络编码(SSNC)。该方案在源端每三个时隙对发送数据进行一次网络编码,并且两个中继在相邻的时隙中交替的发送和接收数据,每个时隙中,一个中继接收源端数据的同时另一个中继转发上一个时隙其接收到的数据给目的端。通过对该方案的中断概率和分集复用折中性能的推导和分析,发现该方案相对于传统的重复编码和分布式空时码方案在获得相同分集阶数的情况下有更高的传输效率,在实际的通信系统中可以兼顾性能和效率。仿真结果证实了我们的结论。      

Partial relaying with layered encoding for efficient multi-hop transmission

Multi-hop transmission through wireless relays provides coverage extension and throughput enhancement. However, it may cause waste of bandwidth to meet half-duplex requirement of the relay. Motivated by this problem, we propose an efficient relaying scheme, referred to as partial relaying with layered encoding. In the proposed scheme, only partial information is transmitted via a relay, and a layered encoding is employed for the link between the source and relay for reliable delivery of the partial information. Simulation results confirm that the proposed scheme outperforms the conventional decode-and-forward relaying scheme, in terms of both the spectral efficiency and bit error rate.     

Nelder‐Mead–based power optimization for secrecy enhancement in amplify‐and‐forward cooperative relay networks

Cooperative communication based on relaying nodes has been considered as a promising technique to increase the physical layer security (PLS) performance in wireless communications. In this paper, an optimal power allocation (OPA) scheme based on Nelder‐Mead (NM) algorithm is proposed for improving the secrecy rate of amplify‐and‐forward (AF) cooperative relay networks employing cooperative jamming (CJ) scheme. The proposed hybrid jamming scheme allows the source and selected relay to transmit the jamming signal along with the information to confound the eavesdropper. The path selection probability of ant colony optimization (ACO) algorithm is used for selecting the relay for transmission. The performance based on secrecy rate is evaluated for “n” trusted relays distributed dispersedly between the source and destination. Gradient‐based optimization and three‐dimensional exhaustive search methods are used as benchmark schemes for comparison of the proposed power optimization algorithm. The secrecy performance is also compared with conventional AF scheme and CJ scheme without power optimization (EPA). The impact of single and multiple relays on secrecy performance is also evaluated. Numerical results reveal that, compared with the gradient method and exhaustive search algorithm, the proposed power allocation strategy achieves optimal performance. Also, the derived OPA results show a significantly higher secrecy rate than the EPA strategy for both CJ and AF schemes.     

A closed-form expression for the outage probability of decode-and-forward relaying in dissimilar Rayleigh fading channels

Decode-and-forward relaying has been shown to be a viable transmission protocol for wireless networks incorporating distributed spatial diversity. Practical systems may employ relay channels that experience statistically different signal fading. The performance of decode-and-forward relaying in channels with dissimilar fading parameters is investigated. In particular, a closed-form expression for the outage probability of a system with an arbitrary number of relays is derived     

Multi-User Relaying of High-Rate Space–Time Code in Cooperative Networks

In this paper, we propose high-rate space–time coding for cooperative wireless networks to reduce the overall delay incurred in relaying signals to multiple receivers. The relay structure is optimized in order to achieve maximum SNR at the receiver nodes. The proposed scheme provides a significant reduction in the delay required for the relaying and transmission of the signals to the multiple receivers with a minute loss in performance. We have also shown by simulation that this loss in the performance could be recovered by selecting more number of relays. We propose two relaying strategies for high-rate space–time codes, which are very useful in providing high data-rate in wireless cooperative networks.     

Distributed differential space-time coding for wireless relay networks

Distributed space-time coding is a cooperative transmission scheme for wireless relay networks. With this scheme, antennas of the distributive relays work as transmit antennas of the sender and generate a space-time code at the receiver. It achieves the maximum diversity. Although the scheme needs no channel information at relays, it does require full channel information, both the channels from the transmitter to relays and the channels from relays to the receiver, at the receiver. In this paper, we propose a differential transmission scheme, which requires channel information at neither relays nor the receiver, for wireless relay networks. As distributed space-time coding can be seen as the counterpart of space-time coding in the network setting, this scheme is the counterpart of differential space-time coding. Compared to coherent distributed space-time coding, the differential scheme is 3dB worse. In addition, we show that Alamouti, square real orthogonal, and Sp(2) codes can be used differentially in networks with corresponding numbers of relays. We also propose distributed differential space-time codes that work for networks with any number of relays using circulant matrices.     

Opportunistic Relay Selection in Cooperative Systems With Dirty-Paper Coding

This paper investigates an optimization of the conventional relay selection for multirelay environments. In contrast with previously reported selection schemes, where a selected relay accesses the channel in a dedicated cooperative slot, the proposed scheme recovers the bandwidth loss of the half-duplex constraint by allowing two relays to simultaneously access the channels. Based on an appropriate dirty-paper coding (DPC) technique among relays, the proposed scheme enables a relay to establish communication with the destination at the same time that another relay forwards the data from the source. It is proven that the interplay between relay selection and the superposition DPC weight factor provides a tradeoff between relaying and new data performance. Hence, an appropriate codesign of the superposition DPC parameter and opportunistic relay selection can achieve efficient communication for the new data without affecting the relaying performance. The proposed scheme is compared with conventional relaying approaches, and its enhancements are provided through theoretical studies and numerical results.      

Power allocation in a transmit diversity system with mean channel gain information

We study the power allocation problem in a transmit diversity wireless system with mean channel gain information. In Rayleigh fading for a given set of mean channel gains and nodes, we seek to find the power allocation that minimizes the outage probability subject to a total power constraint. The optimal solution is shown to be computationally intensive when the number of channels is large. Instead, we derive a simple solution based on the upper bound to the outage probability which can be summarized as equal power allocation with channel selection. Numerical results show that the proposed solution is near-optimal over a wide range of parameter values. The problem addressed and the solution are relevant to a decode-and-forward cooperative relaying system with only partial channel information available to the relays.     

Outage Probability Analysis for Energy Harvesting Cooperative Relays in a Clustered Environment

This paper presents the outage probability analysis of the energy harvesting (EH) decode and forward (DF) cooperative relay network when more than one relays are available to assist the communication between source and destination in the presence of the direct connection. The relays use power splitting (PS) protocol with adaptive PS ratio for EH. As wireless EH can be more beneficial over smaller distances therefore a clustered environment is considered in which the source, destination and relays are located in a small area. First, we analyze the performance of selection cooperation (SC) which requires channel state information (CSI) at the source. High signal to noise ratio approximation of the outage probability is provided for this case. Secondly, we present the performance of all relays cooperation (ARC) scheme which requires no CSI at the source. Lower and upper bounds of the outage probability are presented for smaller number of relays in ARC scheme whereas high signal to noise ratio approximation is provided for higher number of relays. Simulation results validate the analytical results and show that SC scheme outperforms ARC scheme at the expense of CSI requirement.     

Distributed Space-Time Cooperative Systems with Regenerative Relays

This paper addresses some of the opportunities and the challenges in the design of multi-hop systems that utilize cooperation with one or two intermediate regenerative relays to provide high-quality communication between a source and a destination. We discuss the limitations of using a distributed Alamouti scheme in the relay channel and the additional complexity required to overcome its loss of diversity. As an alternative to the distributed Alamouti scheme, we propose and analyze two error aware distributed space-time (EADST) systems built around the Alamouti code. First, using a bit error rate based relay selection approach, we design an EADST system with one and two regenerative relays that rely on feedback from the destination and we show that the proposed system improves on the distributed Alamouti scheme. In addition, we prove that the proposed one relay EADST system collects the full diversity of the distributed MISO channel. Second, we introduce an EADST system without feedback in which the relaying energies depend on the error probabilities at the relays. Numerical results show that both EADST systems perform close to the error probability lower bound obtained by considering error-free reception at the relays