Performance of virtual full-duplex relaying on cooperative multi-path relay channels

We consider a cooperative multi-path relay channel (MPRC) where multiple half-duplex relays assist in the packet transmissions from a source to its destination. A virtual full-duplex (FD) relaying scheme is proposed that allows the source to transmit a new packet simultaneously with the selected best relay, with the rest of the relays attempting to decode this new packet. Thus, a new source packet can be served in each time slot, as in FD relay systems. Taking into account the effect of inter-relay interference (IRI) that is caused by simultaneous relay and source transmissions, a Markov chain analytical model is used to characterize the decoding performance at the relays, based on which the overall outage probability of MPRC is obtained in closed-form expressions. The asymptotic performance analysis reveals that in low rate scenarios, a close-to-full diversity order is achieved by the proposed scheme while substantially improving the spectrum efficiency. In high rate scenarios, the decoding performance of relays is limited by IRI and the system outage performance experiences an error floor. Simulation results demonstrate the performance gains of the proposed scheme by comparisons with existing half-duplex and FD relay systems in the literature

Full-duplex wireless communications: challenges, solutions and future research directions

The family of conventional half-duplex (HD) wireless systems relied on transmitting and receiving in different time-slots or frequency sub-bands. Hence the wireless research community aspires to conceive full-duplex (FD) operation for supporting concurrent transmission and reception in a single time/frequency channel, which would improve the attainable spectral efficiency by a factor of two. The main challenge encountered in implementing an FD wireless device is the large power difference between the self-interference (SI) imposed by the device’s own transmissions and the signal of interest received from a remote source. In this survey, we present a comprehensive list of the potential FD techniques and highlight their pros and cons. We classify the SI cancellation techniques into three categories, namely passive suppression, analog cancellation and digital cancellation, with the advantages and disadvantages of each technique compared. Specifically, we analyse the main impairments (e.g. phase noise, power amplifier nonlinearity as well as in-phase and quadrature-phase (I/Q) imbalance, etc.) that degrading the SI cancellation. We then discuss the FD based Media Access Control (MAC)-layer protocol design for the sake of addressing some of the critical issues, such as the problem of hidden terminals, the resultant end-to-end delay and the high packet loss ratio (PLR) due to network congestion. After elaborating on a variety of physical/MAC-layer techniques, we discuss potential solutions conceived for meeting the challenges imposed by the aforementioned techniques. Furthermore, we also discuss a range of critical issues related to the implementation, performance enhancement and optimization of FD systems, including important topics such as hybrid FD/HD scheme, optimal relay selection and optimal power allocation, etc. Finally, a variety of new directions and open problems associated with FD technology are pointed out. Our hope is that this treatise will stimulate future research efforts in the emerging field of FD communication

Cost-Effective Signal Processing Algorithms for Physical-Layer Security in Wireless Networks

Data privacy in traditional wireless communications is accomplished by cryptography techniques at the upper layers of the protocol stack. This thesis aims at contributing to the critical security issue residing in the physical-layer of wireless networks, namely, secrecy rate in various transmission environments. Physical-layer security opens the gate to the exploitation of channel characteristics to achieve data secure transmission. Precoding techniques, as a critical aspect in pre-processing signals prior to transmission has become an effective approach and recently drawn significant attention in the literature. In our research, novel non-linear precoders are designed focusing on the improvement of the physical-layer secrecy rate with consideration of computational complexity as well as the Bit Error Ratio (BER) performance. In the process of designing the precoder, strategies such as Lattice Reduction (LR) and Artificial Noise (AN) are employed to achieve certain design requirements. The deployment and allocation of resources such as relays to assist the transmission also have gained significant interest. In multiple-antenna relay networks, we examine various relay selection criteria with arbitrary knowledge of the channels to the users and the eavesdroppers. Furthermore, we provide novel effective relay selection criteria that can achieve a high secrecy rate performance. More importantly they do not require knowledge of the channels of the eavesdroppers and the interference. Combining the jamming technique with resource allocation of relay networks, we investigate an opportunistic relaying and jamming scheme for Multiple-Input Multiple-Output (MIMO) buffer-aided downlink relay networks. More specifically, a novel Relaying and Jamming Function Selection (RJFS) algorithm as well as a buffer-aided RJFS algorithm are developed along with their ability to achieve a higher secrecy rate. Relying on the proposed relay network, we detail the characteristics of the system, under various relay selection criteria, develop exhaustive search and greedy search-based algorithms, with or without inter-relay Interference Cancellation (IC)

Wireless Network-Level Partial Relay Cooperation: A Stable Throughput Analysis

In this work, we study the benefit of partial relay cooperation. We consider a two-node system consisting of one source and one relay node transmitting information to a common destination. The source and the relay have external traffic and in addition, the relay is equipped with a flow controller to regulate the incoming traffic from the source node. The cooperation is performed at the network level. A collision channel with erasures is considered. We provide an exact characterization of the stability region of the system and we also prove that the system with partial cooperation is always better or at least equal to the system without the flow controller.Comment: Submitted for journal publication. arXiv admin note: text overlap with arXiv:1502.0113

Distributed space-time coding including the golden code with application in cooperative networks

This thesis presents new methodologies to improve performance of wireless cooperative networks using the Golden Code. As a form of space-time coding, the Golden Code can achieve diversity-multiplexing tradeoff and the data rate can be twice that of the Alamouti code. In practice, however, asynchronism between relay nodes may reduce performance and channel quality can be degraded from certain antennas. Firstly, a simple offset transmission scheme, which employs full interference cancellation (FIC) and orthogonal frequency division multiplexing (OFDM), is enhanced through the use of four relay nodes and receiver processing to mitigate asynchronism. Then, the potential reduction in diversity gain due to the dependent channel matrix elements in the distributed Golden Code transmission, and the rate penalty of multihop transmission, are mitigated by relay selection based on two-way transmission. The Golden Code is also implemented in an asynchronous one-way relay network over frequency flat and selective channels, and a simple approach to overcome asynchronism is proposed. In one-way communication with computationally efficient sphere decoding, the maximum of the channel parameter means is shown to achieve the best performance for the relay selection through bit error rate simulations. Secondly, to reduce the cost of hardware when multiple antennas are available in a cooperative network, multi-antenna selection is exploited. In this context, maximum-sum transmit antenna selection is proposed. End-to-end signal-to-noise ratio (SNR) is calculated and outage probability analysis is performed when the links are modelled as Rayleigh fading frequency flat channels. The numerical results support the analysis and for a MIMO system maximum-sum selection is shown to outperform maximum-minimum selection. Additionally, pairwise error probability (PEP) analysis is performed for maximum-sum transmit antenna selection with the Golden Code and the diversity order is obtained. Finally, with the assumption of fibre-connected multiple antennas with finite buffers, multiple-antenna selection is implemented on the basis of maximum-sum antenna selection. Frequency flat Rayleigh fading channels are assumed together with a decode and forward transmission scheme. Outage probability analysis is performed by exploiting the steady-state stationarity of a Markov Chain model