Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE/CIC International Conference on Communications in China (ICCC)

Artificial-noise-aided communication in the presence of an active eavesdropper with a cooperative jammer

Zunning Liu, Na Li, Si Li, Haowei Wang, Jin Xu, Xiaofeng Tao

Published Oct 1, 2017• 2 citations
Publisher

Abstract

In this paper, we investigate the performance of artificial noise (AN) assisted secure communication in the presence of an active eavesdropper, who selects a jammer to assist eavesdropping. An approximate closed-form expression for the secrecy rate is derived firstly. Then we consider the practical scenario where Alice aims to allocate considerable power to the AN under the target Quality of Service (QoS) of the legitimate link. While Eve tries to compel Alice to reduce the AN by selecting an optimal helper to transmit jamming signals to Bob. To solve the conflict, we formulate a game-theoretic model between Alice and Eve. Nash equilibriums, including the minimum power allocation factor, the jammer's optimal position and jamming power are proved to exist and then analytically derived. An iterative algorithm is also proposed to obtain the optimal solution. Finally, simulation results are provided to verify our analytical results.

DOI
10.1109/iccchina.2017.8330344

Related papers

Artificial-noise-aided secure communication with full-duplex active eavesdropper

Zunning Liu, Na Li, Xiaofeng Tao +3 more

In this paper, we investigate the performance of artificial noise assisted secure communication in the presence of a full-duplex active eavesdropper who can simultaneously perform eavesdropping and jamming. An approximate closed-form expression for the secrecy rate is derived. With this result, we obtain a new result for the optimal power allocation factor maximizing the secrecy rate, and analyze the impact of self-interference coefficient and jamming power on it. We further consider a more practical scenario where the legitimate user aims to maintain a given target data rate and uses all remaining power for artificial noise (AN) to interfere with the eavesdropper. While the eavesdropper tries to compel the transmitter to reduce the AN by sending jamming signals to the legitimate receiver. To solve this conflict, we introduce a power cost parameter to describe the impact of jamming on the eavesdropper itself and then formulate a game-theoretic framework. We also derive the closed-form equilibrium solutions for both sides. These results show the optimal jamming strategy of the eavesdropper and provide insights into the low bound secrecy performance. Finally, simulation results are provided to verify our analytical results.

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)•Oct 1, 2017•9 citations

Cooperative-Jamming-Aided Secrecy Enhancement in Wireless Networks With Passive Eavesdroppers

Lin Hu, Hong Wen, Bin Wu +3 more

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.

IEEE Transactions on Vehicular Technology•Aug 25, 2017•78 citations

Secure Transmission with a Cooperative UAV-enabled Jammer

Yang Chen, Zhongpei Zhang, Binrui Li

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.

IEEE International Conference on Computer and Communications (ICCC)•Dec 1, 2019•2 citations

Secure Cooperative Transmission With Imperfect Channel State Information Based on BPNN

Huanhuan Song, Hong Wen, Lin Hu +3 more

In this paper, we study a secure cooperative transmission system in which a transmitter (Alice) intends to send a secret message to an authorized receiver (Bob), with the aid of a friendly private cooperative jammer (Oscar), in the presence of a malicious eavesdropper (Eve). Specifically, artificial noise (AN) assisted secrecy beamforming is utilized for secure transmission. Under the imperfect channel state information (CSI) of legitimate channels and the statistic CSI of illegitimate channels, the optimal power allocation ratio between the information-bearing signal and the AN signal for maximizing secrecy rate is derived. Through mathematical analysis, we notice that the high channel estimation error is greatly detrimental to the realization of the positive secrecy rate in secure system. For overcoming this drawback, back propagation neural network (BPNN) is employed for a high accuracy channel estimation to simulate a realistic security communication scenario. The numerical results show that the channel estimation errors result in a decrease in secrecy rate, but the BPNN channel estimator still can guarantee secure transmission that verifies the feasibility of the application of physical layer security. Analytical derivations and numerical simulations are presented to validate the correctness of obtained expressions and our analysis.

IEEE Transactions on Vehicular Technology•Jun 21, 2018•38 citations

Outage constrained secrecy rate maximization using artificial-noise aided beamforming and cooperative jamming

Lin Hu, Bin Wu, Jie Tang +2 more

