Vishwakarma, Sanjay ; Chockalingam, A. (2013) Decode-and-forward relay beamforming for secrecy with finite-alphabet input IEEE Communications Letters, 17 (5). pp. 912-915. ISSN 1089-7798
Full text not available from this repository.
Official URL: http://ieeexplore.ieee.org/abstract/document/64969...
Related URL: http://dx.doi.org/10.1109/LCOMM.2013.040213.130082
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 (1/2)log2 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.
Item Type: | Article |
---|---|
Source: | Copyright of this article belongs to Institute of Electrical and Electronics Engineers. |
Keywords: | Semi-definite Programming; Cooperative Relay Beamforming; Physical Layer Security; Multiple Eavesdroppers; Finite-alphabet Input |
ID Code: | 100569 |
Deposited On: | 27 Mar 2017 10:29 |
Last Modified: | 27 Mar 2017 10:29 |
Repository Staff Only: item control page