Title :
Decode-and-Forward Relay Beamforming for Secrecy with Finite-Alphabet Input
Author :
Vishwakarma, Sanjay ; Chockalingam, A.
Author_Institution :
Dept. of Electr. Commun. Eng., Inst. of Sci., Bangalore, India
Abstract :
In this letter, we compute the secrecy rate of decode-and-forward (DF) relay beamforming with finite input alphabet of size M. Source and relays operate under a total power constraint. First, we observe that the secrecy rate with finite-alphabet input can go to zero as the total power increases, when we use the source power and the relay weights obtained assuming Gaussian input. This is because the capacity of an eavesdropper can approach the finite-alphabet capacity of frac{1}{2}log_2 M with increasing total power, due to the inability to completely null in the direction of the eavesdropper. We then propose a transmit power control scheme where the optimum source power and relay weights are obtained by carrying out transmit power (source power plus relay power) control on DF with Gaussian input using semi-definite programming, and then obtaining the corresponding source power and relay weights which maximize the secrecy rate for DF with finite-alphabet input. The proposed power control scheme is shown to achieve increasing secrecy rates with increasing total power with a saturation behavior at high total powers.
Keywords :
Gaussian processes; decode and forward communication; power control; relay networks (telecommunication); telecommunication control; telecommunication security; DF; Gaussian input; decode-and-forward relay beamforming; eavesdropper; finite-alphabet capacity; finite-alphabet input; optimum source power; power control scheme; relay weights; saturation behavior; secrecy rate; semidefinite programming; Array signal processing; Information rates; Phase locked loops; Power control; Radio frequency; Relays; Security; Cooperative relay beamforming; finite-alphabet input; multiple eavesdroppers; physical layer security; semi-definite programming;
Journal_Title :
Communications Letters, IEEE
DOI :
10.1109/LCOMM.2013.040213.130082