This paper aims to improve security performance of data transmission with a mobile eavesdropper in a wireless network. The instantaneous channel state information (CSI) of the mobile eavesdropper is unknown to legitimate users during the communication process. Different from existing work, we intend to reduce power consumption of friendly jamming signals. Motivated by the goal, this work presents a location-based prediction scheme to predict where the eavesdropper will be later and to decide whether a friendly jamming measure should be selected against the eavesdropper. The legitimate users only take the measure when the prediction result shows that there will be a risk during data transmission. According to the proposed method, system power can be saved to a large degree. Particularly, we first derive the expression of the secrecy outage probability and set a secrecy performance target. After providing a Markov mobile model of an eavesdropper, we design a prediction scheme to predict its location, so as to decide whether to employ cooperative jamming or not, and then design a power allocation scheme and a fast suboptimal helper selection method to achieve targeted and efficient cooperative jamming. Finally, numerical simulation results demonstrate the effectiveness of the proposed schemes.
This paper aims to improve security performance of data transmission with a mobile eavesdropper in a wireless network. The instantaneous channel state information (CSI) of the mobile eavesdropper is unknown to legitimate users during the communication process. Different from existing work, we intend to reduce power consumption of friendly jamming signals. Motivated by the goal, this work presents a location-based prediction scheme to predict where the eavesdropper will be later and to decide whether a friendly jamming measure should be selected against the eavesdropper. The legitimate users only take the measure when the prediction result shows that there will be a risk during data transmission. According to the proposed method, system power can be saved to a large degree. Particularly, we first derive the expression of the secrecy outage probability and set a secrecy performance target. After providing a Markov mobile model of an eavesdropper, we design a prediction scheme to predict its location, so as to decide whether to employ cooperative jamming or not, and then design a power allocation scheme and a fast suboptimal helper selection method to achieve targeted and efficient cooperative jamming. Finally, numerical simulation results demonstrate the effectiveness of the proposed schemes.
Considering a wireless social network, we investigate a cooperative jamming scheme based on the space power synthesis with unknown channel state information (CSI) of eavesdroppers. In particular, we provide a multiple jammers-based anti-eavesdropping model and formulate it by a superposition principle of various jamming signals in a free space. Based on the model, we analyze the superimposed effects of jammers with different locations in a fixed area, and then present corresponding jamming schemes to minimize synthetic jamming power at a legitimate receiver but satisfying basic interference in other locations. Furthermore, we also provide power allocation schemes to maximize the worst-case secrecy rate of a legitimate receiver. Numerical simulation results demonstrate that the secrecy performance of our cooperative jamming schemes can satisfy the requirements of secure transmission in a fixed area. Besides, our proposed power allocation schemes can further improve secrecy rate without known exact CSI of eavesdroppers.
Physical layer security has attracted significant attention in the field of wireless communications. The application of artificial noise can reduce the eavesdropping ability of illegal eavesdroppers without affecting legitimate users. However, most current physical layer security schemes only consider static scenarios and do not account for mobility. Some schemes analyze security performance in mobile scenarios with friendly jammers but do not consider the handoff and cooperation of friendly jammers due to mobility. To address this challenge, we propose a scheme for soft-handoff-based cooperative jamming (CJSH) in mobility scenarios. Initially, we consider a common scenario where a base station communicates with a legitimate mobile user, alongside a mobile passive eavesdropper and multiple friendly jammers emitting artificial noise in the circular area covered by the base station’s signal. Next, We measure the connection outage probability (COP) and secrecy outage probability (SOP) under the influence of multiple friendly jammers in the proposed scheme. We also design two corresponding thresholds for jammers to join and exit. To balance security and energy consumption, we define the Power Average Security Gain (PASG) as a measure of system performance. Finally, we provide numerical simulation results to verify the rationality of the proposed handoff scheme, demonstrating its effective improvement of the system’s security performance and power utilization.
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.
In this paper, we investigate the secrecy performance of cooperative wireless communication networks, where a source (Alice) intends to transmit information to a legitimate user (Bob) with an unmanned aerial vehicle (UAV) enabled friendly jammer in the presence of a passive eavesdropper (Eve). In order to maximize the secrecy rate of the system under a certain secrecy outage probability, we design a scheme utilizing artificial-noise (AN) beamforming and cooperative jamming to determine the optimal power allocation factor with only location and statistical channel state information of the Eve. Numerical results validate that the proposed scheme can significantly improve the secrecy rate and secure energy efficiency (EE) performance.
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.
We consider the K-user cellular network coexisting with a single helper node (HN) (or cooperative jammer) whose objective is to enhance the secrecy of the confidential data transmission. Due to the broadcast nature of the wireless medium, the information leakage to the undesired users is unavoidable when the base station (BS) transmits the private information to the intended mobile user (MU). In this paper, the unintended users are regarded as the potential eavesdroppers and called as the internal eavesdroppers. In [1], the proposed optimal transmission strategy for the helper maximizes the secrecy capacity of the intended user. However, its computational complexity geometrically increases as the number of the legitimate users or the network size grows. This property is inappropriate to the cellular network where dozens of users generally exist. To resolve such practical issue, we design the low complexity transmission strategies of the helper which are insensitive to the network size. In addition, as a part of an effort to develop the usability, we classify the helper's cooperation according to whether the helper possesses the channel state information (CSI) about the downlink channel BS → MUkfor k ∈ K = {1, 2, …, K} or not. We analyze the computational complexity of the proposed schemes and verify that their complexity dramatically decreases compared to the optimal transmission strategy in [1]. Also, through the simulation results, it is observed that the proposed transmission strategies provide the comparable secrecy rates to that of the optimal transmission.