Interference‐resistant cooperative wireless networks based on complementary codes

Spatial diversity in wireless networks can be attained by exploiting the broadcast nature of wireless transmission without the need of multiple antennas in individual device, leading to the implementation of cooperative communication. While most prior works focused on the single source—destination scenario, it should be more realistic to consider how to induce cooperation among multiple source‐destination pairs assisted by multiple relays. In such a case, multiple access interference (MAI) may present due to asynchronous transmissions of the users and relays. In this paper, a cooperative network architecture based on orthogonal complementary (OC) codes inherently immune to MAI is proposed. To efficiently utilize the scarce radio spectrum and codes, a centralized medium access control (MAC) protocol is proposed to coordinate the code assignment and channel access among users and relays. We theoretically analyze the bit error rate (BER) performance of the proposed OC coded cooperative network over multipath Rayleigh fading channel. The performance gain resulted from different numbers of relays is investigated, and compared with a time division multiple access (TDMA) based cooperative scheme. We show that the proposed OC coded cooperative network performs well in the presence of timing offset, and thus is well suited for asynchronous uplink transmission with cooperative relaying. Copyright © 2009 John Wiley & Sons, Ltd.     

Distributed Cooperative Data Relaying for Diversity in Impulse-Based UWB Ad-Hoc Networks

In this paper we develop and investigate two families of efficient distributed cooperative data relaying schemes that can be adopted to forward data in the impulse-based ultra wide band wireless ad-hoc network composed of a pair of source and destination and multiple parallel two-hop relays. The new schemes combine the mechanism of the medium access control and physical layers in a cooperative and distributed way to either select the best relay from multiple available ones for data forwarding or optimally combine the synchronized data forwarding of all participating relays, such as to improve the data transfer diversity. For distributed cooperative routing, we propose efficient protocols for use at all relays to perform an enhanced ultra wide band pulse sensing multiple access with the backoff periods deterministically and optimally mapped from associated instantaneous source-relay-destination route qualities, to ensure that only the best relay can firstly and successfully forward its received data to the destination; For distributed cooperative beamforming, we propose efficient protocols for use at all relays to take advantages of the widely spread and independently distributed multiple paths of the fading ultra wide band channels in the synchronized data forwarding combination, to create an optimally combined route for source-destination data transfer. Performance analysis and simulation studies show the effectiveness and efficiency of our proposed schemes.     

Cooperative beamforming of full‐duplex relays for improving physical layer security

In this paper, we consider secure communications of one source‐destination pair in the presence of one eavesdropper, when full‐duplex decode‐and‐forward cooperative relays operate to enhance physical layer security. While the conventional half‐duplex relay receives the signal from the source and forwards the re‐encoded signal to the destination in two separated time slots, the full‐duplex relay (FDR) performs the transmission and reception at the same time, which can ideally double the secrecy capacity. However, because of the simultaneous transmission and reception, each FDR suffers from both its own self‐interference and the interference from the other cooperative FDRs. When the conventional cooperative relaying schemes are used in full‐duplex relaying, it is obviously expected that the self‐interference signals cause severe degradation of the secrecy capacity. Here, we propose an iterative transmit power allocation and relay beamforming weight design scheme for cooperative FDRs to enhance the secrecy rate as well as suppress the self‐interference signals. Numerical results present that the FDRs with the proposed scheme significantly improve the secrecy rate compared with the conventional half‐duplex relays. Copyright © 2015 John Wiley & Sons, Ltd.     

Performance of multiuser detectors based on EM-like method for ultra-wideband communications systems in multipath fading channel

An adaptive multiuser detector (MUD) is proposed for direct-sequence ultra-wideband (DS-UWB) multiple access communication systems to suppress both multiple access interference (MAI) and inter-symbol interference (ISI). In this contribution, considering the MUD from a combination viewpoint, we proposed a MUD based on electromagnetism-like (EM) method, which applied the concept of EM search to Hopfield neural network (EMHNN) for solving optimization problems. We analyze the performance of the EMHNN MUD in multipath fading channel, and compare it with the optimum detector and several suboptimum schemes such as conventional, decorrelator detector (DD), minimum-mean-squared error (MMSE) and HNN MUD. Simulation results will demonstrate that the proposed EMHNN MUD, which alleviates the detrimental effects of the MAI problem, can significantly improve the system performance.     

Power allocations in minimum-energy SER-constrained cooperative networks

