ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Sum Secrecy Rate in Multicarrier DF Relay Beamforming

Vishwakarma, Sanjay and Chockalingam, A (2014) Sum Secrecy Rate in Multicarrier DF Relay Beamforming. In: International Conference on Signal Processing and Communications (SPCOM), JUL 22-25, 2014, Banaglore, INDIA.

[img] PDF
2014_INT_CON_SIG_PRO_COM_2014.pdf - Published Version
Restricted to Registered users only

Download (227kB) | Request a copy


In this paper, we study sum secrecy rate in multicarrier decode-and-forward relay beamforming. We obtain the optimal source power and relay weights on each subcarrier which maximize the sum secrecy rate. For a given total power on a given subcarrier k, P-0(k), we reformulate the optimization problem by relaxing the rank-1 constraint on the complex positive semidefinite relay weight matrix, and solve using semidefinite programming. We analytically prove that the solution to the relaxed optimization problem is indeed rank 1. We show that the subcarrier secrecy rate, R-s (P-0(k)), is a concave function in total power P-0(k) if R-s (P-0(k)) > 0 for any P-0(k) > 0. Numerical results show that the sum secrecy rate with optimal power allocation across subcarriers is more than the sum secrecy rate with equal power allocation. We also propose a low complexity suboptimal power allocation scheme which outperforms equal power allocation scheme.

Item Type: Conference Proceedings
Publisher: IEEE
Additional Information: Copy right of this article belongs to the IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA
Keywords: Cooperative relaying; physical layer security; sum secrecy rate; multicarrier; multiple eavesdroppers; semi-definite programming
Department/Centre: Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited: 30 Dec 2015 06:08
Last Modified: 30 Dec 2015 06:08
URI: http://eprints.iisc.ac.in/id/eprint/52985

Actions (login required)

View Item View Item