Physical layer security enhancement in multi-user multi-full-duplex-relay networks

We propose a novel joint user and full-duplex (FD) relay selection (JUFDRS) scheme to enhance physical layer security in a multi-user multi-relay network. In this scheme, the user and the FD decode-and-forward relay are selected such that the capacity of the end-to-end channel (i.e., the user-relaydestination channel) is maximized to ensure the highest quality of cooperative transmission. In order to fully examine the benefits of the JUFDRS scheme, we derive a new closed-form expression for the secrecy outage probability. We show that the JUFDRS scheme significantly outperforms the joint user and half-duplex relay selection (JUHDRS) scheme when the self-interference at the FD relay can be reasonably suppressed. This result indicates that adopting the FD technique at relays can effectively enhance the physical layer secrecy performance in the multi-user multirelay network.ARC Discovery Projects Grant DP150103905

Secrecy Enhancement in Cooperative Relaying Systems

Cooperative communications is obviously an evolution in wireless networks due to its noticeable advantages such as increasing the coverage as well as combating fading and shadowing effects. However, the broadcast characteristic of a wireless medium which is exploited in cooperative communications leads to a variety of security vulnerabilities. As cooperative communication networks are globally expanded, they expose to security attacks and threats more than ever. Primarily, researchers have focused on upper layers of network architectures to meet the requirements for secure cooperative transmission while the upper-layer security solutions are incapable of combating a number of security threats, e.g., jamming attacks. To address this issue, physical-layer security has been recommended as a complementary solution in the literature. In this thesis, physical layer attacks of the cooperative communication systems are studied, and corresponding security techniques including cooperative jamming, beamforming and diversity approaches are investigated. In addition, a novel security solution for a two-hop decode-and-forward relaying system is presented where the transmitters insert a random phase shift to the modulated data of each hop. The random phase shift is created based on a shared secret among communicating entities. Thus, the injected phase shift confuses the eavesdropper and secrecy capacity improves. Furthermore, a cooperative jamming strategy for multi-hop decode-and-forward relaying systems is presented where multiple non-colluding illegitimate nodes can overhear the communication. The jamming signal is created by the transmitter of each hop while being sent with the primary signal. The jamming signal is known at the intended receiver as it is according to a secret common knowledge between the communicating entities. Hence, artificial noise misleads the eavesdroppers, and decreases their signal-to-noise-ratio. As a result, secrecy capacity of the system is improved. Finally, power allocation among friendly jamming and main signal is proposed to ensure that suggested scheme enhances secrecy

A Simple Cooperative Diversity Method Based on Network Path Selection

Cooperative diversity has been recently proposed as a way to form virtual antenna arrays that provide dramatic gains in slow fading wireless environments. However most of the proposed solutions require distributed space-time coding algorithms, the careful design of which is left for future investigation if there is more than one cooperative relay. We propose a novel scheme, that alleviates these problems and provides diversity gains on the order of the number of relays in the network. Our scheme first selects the best relay from a set of M available relays and then uses this best relay for cooperation between the source and the destination. We develop and analyze a distributed method to select the best relay that requires no topology information and is based on local measurements of the instantaneous channel conditions. This method also requires no explicit communication among the relays. The success (or failure) to select the best available path depends on the statistics of the wireless channel, and a methodology to evaluate performance for any kind of wireless channel statistics, is provided. Information theoretic analysis of outage probability shows that our scheme achieves the same diversity-multiplexing tradeoff as achieved by more complex protocols, where coordination and distributed space-time coding for M nodes is required, such as those proposed in [7]. The simplicity of the technique, allows for immediate implementation in existing radio hardware and its adoption could provide for improved flexibility, reliability and efficiency in future 4G wireless systems.Comment: To appear, IEEE JSAC, special issue on 4

Cooperative Symbol-Based Signaling for Networks with Multiple Relays