In this paper, we propose minimum power allocation strategies for repetition-based amplify-and-forward (AF) relaying, given a required symbol error rate (SER) at the destination. We consider the scenario where one source and multiple relays cooperate to transmit messages to the destination. We derive the optimal power allocation strategy for two-hop AF cooperative network that minimizes the total relay power subject to the SER requirement at the destination. Two outstanding features of the proposed schemes are that the power coefficients have a simple solution and are independent of knowledge of instantaneous channel state information (CSI). We further extend the SER constraint minimum power allocation to the case of multibranch, multihop network and derive the closed-form solution for the power control coefficients. For the case of power-limited relays, we propose two iterative algorithms to find the power coefficients for the SER constraint minimum-energy cooperative networks. However, this power minimization strategy does not necessarily maximize the lifetime of battery-limited systems. Thus, we propose two other AF cooperative schemes which consider the residual battery energy, as well as the statistical CSI, for the purpose of lifetime maximization. Simulations show that the proposed minimum power allocation strategies could considerably save the total transmitted power compared to the equal transmit power scheme.     

Performance evaluation of multiuser diversity in multiuser two‐hop cooperative multi‐relay wireless networks using maximal ratio combining over Rayleigh fading channels

Multiuser diversity (MUD) cooperative wireless networks combine the features of the MIMO systems without confronting the physical layer constraints by providing multiple copies of the transmitted signal from the source to the destination with the help of the relay node. Cooperative wireless networks have attracted the full attention in the last few years and are implemented widely in many wireless communication systems to adapt for the fading impairments, provide higher data rates, and improve the performance of the wireless communication systems. In this paper, we present an informative study for the reason of evaluating the performance of the MUD in the multiuser two‐hop cooperative multi‐relay networks using maximal ratio combining. Furthermore, we derive tight closed‐form expressions of outage probability and symbol error probability for the amplify‐and‐forward and fixed decode‐and‐forward protocols with the MUD. Additionally, we conduct a simulation study to show to what extent our analytical and simulation results agree with each other. It is worthy to mention that our analytical and simulation results agree fairly with each other under high average signal‐to‐noise ratio, whereas they show that our proposed system with multiple relays provides significant improvements over those previously proposed systems having only one relay. Copyright © 2013 John Wiley & Sons, Ltd.     

Joint power allocation and relay selection for decode-and-forward cooperative relay in secure communication

In this paper, we investigate the cooperative strategy with total power constraint in decode-and-forward (DF) relaying scenario, in the presence of an eavesdropper. Due to the difference of channel for each source-relay link, not all relay nodes have constructive impacts on the achievable secrecy rate. Besides, the final achieved secrecy rate depends on both source-relay and relay-destination links in DF relaying scenario. Therefore, the principal question here is how to select cooperative strategy among relays with proper power allocation to maximize the secrecy rate. Three strategies are considered in this paper. First, we investigate the cooperative jamming (CJ) strategy, where one relay with achieved target transmission rate is selected as a conventional relay forwarding signal, and remaining relays generate artificial noise via CJ strategy to disrupt the eavesdropper. Two CJ schemes with closed-form solutions, optimal cooperative jamming (OCJ) and null space cooperative jamming (NSCJ), are proposed. With these solutions, the corresponding power allocation is formulated as a geometric programming (GP) problem and solved efficiently by convex programming technique. Then, to exploit the cooperative diversity, we investigate the cooperative relaying (CR) strategy. An iterative algorithm using semi-definite programming (SDP) and GP together with bisection search method is proposed to optimize the cooperative relaying weight and power allocated to the source and relays. Furthermore, to exploit the advantages of both CR and CJ, we propose an adaptive strategy to enhance the security. Simulation results demonstrate that the efficiency of the proposed cooperative strategies in terms of secrecy rate.     

On the energy efficiency of MIMO cooperative relaying networks

Cooperative relaying techniques can greatly improve the capacity of the multiple input and multiple output (MIMO) wireless system. The transmit power allocation (TPA) strategies for various relaying protocols have become very important for improving the energy efficiency. This article proposes novel TPA schemes in the MIMO cooperative relaying system. Two different scenarios are considered. One is the hybrid decode-and-forward (HDF) protocol in which the zero-forcing (ZF) process is operated on relays, and the other is the decode-and-forward (DF) protocol with relay node and antenna selection strategies. The simulation results indicate that the proposed schemes can bring about significant capacity gain by exploiting the nature of the relay link. Additionally, the proposed TPA scheme in the HDF system can achieve the same capacity as the equal TPA with fewer relay nodes used. Finally, the capacity gain with the proposed schemes increases when the distribution range of relay nodes expands.     

多天线中继网络中的终端性能和多样性分析

The performance of multi-antenna multi- relay cooperative system is investigated in this paper. Two relaying strategies, i.e., reactive and proactive strategies are analyzed with the Amplifyand- Forward (AF) and Decode-and-Forward (DF) protocols. We derive the Cumulative Distribution Function (CDF) of the received Signal-to-Noise Ratio (SNR) at the destination, which is used to calculate the exact outage probability, for both AF and DF protocols. According to these results, we conclude that a cooperative network which composes K relays each equipped with nr antennas can achieve maximal order-(2nrK+1) diversity gain, by proper processing at relays and destination. Furthermore, the performance comparison is given, in terms of outage probability. These two strategies outperform each other in different scenarios in AF protocol, whilst proactive strategy is always better than its counterpart in DF protocol. According to these results, the optimal power allocation schemes among relay nodes are also presented, with reasonable power constraint.     