In this paper, we consider physical layer security in wireless communication networks in which a source (Alice) intends to send a confidential message to a legitimate destination (Bob) with the help of a cooperative jammer (CJ), in the presence of a passive eavesdropper (Eve). Assuming that only statistical channel state information (CSI) of Eve is available, artificial-noise (AN) assisted beamforming and cooperative jamming are designed. The goal is to maximize the secrecy rate, subject to a constraint on secrecy outage probability. Numerical results validate the effectiveness of our scheme. Moreover, a higher secure energy efficiency (EE) can be achieved as compared with other schemes without a cooperative jammer.

International Conference on Communications•May 1, 2016•40 citations

Secure Communications With Cooperative Jamming: Optimal Power Allocation and Secrecy Outage Analysis

Kanapathippillai Cumanan, George C. Alexandropoulos, Zhiguo Ding +1 more

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.

arXiv:1701.03383•IEEE Transactions on Vehicular Technology•Jan 24, 2017•91 citations
In this paper, we investigate the performance of artificial noise (AN) assisted secure communication in the presence of an active eavesdropper, who selects a jammer to assist eavesdropping. An approximate closed-form expression for the secrecy rate is derived firstly. Then we consider the practical scenario where Alice aims to allocate considerable power to the AN under the target Quality of Service (QoS) of the legitimate link. While Eve tries to compel Alice to reduce the AN by selecting an optimal helper to transmit jamming signals to Bob. To solve the conflict, we formulate a game-theoretic model between Alice and Eve. Nash equilibriums, including the minimum power allocation factor, the jammer's optimal position and jamming power are proved to exist and then analytically derived. An iterative algorithm is also proposed to obtain the optimal solution. Finally, simulation results are provided to verify our analytical results.
In this paper, we investigate the performance of artificial noise assisted secure communication in the presence of a full-duplex active eavesdropper who can simultaneously perform eavesdropping and jamming. An approximate closed-form expression for the secrecy rate is derived. With this result, we obtain a new result for the optimal power allocation factor maximizing the secrecy rate, and analyze the impact of self-interference coefficient and jamming power on it. We further consider a more practical scenario where the legitimate user aims to maintain a given target data rate and uses all remaining power for artificial noise (AN) to interfere with the eavesdropper. While the eavesdropper tries to compel the transmitter to reduce the AN by sending jamming signals to the legitimate receiver. To solve this conflict, we introduce a power cost parameter to describe the impact of jamming on the eavesdropper itself and then formulate a game-theoretic framework. We also derive the closed-form equilibrium solutions for both sides. These results show the optimal jamming strategy of the eavesdropper and provide insights into the low bound secrecy performance. Finally, simulation results are provided to verify our analytical results.
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.
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.
In this paper, we study a secure cooperative transmission system in which a transmitter (Alice) intends to send a secret message to an authorized receiver (Bob), with the aid of a friendly private cooperative jammer (Oscar), in the presence of a malicious eavesdropper (Eve). Specifically, artificial noise (AN) assisted secrecy beamforming is utilized for secure transmission. Under the imperfect channel state information (CSI) of legitimate channels and the statistic CSI of illegitimate channels, the optimal power allocation ratio between the information-bearing signal and the AN signal for maximizing secrecy rate is derived. Through mathematical analysis, we notice that the high channel estimation error is greatly detrimental to the realization of the positive secrecy rate in secure system. For overcoming this drawback, back propagation neural network (BPNN) is employed for a high accuracy channel estimation to simulate a realistic security communication scenario. The numerical results show that the channel estimation errors result in a decrease in secrecy rate, but the BPNN channel estimator still can guarantee secure transmission that verifies the feasibility of the application of physical layer security. Analytical derivations and numerical simulations are presented to validate the correctness of obtained expressions and our analysis.
In this paper, we consider physical layer security in wireless communication networks in which a source (Alice) intends to send a confidential message to a legitimate destination (Bob) with the help of a cooperative jammer (CJ), in the presence of a passive eavesdropper (Eve). Assuming that only statistical channel state information (CSI) of Eve is available, artificial-noise (AN) assisted beamforming and cooperative jamming are designed. The goal is to maximize the secrecy rate, subject to a constraint on secrecy outage probability. Numerical results validate the effectiveness of our scheme. Moreover, a higher secure energy efficiency (EE) can be achieved as compared with other schemes without a cooperative jammer.
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.