Comparison of Tightly Power-Constrained Performances for Opportunistic Amplify-and-Forward Relaying with Partial or Full Channel Information

In this letter, we present exact statistical expressions for opportunistic amplify-and-forward (AF) relaying under a tight power constraint, where a best relaying node is selected based on partial channel information (PCI) or full channel information (FCI), respectively. Based on the statistical analysis, we compare PCI with FCI strategy in terms of outage and average capacity. Numerical investigation shows that, as the number of candidate relays increases, the performances with FCI are continuously improved while those improvements with PCI are bounded. However, for the small number of the relays at a low SNR region, PCI and FCI achieve very similar performances. The numerical results also show that the relaxed power constraint that ignores the noise power at the relay leads to significant deviations from the tight constraint, which is the more reasonable one, especially in computing the outage with FCI.     

Crystallization in Large Wireless Networks

We analyze fading interference relay networks where single-antenna source-destination terminal pairs communicate concurrently and in the same frequency band through a set of single-antenna relays using half-duplex two-hop relaying. Assuming that the relays have channel state information (CSI), it is shown that in the large-M limit, provided grows fast enough as a function of the network "decouples" in the sense that the individual source-destination terminal pair capacities are strictly positive. The corresponding required rate of growth of as a function of is found to be sufficient to also make the individual source-destination fading links converge to nonfading links. We say that the network "crystallizes" as it breaks up into a set of effectively isolated "wires in the air." A large-deviations analysis is performed to characterize the "crystallization" rate, i.e., the rate (as a function of M, K) at which the decoupled links converge to nonfading links. In the course of this analysis, we develop a new technique for characterizing the large-deviations behavior of certain sums of dependent random variables. For the case of no CSI at the relay level, assuming amplify-and-forward relaying, we compute the per source- destination terminal pair capacity for M, Krarrinfin, with K/Mrarrbeta fixed, using tools from large random matrix theory.     

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.     

Optimal Relaying Beamforming in Multiple Access Broadcast Channel (MABC) Bidirectional Cognitive Radio Networks in Presence of Interferers

In this paper, a general cognitive radio system consisting of a set of users with different level of spectrum access including two primary transceivers and several types of secondary users is considered. It is assumed that two secondary users operate based on an underlay model at the same frequency bandwidth and at the same time as the primary users based on a multiple access broadcast channel bidirectional beamforming scheme. Other secondary users provide a relaying service to the primary users in exchange for the opportunity to send their messages towards their own destinations for a fixed portion of the communication cycle. In addition, it is assumed that some interferers are active during the communication cycle and cause interference for the network. Furthermore, it is assumed that only partial channel state information (CSI) between interferers and other nodes in the network is available. We provide a robust optimization method against imperfection on the interferers’ CSI to maximize the joint primary and secondary signal-to-interference-plus-noise-ratio with the assumption of limited available power at the secondary relays. An amplify-and-forward relaying scheme is deployed at the secondary relays and the optimal beamforming is obtained using second order convex programming method. The simulation results show the performance of the proposed beamforming method against the existence of interferers, and demonstrate the effectiveness of our robust method against uncertainty in knowledge of interferers’ CSIs.     

Exact outage analysis of the effect of co-channel interference on secured multi-hop relaying networks

In this article, the presence of multi-hop relaying, eavesdropper and co-channel interference (CCI) in the same system model is investigated. Specifically, the effect of CCI on a secured multi-hop relaying network is studied, in which the source communicates with the destination via multi-relay-hopping under the presence of an eavesdropper and CCI at each node. The optimal relay at each cluster is selected to help forward the message from the source to the destination. We apply two relay selection approaches to such a system model, i.e. the optimal relay is chosen based on (1) the maximum channel gain from the transmitter to all relays in the desired cluster and (2) the minimum channel gain from the eavesdropper to all relays in each cluster. For the performance evaluation and comparison, we derived the exact closed form of the secrecy outage probability of the two approaches. That analysis is verified by Monte Carlo simulation. Finally, the effects of the number of hops, the transmit power at the source, relays and the external sources, the distance between the external sources and each node in the system, and the location of the eavesdropper are presented and discussed.     

Error performance for relaying protocols with multiple decode‐and‐forward relays

