Title :
Optimal cooperative jamming for security
Author :
Chiang, Han-Ting ; Lehnert, James S.
Author_Institution :
Sch. of Electr. & Comput. Eng., Purdue Univ., West Lafayette, IN, USA
Abstract :
In this paper, based on a cooperative jamming scheme, the design of the optimal covariance matrix of the artificial noise produced by a helper that maximizes the secret rate between a source and legitimate destination pair in the presence of multiple eavesdroppers is addressed. It is shown that the original nonconvex design problem can be transformed into a sequence of convex optimization problems. The rank property of the optimal covariance matrix is investigated. In the presence of multiple eavesdroppers, the optimality of beamforming is established. Further, in the presence of two eavesdroppers, it is shown that generally the zero-forcing solution does not maximize the secret rate. Finally, the robust design under imperfect channel state information is considered.
Keywords :
array signal processing; convex programming; cooperative communication; covariance matrices; jamming; telecommunication security; beamforming; convex optimization problem; destination pair; eavesdroppers; imperfect channel state information; nonconvex design problem; optimal cooperative jamming; optimal covariance matrix; secret rate; security; zero-forcing solution; Antennas; Convex functions; Covariance matrix; Jamming; Noise; Security; System analysis and design; Artificial noise; cooperative jamming; secrecy;
Conference_Titel :
MILITARY COMMUNICATIONS CONFERENCE, 2011 - MILCOM 2011
Conference_Location :
Baltimore, MD
Print_ISBN :
978-1-4673-0079-7
DOI :
10.1109/MILCOM.2011.6127474