Secure Beamforming for MIMO Two-Way Communications with an Untrusted Relay

This paper studies the secure beamforming design in a multiple-antenna three-node system where two source nodes exchange messages with the help of an untrusted relay node. The relay acts as both an essential signal forwarder and a potential eavesdropper. Both two-phase and three-phase two-way relay strategies are considered. Our goal is to jointly optimize the source and relay beamformers for maximizing the secrecy sum rate of the two-way communications. We first derive the optimal relay beamformer structures. Then, iterative algorithms are proposed to find source and relay beamformers jointly based on alternating optimization. Furthermore, we conduct asymptotic analysis on the maximum secrecy sum-rate. Our analysis shows that when all transmit powers approach infinity, the two-phase two-way relay scheme achieves the maximum secrecy sum rate if the source beamformers are designed such that the received signals at the relay align in the same direction. This reveals an important advantage of signal alignment technique in against eavesdropping. It is also shown that if the source powers approach zero the three-phase scheme performs the best while the two-phase scheme is even worse than direct transmission. Simulation results have verified the efficiency of the secure beamforming algorithms as well as the analytical findings.Comment: 10 figures, Submitted to IEEE Transactions on Signal Processin

Performance of Joint Channel and Physical Network Coding Based on Alamouti STBC

This work considers the protograph-coded physical network coding (PNC) based on Alamouti space-time block coding (STBC) over Nakagami-fading two-way relay channels, in which both the two sources and relay possess two antennas. We first propose a novel precoding scheme at the two sources so as to implement the iterative decoder efficiently at the relay. We further address a simplified updating rule of the log-likelihood-ratio (LLR) in such a decoder. Based on the simplified LLR-updating rule and Gaussian approximation, we analyze the theoretical bit-error-rate (BER) of the system, which is shown to be consistent with the decoding thresholds and simulated results. Moreover, the theoretical analysis has lower computational complexity than the protograph extrinsic information transfer (PEXIT) algorithm. Consequently, the analysis not only provides a simple way to evaluate the error performance but also facilitates the design of the joint channel-and-PNC (JCNC) in wireless communication scenarios.Comment: 6 pages, 4 figures, accpete

Wireless MIMO Switching: Weighted Sum Mean Square Error and Sum Rate Optimization

This paper addresses joint transceiver and relay design for a wireless multiple-input-multiple-output (MIMO) switching scheme that enables data exchange among multiple users. Here, a multi-antenna relay linearly precodes the received (uplink) signals from multiple users before forwarding the signal in the downlink, where the purpose of precoding is to let each user receive its desired signal with interference from other users suppressed. The problem of optimizing the precoder based on various design criteria is typically non-convex and difficult to solve. The main contribution of this paper is a unified approach to solve the weighted sum mean square error (MSE) minimization and weighted sum rate maximization problems in MIMO switching. Specifically, an iterative algorithm is proposed for jointly optimizing the relay's precoder and the users' receive filters to minimize the weighted sum MSE. It is also shown that the weighted sum rate maximization problem can be reformulated as an iterated weighted sum MSE minimization problem and can therefore be solved similarly to the case of weighted sum MSE minimization. With properly chosen initial values, the proposed iterative algorithms are asymptotically optimal in both high and low signal-to-noise ratio (SNR) regimes for MIMO switching, either with or without self-interference cancellation (a.k.a., physical-layer network coding). Numerical results show that the optimized MIMO switching scheme based on the proposed algorithms significantly outperforms existing approaches in the literature.Comment: This manuscript is under 2nd review of IEEE Transactions on Information Theor

Generalized Adaptive Network Coding Aided Successive Relaying Based Noncoherent Cooperation

A generalized adaptive network coding (GANC) scheme is conceived for a multi-user, multi-relay scenario, where the multiple users transmit independent information streams to a common destination with the aid of multiple relays. The proposed GANC scheme is developed from adaptive network coded cooperation (ANCC), which aims for a high flexibility in order to: 1) allow arbitrary channel coding schemes to serve as the cross-layer network coding regime; 2) provide any arbitrary trade-off between the throughput and reliability by adjusting the ratio of the source nodes and the cooperating relay nodes. Furthermore, we incorporate the proposed GANC scheme in a novel successive relaying aided network (SRAN) in order to recover the typical 50% half-duplex relaying-induced throughput loss. However, it is unrealistic to expect that in addition to carrying out all the relaying functions, the relays could additionally estimate the source-to-relay channels. Hence noncoherent detection is employed in order to obviate the power-hungry channel estimation. Finally, we intrinsically amalgamate our GANC scheme with the joint network-channel coding (JNCC) concept into a powerful three-stage concatenated architecture relying on iterative detection, which is specifically designed for the destination node (DN). The proposed scheme is also capable of adapting to rapidly time-varying network topologies, while relying on energy-efficient detection