TY - JOUR
T1 - Secure Communications with Cooperative Jamming
T2 - Optimal Power Allocation and Secrecy Outage Analysis
AU - Cumanan, Kanapathippillai
AU - Alexandropoulos, George C.
AU - Ding, Zhiguo
AU - Karagiannidis, George K.
N1 - Funding Information:
Manuscript received March 21, 2016; revised August 8, 2016; accepted December 4, 2016. Date of publication January 24, 2017; date of current version August 11, 2017. The work of K. Cumanan and Z. Ding was supported by H2020-MSCARISE-2015 under Grant 690750. The work of Z. Ding was supported by the Engineering and Physical Sciences Research Council, U.K., under Grant EP/L025272/1. The review of this paper was coordinated by Dr. C. Xing.
Publisher Copyright:
© 2017 IEEE.
PY - 2017/8
Y1 - 2017/8
N2 - 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.
AB - 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.
KW - Convex optimization
KW - Cooperative jamming
KW - physical layer security
KW - secrecy outage analysis
UR - http://www.scopus.com/inward/record.url?scp=85029527429&partnerID=8YFLogxK
U2 - 10.1109/TVT.2017.2657629
DO - 10.1109/TVT.2017.2657629
M3 - Article
AN - SCOPUS:85029527429
SN - 0018-9545
VL - 66
SP - 7495
EP - 7505
JO - IEEE Transactions on Vehicular Technology
JF - IEEE Transactions on Vehicular Technology
IS - 8
M1 - 7831468
ER -