Wireless channels suffer from severe inherent impairments and hence reliable and high data rate wireless transmission is particularly challenging to achieve. Fortunately, using multiple antennae improves performance in wireless transmission by providing space diversity, spatial multiplexing, and power gains. However, in wireless ad-hoc networks multiple antennae may not be acceptable due to limitations in size, cost, and hardware complexity. As a result, cooperative relaying strategies have attracted considerable attention because of their abilities to take advantage of multi-antenna by using multiple single-antenna relays. This study is to explore cooperative signaling for different relay networks, such as multi-hop relay networks formed by multiple single-antenna relays and multi-stage relay networks formed by multiple relaying stages with each stage holding several single-antenna relays. The main contribution of this study is the development of a new relaying scheme for networks using symbol-level modulation, such as binary phase shift keying (BPSK) and quadrature phase shift keying (QPSK). We also analyze effects of this newly developed scheme when it is used with space-time coding in a multi-stage relay network. Simulation results demonstrate that the new scheme outperforms previously proposed schemes: amplify-and-forward (AF) scheme and decode-and-forward (DF) scheme

Slepian-Wolf Coding Over Cooperative Relay Networks

This paper deals with the problem of multicasting a set of discrete memoryless correlated sources (DMCS) over a cooperative relay network. Necessary conditions with cut-set interpretation are presented. A \emph{Joint source-Wyner-Ziv encoding/sliding window decoding} scheme is proposed, in which decoding at each receiver is done with respect to an ordered partition of other nodes. For each ordered partition a set of feasibility constraints is derived. Then, utilizing the sub-modular property of the entropy function and a novel geometrical approach, the results of different ordered partitions are consolidated, which lead to sufficient conditions for our problem. The proposed scheme achieves operational separation between source coding and channel coding. It is shown that sufficient conditions are indeed necessary conditions in two special cooperative networks, namely, Aref network and finite-field deterministic network. Also, in Gaussian cooperative networks, it is shown that reliable transmission of all DMCS whose Slepian-Wolf region intersects the cut-set bound region within a constant number of bits, is feasible. In particular, all results of the paper are specialized to obtain an achievable rate region for cooperative relay networks which includes relay networks and two-way relay networks.Comment: IEEE Transactions on Information Theory, accepte

Cooperative network-coding system for wireless sensor networks

Describes a cooperative network coding system for wireless sensor networks. In this paper, we propose two practical power) and bandwidth)efficient systems based on amplify)and)forward (AF) and decode)and)forward (DF) schemes to address the problem of information exchange via a relay. The key idea is to channel encode each source’s message by using a high)performance non)binary turbo code based on Partial Unit Memory (PUM) codes to enhance the bit)error)rate performance, then reduce the energy consumption and increase spectrum efficiency by using network coding (NC) to combine individual nodes’ messages at the relay before forwarding to the destination. Two simple and low complexity physical layer NC schemes are proposed based on combinations of received source messages at the relay. We also present the theoretical limits and numerical analysis of the proposed schemes. Simulation results under Additive White Gaussian Noise, confirm that the proposed schemes achieve significant bandwidth savings and fewer transmissions over the benchmark systems which do not resort to NC. Theoretical limits for capacity and Signal to Noise Ratio behaviour for the proposed schemes are derived. The paper also proposes a cooperative strategy that is useful when insufficient combined messages are received at a node to recover the desired source messages, thus enabling the system to retrieve all packets with significantly fewer retransmission request messages

STiCMAC: A MAC Protocol for Robust Space-Time Coding in Cooperative Wireless LANs

Relay-assisted cooperative wireless communication has been shown to have significant performance gains over the legacy direct transmission scheme. Compared with single relay based cooperation schemes, utilizing multiple relays further improves the reliability and rate of transmissions. Distributed space-time coding (DSTC), as one of the schemes to utilize multiple relays, requires tight coordination between relays and does not perform well in a distributed environment with mobility. In this paper, a cooperative medium access control (MAC) layer protocol, called \emph{STiCMAC}, is designed to allow multiple relays to transmit at the same time in an IEEE 802.11 network. The transmission is based on a novel DSTC scheme called \emph{randomized distributed space-time coding} (\emph{R-DSTC}), which requires minimum coordination. Unlike conventional cooperation schemes that pick nodes with good links, \emph{STiCMAC} picks a \emph{transmission mode} that could most improve the end-to-end data rate. Any station that correctly receives from the source can act as a relay and participate in forwarding. The MAC protocol is implemented in a fully decentralized manner and is able to opportunistically recruit relays on the fly, thus making it \emph{robust} to channel variations and user mobility. Simulation results show that the network capacity and delay performance are greatly improved, especially in a mobile environment.Comment: This paper is a revised version of a paper with the same name submitted to IEEE Transaction on Wireless Communications. STiCMAC protocol with RTS/CTS turned off is presented in the appendix of this draf