Title :
Optimal jamming with codewords
Author :
Han-Ting Chiang ; Lehnert, James S.
Author_Institution :
Sch. of Electr. & Comput. Eng., Purdue Univ., West Lafayette, IN, USA
fDate :
Oct. 29 2012-Nov. 1 2012
Abstract :
In this paper for a noise forwarding (NF) scheme, the joint design of the optimal covariance matrices of a source´s and a helper´s signals that maximize the secrecy rate is studied. Under general power constraints, it is shown that the non-convex design problem can be converted into a quasi-convex optimization problem composed of convex subproblems. The properties of the optimal covariance matrices are examined. Under the individual power constraint, beamforming is shown to be optimal, and the design problem is reduced to a problem with two real variables. The performances of the NF scheme and the artificial noise (AN) scheme are compared. The design of a hybrid scheme consisting of the NF and AN techniques is also addressed.
Keywords :
convex programming; covariance matrices; jamming; military communication; optimisation; telecommunication security; artificial noise scheme; beamforming; codewords; convex subproblems; noise forwarding scheme; nonconvex design problem; optimal covariance matrices; optimal jamming; quasi-convex optimization problem; secrecy rate; Antennas; Complexity theory; Covariance matrix; Noise; Noise measurement; Optimization; Reliability; Artificial noise; cooperative jamming; noise forwarding; secrecy;
Conference_Titel :
MILITARY COMMUNICATIONS CONFERENCE, 2012 - MILCOM 2012
Conference_Location :
Orlando, FL
Print_ISBN :
978-1-4673-1729-0
DOI :
10.1109/MILCOM.2012.6415873