The exploitation of user cooperation has been recognized as an important technique to improve the robustness of secure transmissions, where various studies have shown that a careful use of relaying can improve the receptional reliability of the legitimate receivers and decrease eavesdropping capabilities at the same time. In this chapter, a detailed review will be provided to illustrate how to integrate relay transmissions with secrecy communications. Simpler scenarios with single-antenna nodes will be investigated first, where two secure transmission strategies, cooperative jamming and relay chatting, will be focused particularly. Then scenarios with multiple-antenna nodes will be considered, and the design of precoding becomes of interest, where the cases with and without channel information at the transmitters will be discussed separately.
The exploitation of user cooperation has been recognized as an important technique to improve the robustness of secure transmissions, where various studies have shown that a careful use of relaying can improve the receptional reliability of the legitimate receivers and decrease eavesdropping capabilities at the same time. In this chapter, a detailed review will be provided to illustrate how to integrate relay transmissions with secrecy communications. Simpler scenarios with single-antenna nodes will be investigated first, where two secure transmission strategies, cooperative jamming and relay chatting, will be focused particularly. Then scenarios with multiple-antenna nodes will be considered, and the design of precoding becomes of interest, where the cases with and without channel information at the transmitters will be discussed separately.
In cooperative communication, a source communicates with a destination over indirect links through relays. Like most wireless systems, cooperative networks seriously suffer from secrecy related issues. In this thesis, cooperative jamming method is utilized to provide secrecy for cooperative networks in which there exist adversary receivers called eavesdroppers. The main idea is to broadcast noise signals from a selected relay to corrupt the signal-to-interference-plus-noise ratio (SINR) at eavesdroppers when the transmitter communicates with the receiver through another selected relay. Throughout the study, it is assumed that channel state information (CSI) of the links between the source, relays and the destination is available at the transmit and receive sides of links. Rich scattering channels are assumed and all channel gains are taken as independent. In contrast to the past studies in the literature, CSI of eavesdroppers’ channels exist at only themselves since they are accepted as passive devices in this study. The knowledge on channel gains except eavesdroppers’ ones are used to adaptively select the relays to support cooperative jamming. Cooperative jamming is investigated here from an outage probability perspective where probability of secure transmission is the parameter of interest for a fixed transmission rate. First, cooperative jamming is applied to cooperative networks with single-antenna nodes. The probability of secure communication increases to a degree for a range of the communication rate R with cooperative jamming and adaptive selection of relays. The results are generally encouraging, but may be insufficient for real-world cooperative networks. Second, cooperative jamming is implemented at cooperative networks with multiple-antenna nodes to increase the probability of secure communication benefiting from advantages of multiple antennas. Adaptive transmit precoding is applied at the source and the communicating relay to enhance the SINR at legitimate receivers. This advantage brings an edge over eavesdroppers. Moreover, adaptive noise generation is proposed at the noise emitting relays in order to minimize the effect of noise at legitimate receivers. It is shown that the probability of secure communication dramatically rises with these adaptive techniques. As a result, there is a certain transmission rate R at which the source is able to securely communicate with the destination with probability approaching one.
Information theoretic security has recently emerged as an effective physical layer approach to provide secure communications. The outage performance of such a secrecy communication system is considered in this paper, since it is an important criterion to measure whether users' predefined quality of service can be met. Provided that the legitimate receiver and eavesdropper have the same noise power, many existing secure schemes cannot achieve outage probability approaching zero, regardless of how large the transmission power is. By introducing cooperative transmission into secrecy communication systems, it will be shown here that outage probability approaching zero can be achieved. In particular, scenarios with single-antenna nodes and multiple-antenna nodes will both be addressed, and the optimal design of beamforming/precoding will be investigated. Explicit expressions of the achievable outage probability and diversity-multiplexing tradeoff will be developed to demonstrate the performance of the proposed cooperative secure transmission schemes, and numerical results are presented.
In this paper, secrecy communications with cooperative jamming in a two-hop one-way untrusted relay system is studied. Assuming that all nodes are equipped with multiple antennas, new precoding designs are proposed to increase the secrecy capacity. Two situations are considered, namely only designing precoding vector for jamming signal when user signal has been determined, and designing precoding vectors for both user and jamming signals by jointly considering the source node. For each situation, two alignment algorithms are proposed, namely zero-forcing-based (ZF) alignment algorithm and minimum-mean-squared-error-based (MMSE) alignment algorithm. Both algorithms are designed to ensure that the equivalent wiretap channel matrix forms two aligned vectors. The channel vector from the destination node is designed to be aligned with that from the source node, so that the eavesdropping node cannot decode user signals. Analytical and simulation results show that all proposed scheme can achieve secure communication, and the MMSE algorithm performs better than the ZF. In addition, the destination-relay link has greater impact on the secrecy performance than the relay-destination link.
Due to the broadcast nature of wireless communications, it is difficult to shield transmitted signals from adversarial users in the coverage area of the transmission. This chapter highlights many issues concerned with achieving secrecy in the physical layer. It discusses overview of the foundations dating back to the pioneering key-based Shannon and keyless Wyner–Ziv works on information-theoretic security. In 1978, Leung-Yang-Cheong and Hellman considered the Gaussian wiretap channel. The chapter introduces multiformity of cooperative jamming techniques to show the effectiveness of jamming signals transmitted by some legitimate transmitters in a network of multiple transmitters and receivers in achieving physical layer security for a certain legitimate pair. It gives the idea of employing cooperative jammers in a multiple trusted/untrusted relay networks in order to improve security, and the interactions arising between cooperation and secrecy in the presence of untrusted relays are adopted. A resurgence of interest in aspects of secrecy at the physical layer has been experienced.
The growth of wireless networks has been considerable over the last decades. Due to the broadcast nature of these networks, security issues have taken a critical role in today’s communications. A promising direction towards achieving secure communications is information theoretic secrecy, which is an approach exploiting the randomness of the channels to ensure secrecy. Based on this approach, there has been a recent surge of interest in a potential cooperation between users to enhance the secrecy of communications. In this thesis we investigate the interaction between cooperation and secrecy. In particular the contributions of the thesis can be divided into two parts. In the first part, we study cooperative strategies for secrecy for wireless channels. Our goal is to evaluate the effect of fading and limited CSI on the eavesdropper’s channels. In that purpose we consider a scenario where a helper aims at increasing the secrecy of the communication between a source and destination in the presence of an eavesdropper. Several strategies are discussed for the helper, namely decode-and-forward, amplify-and-forward, and cooperative jamming. We introduce the secrecy outage probability, the conditional secrecy outage probability and the secure throughput as secrecy measures. For each measure, we investigate and compare the secrecy performance of cooperation. We furthermore elaborate a system optimization in terms of strategy selection, node positioning, power allocation and rate design. In the second part, we consider cooperation in the 4-node scenario against a more sophisticated adversary: an active eavesdropper, which can either passively eavesdrop, or jam the transmission. A game-theoretic perspective is a natural way to analyze the competitive interaction between the helper and the eavesdropper. Therefore we define several secrecy games, for which we find the Nash and Stackelberg equilibria as well as the corresponding secrecy rate outcomes. Another important consideration in this scenario is the interaction between the source and the helper, which we model and solve as a Stackelberg game, and we illustrate its impact on the achievable secrecy rates.
Motivated by recent developments in wireless communication, this thesis aims to characterize the secrecy performance in several types of typical wireless networks. Advanced techniques are designed and evaluated to enhance physical layer security in these networks with realistic assumptions, such as signal propagation loss, random node distribution and non-instantaneous channel state information (CSI). The first part of the thesis investigates secret communication through relay-assisted cognitive interference channel. The primary and secondary base stations (PBS and SBS) communicate with the primary and secondary receivers (PR and SR) respectively in the presence of multiple eavesdroppers. The SBS is allowed to transmit simultaneously with the PBS over the same spectrum instead of waiting for an idle channel. To improve security, cognitive relays transmit cooperative jamming (CJ) signals to create additional interferences in the direction of the eavesdroppers. Two CJ schemes are proposed to improve the secrecy rate of cognitive interference channels depending on the structure of cooperative relays. In the scheme where the multiple-antenna relay transmits weighted jamming signals, the combined approach of CJ and beamforming is investigated. In the scheme with multiple relays transmitting weighted jamming signals, the combined approach of CJ and relay selection is analyzed. Numerical results show that both these two schemes are effective in improving physical layer security of cognitive interference channel. In the second part, the focus is shifted to physical layer security in a random wireless network where both legitimate and eavesdropping nodes are randomly distributed. Three scenarios are analyzed to investigate the impact of various factors on security. In scenario one, the basic scheme is studied without a protected zone and interference. The probability distribution function (PDF) of channel gain with both fading and path loss has been derived and further applied to derive secrecy connectivity and ergodic secrecy capacity. In the second scenario, we studied using a protected zone surrounding the source node to enhance security where interference is absent. Both the cases that eavesdroppers are aware and unaware of the protected zone boundary are investigated. Based on the above scenarios, further deployment of the protected zones at legitimate receivers is designed to convert detrimental interference into a beneficial factor. Numerical results are investigated to check the reliability of the PDF for reciprocal of channel gain and to analyze the impact of protected zones on secrecy performance. In the third part, physical layer security in the downlink transmission of cellular network is studied. To model the repulsive property of the cellular network planning, we assume that the base stations (BSs) follow the Mat´ern hard-core point process (HCPP), while the eavesdroppers are deployed as an independent Poisson point process (PPP). The distribution function of the distances from a typical point to the nodes of the HCPP is derived. The noise-limited and interference-limited cellular networks are investigated by applying the fractional frequency reuse (FFR) in the system. For the noise-limited network, we derive the secrecy outage probability with two different strategies, i.e. the best BS serve and the nearest BS serve, by analyzing the statistics of channel gains. For the interference-limited network with the nearest BS serve, two transmission schemes are analyzed, i.e., transmission with and without the FFR. Numerical results reveal that both the schemes of transmitting with the best BS and the application of the FFR are beneficial for physical layer security in the downlink cellular networks, while the improvement due