This paper investigates the error performance of three relaying protocols with multiple decode‐and‐forward relays. In the first protocol, relays that can decode correctly will forward the signals from source. Nevertheless, selection cooperation (SC) and opportunistic relaying (OR) are adopted to select only a single relay to forward in the other two protocols, respectively. At sufficiently high signal‐to‐noise ratio, the upper bounds on bit error probability are derived for three protocols, where the developments apply for various channel fading models. Simulation results are provided to verify the tightness of the analytical bounds, and the performance comparisons among different relaying protocols are presented. Copyright © 2010 John Wiley & Sons, Ltd.     

Optimal Amplify‐and‐Forward Scheme for Parallel Relay Networks with Correlated Relay Noise

This paper studies a parallel relay network where the relays employ an amplify‐and‐forward (AF) relaying scheme and are subjected to individual power constraints. We consider correlated effective relay noise arising from practical scenarios when the relays are exposed to common interferers. Assuming that the noise covariance and the full channel state information are available, we investigate the problem of finding the optimal AF scheme in terms of maximum end‐to‐end transmission rate. It is shown that the maximization problem can be equivalently transformed to a convex semi‐definite program, which can be efficiently solved. Then an upper bound on the maximum achievable AF rate of this network is provided to further evaluate the performance of the optimal AF scheme. It is proved that the upper bound can be asymptotically achieved in two special regimes when the transmit power of the source node or the relays is sufficiently large. Finally, both theoretical and numerical results are given to show that, on average, noise correlation is beneficial to the transmission rate — whether the relays know the noise covariance matrix or not.     

Asymptotic Analysis of Opportunistic Relaying Protocols

In this letter, we examine in detail a cooperative network with multiple relays. We investigate protocols that incorporate the opportunistic relaying technique, which selects the ?best? relay among the M available relays. We evaluate the asymptotic outage performance of incremental amplify-andforward (IAF) when it is extended to the opportunistic relaying scenario. Moreover, we propose two new protocols, namely opportunistic incremental selection AF and opportunistic joint incremental selection relaying, and derive the corresponding asymptotic outage probabilities. Finally, we compare the analytical asymptotic outage probabilities and the simulated ones. We conclude that the OJISR protocol outperforms the other protocols.     

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

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

The Cellular Relay Carpet: Distributed Cooperation with Ubiquitous Relaying

We consider the up- as well as downlink of a cellular network in which base stations (BSs) are supported by a large amount of relays spread over the entire area like a carpet. The BSs only see the static relays as the nodes they communicate with, which enables large antenna arrays at the BSs with sophisticated multi-user MIMO transmission. Together with a simple form of BS cooperation, the communication via the small relay cells allows to improve the data rates by distributed interference management and to reduce the complexity at the terminals. We investigate different types of relays as well as different relaying strategies for this relay carpet and compare them with respect to complexity, required channel state information (CSI), and performance in the interference-limited environment of dense cellular networks. The robustness of the different schemes with respect to channel estimation errors is studied and we conclude that especially relays of very low complexity are not sensitive to CSI imperfections. Relays can thus be applied in large numbers and enable massive MIMO at the BSs. The relay carpet proves thereby to be an efficient approach to enhance future generations of cellular networks significantly.     

Relay-Assisted Decorrelating Multiuser Detector (RAD-MUD) for Cooperative CDMA Networks

In this paper, we examine the uplink of a cooperative CDMA network, where users cooperate by relaying each other's messages to the base station. When spreading waveforms are not orthogonal, multiple access interference (MAI) exists at the relays and the destination, causing cooperative diversity gains to diminish. To address this issue, we adopt the multiuser detection (MUD) technique to mitigate MAI in achieving the full advantages of cooperation. Specifically, the relay-assisted decorrelating multiuser detector (RAD-MUD) is proposed to separate interfering signals at the destination with the help of preceding at the relays along with pre-whitening at the destination. Unlike the conventional zero-forcing (ZF) precoder or the decorrelating MUD, the proposed RAD-MUD experiences neither power expansion at the relays nor noise amplification at the destination. Three cooperative transmission strategies are considered on top of RAD-MUD; namely, transmit beamforming, selective relaying and distributed space-time coding. Since the reliability of each source-relay and/or relay-destination links are different, relay transmissions are weighted accordingly in our schemes to further combat MAI. The advantages of RAD-MUD over ZF precoding and other existing cooperative MUD schemes are shown through computer simulations.     

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.      

