DMCA
Amplify-and-Forward Relay Beamforming for Secrecy with Cooperative Jamming and Imperfect CSI
| Citations: | 1 - 0 self |
BibTeX
@MISC{Vishwakarma_amplify-and-forwardrelay,
author = {Sanjay Vishwakarma and A. Chockalingam},
title = {Amplify-and-Forward Relay Beamforming for Secrecy with Cooperative Jamming and Imperfect CSI},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract—In this paper, we compute worst case secrecy rates in amplify-and-forward (AF) relay beamforming with cooper-ative jamming (CJ) in the presence of imperfect channel state information (CSI). A source-destination pair aided by M relays is considered. Number of eavesdroppers J can be more than the number of relays. Out of the M relays, k1 relays (1 ≤ k1 ≤ M) act as data relays and the remaining k2 = M − k1 relays act as jamming relays. Data relays aid the communication by relaying data in AF mode, and jamming relays cooperate by transmitting jamming signals (artificial noise). The jamming signals are created such that they degrade the eavesdroppers ’ channels but do not significantly affect the intended receiver’s channel, thereby improving secrecy rate. Imperfection in the CSI is modeled using a norm-bounded error model. We solve for the optimum (k1, k2) and the weights of data relays and jamming relays that maximize the secrecy rate subject to a total relay power constraint. We relax the rank-one constraint on the complex semi-definite data relays and jamming relays weight matrices and reformulate the optimization problem into a form that can be solved using convex semi-definite programming. Numerical results on the secrecy rate that illustrate the effect of cooperative jamming, imperfect CSI, and number of eavesdroppers are presented.
Keyphrases
cooperative jamming imperfect csi amplify-and-forward relay beamforming data relay jamming signal secrecy rate numerical result secrecy rate subject norm-bounded error model rank-one constraint receiver channel cooper-ative jamming source-destination pair total relay power constraint relay cooperate complex semi-definite data relay jamming relay imperfect channel state information optimization problem k1 relay artificial noise worst case secrecy rate eavesdropper channel k2 k1 af mode convex semi-definite programming
