TY - GEN

T1 - Transmit power minimization under secrecy capacity constraint in cooperative wireless communications

AU - Li, Jiangyuan

AU - Petropulu, A.

AU - Weber, S.

PY - 2009

Y1 - 2009

N2 - We consider a cooperative wireless network, and exploit node cooperation for achieving physical layer based security. The case of one source, multiple cooperating nodes and one eavesdropper is considered. Two different cooperation schemes are considered. In the first scheme, cooperating nodes transmit a weighted version of the source signal in a decode and forward fashion (DF). In the second scheme, while the source is transmitting, cooperating nodes transmit weighted noise to confound the eavesdropper (cooperative jamming (CJ)). The objective is to select the node weights and the source transmit power so that the total transmit power (source transmission power plus cooperating nodes power) under a secrecy capacity constraint is minimized. Previous works related to this problem introduced additional constraints in order to reduce the degree of difficulty, thus resulting in suboptimal solutions. In this paper, the optimal solution is considered. In particular, the closed form solution is obtained for the DF scheme, while for the CJ scheme, the problem is reduced to a univariate optimization one. For the latter problem a convergent algorithm for obtaining the solution is provided.

AB - We consider a cooperative wireless network, and exploit node cooperation for achieving physical layer based security. The case of one source, multiple cooperating nodes and one eavesdropper is considered. Two different cooperation schemes are considered. In the first scheme, cooperating nodes transmit a weighted version of the source signal in a decode and forward fashion (DF). In the second scheme, while the source is transmitting, cooperating nodes transmit weighted noise to confound the eavesdropper (cooperative jamming (CJ)). The objective is to select the node weights and the source transmit power so that the total transmit power (source transmission power plus cooperating nodes power) under a secrecy capacity constraint is minimized. Previous works related to this problem introduced additional constraints in order to reduce the degree of difficulty, thus resulting in suboptimal solutions. In this paper, the optimal solution is considered. In particular, the closed form solution is obtained for the DF scheme, while for the CJ scheme, the problem is reduced to a univariate optimization one. For the latter problem a convergent algorithm for obtaining the solution is provided.

UR - http://www.scopus.com/inward/record.url?scp=72349099617&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=72349099617&partnerID=8YFLogxK

U2 - 10.1109/SSP.2009.5278599

DO - 10.1109/SSP.2009.5278599

M3 - Conference contribution

AN - SCOPUS:72349099617

SN - 9781424427109

T3 - IEEE Workshop on Statistical Signal Processing Proceedings

SP - 217

EP - 220

BT - 2009 IEEE/SP 15th Workshop on Statistical Signal Processing, SSP '09

T2 - 2009 IEEE/SP 15th Workshop on Statistical Signal Processing, SSP '09

Y2 - 31 August 2009 through 3 September 2009

ER -