Opportunistic Relaying in Wireless Networks

Relay networks having n source-to-destination pairs and m half-duplex relays, all operating in the same frequency band and in the presence of block fading, are analyzed. This setup has attracted significant attention, and several relaying protocols have been reported in the literature. However, most of the proposed solutions require either centrally coordinated scheduling or detailed channel state information (CSI) at the transmitter side. Here, an opportunistic relaying scheme is proposed that alleviates these limitations, without sacrificing the system throughput scaling in the regime of large n. The scheme entails a two-hop communication protocol, in which sources communicate with destinations only through half-duplex relays. All nodes operate in a completely distributed fashion, with no cooperation. The key idea is to schedule at each hop only a subset of nodes that can benefit from multiuser diversity. To select the source and destination nodes for each hop, CSI is required at receivers (relays for the first hop, and destination nodes for the second hop), and an index-valued CSI feedback at the transmitters. For the case when n is large and m is fixed, it is shown that the proposed scheme achieves a system throughput of m/2 bits/s/Hz. In contrast, the information-theoretic upper bound of (m/2) log log n bits/s/Hz is achievable only with more demanding CSI assumptions and cooperation between the relays. Furthermore, it is shown that, under the condition that the product of block duration and system bandwidth scales faster than log n log log n, the achievable throughput of the proposed scheme scales as Theta (log n). Notably, this is proven to be the optimal throughput scaling even if centralized scheduling is allowed, thus proving the optimality of the proposed scheme in the scaling law sense. Simulation results indicate a rather fast convergence to the asymptotic limits with the system's size, demonstrating the practical importance of the scaling results.     

Cognitive Bidirectional Buffer-Aided DF Relay Networks: Protocol design and Power Allocation

In this paper, we consider bidirectional decode-and-forward buffer-aided relay selection and transmission power allocation schemes for underlay cognitive radio relay networks. First, a low complexity delay-constrained bidirectional relaying protocol is proposed. The proposed protocol maximizes the single-hop normalized sum of the primary network (PN) and secondary network (SN) rates and controls the maximum packet delay caused by physical layer buffering at relays. Second, optimal transmission power expressions that maximize the single-hop normalized sum rate are derived for each possible transmission mode. Simulation results are provided to evaluate the performance of the proposed relaying protocol and transmission power allocation scheme and compare their performance with that of the optimal scenario. Additionally, the impacts of several system parameters including maximum buffer size, interference threshold, maximum packet delay and number of relays on the network performance are also investigated. The results reveal that the proposed bidirectional relaying protocol and antenna transmission power allocation schemes introduce a satisfactory performance with much lower complexity compared to the optimal relay selection and power allocation schemes and provide an application dependent delay-controlling mechanism. It is also found that the network performance degrades as the delay constraint is more restricted until it matches the performance of conventional unbuffered relaying with delay constraints of three. Additionally, findings show that using buffer-aided relaying significantly enhances the SN performance while slightly weakens the performance of the PN.     

A Two-Way MIMO Relaying Scheme with Partial Channel State Information

In this paper, an mean squared error-optimal relaying scheme is presented for two-way multiple-input multiple-output cooperative relaying systems where only partial channel state information (CSI) is available at the relays due to the high speed mobility. By considering two typical CSI scenarios, namely, fixed relays and high-velocity mobile relays, an optimum relaying scheme is designed for multi-antenna relays. The difficulty of the optimizations lies in the unknown channel response and the special structure of the block diagonal relaying matrix. It is proved that the optimization problem can be converted to an easy-to-solve problem by performing matrix manipulations and employing the channel statistics, such that the Lagrangian multiplier method is ready to be used to obtain an analytical solution. Simulation study is conducted to justify the superior performance of the proposed two-way relaying scheme.     

基于协作通信的最佳中继选择方案

协作通信中的机会中继是一种基于即时信道状态选择的中继选择算法,可以获得与传统协作分集技术相同的分集增益,而不需要使用复杂的空时编码技术。但是多个节点同时竞争最佳中继时,可能出现冲突而导致选择失败。提出一种新的方案,通过引入候选节点限制策略以及控制信道对算法进行改进,仿真表明,该算法特别适用于候选中继较多的情况,可以在实现快速选择节点的同时降低选择失败概率。     