直扩卫星通信系统中多用户检测算法比较

实际在CDMA系统中,多址干扰(MAI)是主要的干扰来源,多用户检测技术完全可以抑制这种多址干扰。论文分析了几种典型的多用户检测技术,并在高斯信道环境下对解相关检测器、最小均方误差检测器和传统检测器进行了仿真和性能比较。     

Theoretical Limits for Time Delay Based Location Estimation in Cooperative Relay Networks

Node localization in wireless networks is crucial for supporting advanced location-based services and improving the performance of network algorithms such as routing schemes. In this paper, we study the fundamental limits for time delay based location estimation in cooperative relay networks. The theoretical limits are investigated by obtaining Cramer–Rao Lower Bound (CRLB) expressions for the unknown source location under different relaying strategies when the location of the destination is known and unknown. More specifically, the effects of amplify-and-forward and decode-and-forward relaying strategies on the location estimation accuracy are studied. Furthermore, the CRLB expressions are derived for the cases where the location of only source as well as both source and destination nodes are unknown considering the relays as reference nodes. In addition, the effects of the node topology on the location estimation accuracy of the source node are investigated. The results reveal that the relaying strategy at relay nodes, the number of relays, and the node topology can have significant impacts on the location accuracy of the source node. Additionally, knowing the location of the destination node is crucial for achieving accurate source localization in cooperative relay networks.     

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.     

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.     

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

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

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.      

Adaptive multi-node incremental relaying for hybrid-ARQ in AF relay networks

This paper proposes an adaptive multi-node incremental relaying technique in cooperative communications with amplify-and-forward (AF) relays. In order to reduce the excessive burden of MRC with all diversity paths at the destination node, the destination node decides if it combines signals over the first Ν(< Κ) time slots/frames or over all of the Κ times slots, where Κis the number of relay nodes. Our analytical and simulation results show that the proposed adaptive multi-node incremental relaying outperforms the conventional MRC in terms of outage probability in AF based cooperative communications since the proposed scheme effectively reduces the spectral efficiency loss. Our asymptotic analysis also shows that the proposed adaptive multi-node incremental relaying achieves full diversity order Κ+ 1.     

多接入中继信道中的单中继选择

研究表明,协作中继选择能提高无线中继网络的鲁棒性和能效。文中研究一个多接入中继信道,包含2个信源,N个中继和1个信宿。中继节点为半双工,对两个信源的信号采用非再生的网络编码。考虑直接链路,基于最佳最差信道、最佳信噪比和最佳调和平均选择,提出新的选择策略。仿真结果表明其在性能上优于原有策略。     

DS-CDMA卫星通信系统线性多用户检测算法性能比较

CDMA是新一代移动通信系统的关键技术,现代卫星移动通信也采用CDMA技术。多址干扰(MAI)的存在严重影响了CDMA系统的性能,需要采用多用户检测技术进行抑制。本文分析了卫星移动通信系统的模型,将线性多用户检测算法用于卫星移动通信系统,并对传统检测器、解相关检测器、MMSE检测器等线性检测器进行了性能比较。计算机仿真结果表明采用线性多用户检测技术使卫星移动通信系统的性能得到了明显的改善。     

Successive beamforming,multiuser detection and diversity reception for multicarrier DS-CDMA system with antenna array

Code-Division Multiple-Access (CDMA) systems are interference limited,and therefore efficient interference management is necessary to enhance the performance of a CDMA system.In this paper,a successive beamforming (spatial filtering),linear decorrelating MultiUser Detection (MUD, temporal filtering) and diversity reception structure for uplink multicarrier Direct Sequence CDMA (DS-CDMA) system with antenna array are proposed.By beamforming,the antenna array suppresses interference according to the distinct array signature.Subsequently,linear decorrelating MUD is ap- plied to separate the signals of different users and eliminate Multiple Access Interference (MAI).Finally, the decorrelated signals at different subcarriers that belong to the same user are combined to achieve frequency diversity.Simulation results show that the proposed structure offers significant Bit Error Rate (BER) performance improvement by successively exploiting the space-time-frequency processing.     

低复杂度的QR解相关多用户检测算法

针对常规解相关多用户检测算法因对相关矩阵求逆的运算量随用户数增加呈指数增加而失去了实用价值,提出了不需对相关阵求逆的计算复杂度低的快速QR解相关多用户检测算法。该快速算法运算量与常规解相关算法相比,运算量减少了70％,而检测性能丝毫没有降低。显然,该算法优于常规算法,具有实用意义。