We analyze the role of jamming as a means to increase the security of wireless systems. Specifically, we characterize the impact of cooperative/friendly jamming on the secrecy outage probability of a quasi-static wiretap fading channel. We introduce jamming coverage and jamming efficiency as security metrics, and evaluate the performance of three different jamming strategies that rely on various levels of channel state information. The analysis provides insight for the design of optimal jamming configurations and indicates that one jammer is not enough to maximize both metrics simultaneously.
We analyze the role of jamming as a means to increase the security of wireless systems. Specifically, we characterize the impact of cooperative/friendly jamming on the secrecy outage probability of a quasi-static wiretap fading channel. We introduce jamming coverage and jamming efficiency as security metrics, and evaluate the performance of three different jamming strategies that rely on various levels of channel state information. The analysis provides insight for the design of optimal jamming configurations and indicates that one jammer is not enough to maximize both metrics simultaneously.
Inspired by recent results on information-theoretic security, we consider the transmission of confidential messages over wireless networks, in which the legitimate communication partners are aided by friendly jammers. We characterize the security level of a confined region in a quasi-static fading environment by computing the probability of secrecy outage in connection with two new measures of physical-layer security: the jamming coverage and the jamming efficiency. Our analysis for various jamming strategies based on different levels of channel state information provides insight into the design of optimal jamming configurations and shows that a single jammer is not sufficient to maximize both figures of merit simultaneously. Moreover, a single jammer requires full channel state information to provide security gains in the vicinity of the legitimate receiver.
A cooperative jamming system is investigated to enhance security of wireless communications in the presence of eavesdroppers. Different from traditional wireless security strategies that maximize secrecy capacity, a novel strategy based on the minimization of compromised secrecy region (CSR) is proposed. The secrecy region with a given secrecy outage probability is derived by considering path-loss and fading channel effects. Through numerical approximation of the outage probability, the optimal location and allocated power of the jammer are calculated to minimize the CSR which exhibits high secrecy outage probability. Without knowing the exact location of the randomly-distributed eavesdropper, our proposed scheme provides a new optimization criterion based on this compromised area minimization, thereby increasing the security level in cooperative jamming systems. Numerical results further validate the proposed CSR minimization scheme for cooperative jamming.
Theoretical studies on physical layer security often adopt the secrecy outage probability as the performance metric for wireless communications over quasi-static fading channels. The secrecy outage probability has two limitations from a practical point of view: 1) it does not give any insight into the eavesdropper's decodability of confidential messages and 2) it cannot characterize the amount of information leakage to the eavesdropper when an outage occurs. Motivated by the limitations of the secrecy outage probability, we propose three new secrecy metrics for secure transmissions over quasi-static fading channels. The first metric establishes a link between the concept of secrecy outage and the decodability of messages at the eavesdropper. The second metric provides an error-probability-based secrecy metric which is typically used for the practical implementation of secure wireless systems. The third metric characterizes how much or how fast the confidential information is leaked to the eavesdropper. We show that the proposed secrecy metrics collectively give a more comprehensive understanding of physical layer security over fading channels and enable one to appropriately design secure communication systems with different views on how secrecy is measured.
In 5G and beyond networks, Unmanned Aerial Vehicles (UAV) are an attractive solution to enhance the secrecy of a wireless systems by exploiting their predominant LOS links and spacial manoeuvrability to introduce a friendly jamming. In this work, we investigate the impact of two cooperative UAV-based jammers on the secrecy performance of a ground wireless wiretap channel by considering secrecy-area related metrics, the jamming coverage and jamming efficiency. Moreover, we propose a hybrid metric, the so-called Weighted Secrecy Coverage (WSC) that can be used as a metric for gaining insights on the optimal deployments of the UAV jammers to provide the best exploration of jamming signals. For evaluating these metrics, we derive a closed-form position-based metric, the secrecy improvement, and propose an analogous computationally simpler metric. Our simulations show that a balanced power allocation between the two UAVs leads to the best performances, as well as a symmetrical positioning behind the line of sight between the legitimate transmitter and receiver. Moreover, there exist an optimal UAV height for the jammers. Finally, we propose a suboptimal and simpler problem for the maximisation of the WSC.
This paper investigates cooperative security in wireless networks, where a source (Alice) intends to transmit a confidential message to a legitimate destination (Bob), with the help of a cooperative jammer (Charlie), coexisting with multiple passive eavesdroppers (Eves). In particular, by assuming knowledge of Bob's perfect channel state information (CSI) but only Eves’ statistical CSIs, secrecy beamforming with artificial noise (AN) is utilized for secure transmission, and cooperative jamming (CJ) is explored to further enhance secrecy. We first derive an accurate closed-form expression for the secrecy outage probability (SOP), and establish the condition under which positive secrecy rate is achievable. Then, we provide a secure transmit design for maximizing the SOP constrained secrecy rate. Moreover, based on a strict mathematical analysis, we characterize the impact of the main channel quality and the number of Eves on transmit design and secrecy performance. Specifically, optimal power allocation ratio between the information-bearing signal and the AN signal increases as the main channel quality improves, and decreases with the number of Eves. Numerical results confirm that our design achieves performance improvement in terms of both secrecy rate and secure energy efficiency, as compared to the approach without CJ.
This paper studies the secrecy rate maximization problem of a secure wireless communication system in the presence of multiple eavesdroppers. The security of the communication link is enhanced through cooperative jamming with the help of multiple jammers. First, a feasibility condition is derived to achieve a positive secrecy rate at the destination. Then, we solve the original secrecy rate maximization problem, which is not convex in terms of power allocation at the jammers. To circumvent this nonconvexity, the achievable secrecy rate is approximated for a given power allocation at the jammers, and the approximated problem is formulated into a geometric programming one. Based on this approximation, an iterative algorithm has been developed to obtain the optimal power allocation at the jammers. Next, we provide a bisection approach, based on 1-D search, to validate the optimality of the proposed algorithm. In addition, by assuming Rayleigh fading, the secrecy outage probability (SOP) of the proposed cooperative jamming scheme is analyzed. More specifically, a single-integral form expression for the SOP is derived for the most general case, as well as a closed-form expression for the special case of two cooperative jammers and one eavesdropper. Simulation results have been provided to validate the convergence and the optimality of the proposed algorithm, as well as the theoretical derivations of the presented SOP analysis.