Power line enhanced cooperative wireless communications

In this paper, we investigate the use of power line communication (PLC) to assist cooperative wireless relaying. We consider a communication scheme that uses the power line to initialize and synchronize wireless amplify-and-forward relays and to broadcast information between the relays. Starting from an analysis of transfer functions and noise measurements of PLC channels in office and residential environments, we propose a power line transmission scheme for the inter-relay-communication and assess the influence of this scheme on wireless relaying. This scheme is based on linear precoded orthogonal frequency-division multiplexing; it is designed to optimally exploit the frequency diversity available on PLC channels. The use of PLC leads to a very flexible way of enhancing wireless communications by plugging in additional relays where they are needed-without additional wiring.     

Outage performance of relay selection with spatially random relays using RF energy harvesting

To enable green wireless networks, one appealing approach is to deploy energy harvesting (EH) relays to assist the source transmission. Unlike conventional relays relying on fixed power supplies, EH relays make use of the energy collected from the RF radiation of the source node, and thus, they do not introduce extra energy cost to the network. This paper presents an analytical study to assess the efficacy of EH relays when the one with the maximal end‐to‐end signal‐to‐noise ratio is selected to perform data relaying while others perform EH. Because the action (either harvesting energy or forwarding data) of one EH relay affects those of others, exact performance analysis is not tractable. Additionally, relay density and positions may be random, which further complicates the analysis. Our analysis is conducted based on the hypothesis that each EH relay has an equal chance to be selected. This hypothesis allows for analytical tractability and is of importance to EH relays because otherwise some may drain their batteries fast. We identify the conditions under which the aforementioned hypothesis is valid. Our analysis also considers two variants of amplify‐and‐forward relays with and without using channel state information. Numerical results are presented to validate the analysis accuracy along with extensive discussions on the impact of numerous system parameters. Copyright © 2015 John Wiley & Sons, Ltd.     

Too much mobility limits the capacity of wireless ad hoc networks

We show that for highly mobile ad hoc networks, the benefits of mobility are overshadowed by the cost of mobility in terms of the increased channel uncertainty and network homogeneity. We assume a block-fading channel model with jointly isotropic fading. We allow relays which can transmit and receive simultaneously. Under fairly general assumptions for the users' channel fades and additive noise distributions we show that increasing the number of transmit antennas M at any node beyond the channel coherence time T_c (measured in units of channel uses) does not affect the capacity region of the ad hoc network. For a fast-fading (coherence time T_clesM) homogeneous network, we determine the exact capacity region of the ad hoc network for any partition of the nodes into source, destination, and relay nodes. The optimal strategy is such that only one pair of source-destination nodes is active at a time while all the other nodes are inactive. There is no benefit from relaying and at high signal-to-noise ratio (SNR) the total throughput grows at most double-logarithmically with the number of nodes. Even for the case of slow fading, where the channel variations are slow enough that the receiver can track the channel perfectly, the inability of the transmitter to track the network topology limits the total throughput growth rate to no more than logarithmic in the number of nodes. Spatial correlation is shown to enhance the capacity region of the Rayleigh-fading ad hoc network     

Secrecy analysis of a cooperative NOMA network using an EH untrusted relay

In this paper, a down-link non-orthogonal multiple access (NOMA) system with imperfect successive interference cancellation (SIC) using Energy-Harvesting untrusted relays is investigated. These relaying nodes use in this study use a power-switching architecture to harvest energy from the sources signals and apply an amplify-and-forward protocol to forward the signals. In addition, transmit jamming or artificial noise, is generated by a source node to improve the security of the system and protect confidential source information from untrusted relays. Likewise, three relaying selection strategies are employed to examine the secrecy performance of the proposed system. In order to evaluate the performance evaluation of the proposed system, closed-form expressions of the Secrecy Outage Probability (SOP) are studied over Rayleigh fading channels and a Monte Carlo simulation is used to confirm the analytical results. Furthermore, we study the effects of various parameters, such as power allocation factors, relay node selection, the number of relays, energy harvesting efficiency and the location of relay nodes on the secure outage performances for two users of NOMA system and conventional orthogonal multiple access (OMA). These results show that NOMA offers the better security performance with multiple users.