Conference proceeding
Secrecy rate optimization under cooperation with perfect channel state information
2009 Conference Record of the Forty-Third Asilomar Conference on Signals, Systems and Computers, pp 824-828
Nov 2009
Abstract
We investigate the problem of optimizing the secrecy rate of a link between a single source and a single destination in the presence of multiple relays and multiple eavesdroppers. Multiple relays assist the source by either retransmitting a weighted version of the source signal in a decode-and-forward (DF) fashion, or by performing cooperative jamming (CJ) i.e., transmitting weighted noise in order to confound the eavesdropper. In each protocol, the relay weights are designed to maximize the secrecy rate subject to a total power constraint. For the case of a single eavesdropper we obtain expressions for the optimal weights under both protocols in closed form, or propose the algorithms to research for the solution. For the DF protocol with multiple eavesdroppers we propose an algorithm to search for the solution. Numerical results illustrate that cooperation can significantly improve the system performance as compared to direct transmission.
Metrics
11 Record Views
17 citations in Scopus
Details
- Title
- Secrecy rate optimization under cooperation with perfect channel state information
- Creators
- Jiangyuan Li - Drexel UniversityAthina P Petropulu - Drexel UniversitySteven Weber - Drexel UniversityJingjing Li - Urban Health Collaborative (2015-)
- Publication Details
- 2009 Conference Record of the Forty-Third Asilomar Conference on Signals, Systems and Computers, pp 824-828
- Publisher
- IEEE
- Resource Type
- Conference proceeding
- Language
- English
- Academic Unit
- Electrical and Computer Engineering; Urban Health Collaborative
- Scopus ID
- 2-s2.0-77953844596
- Other Identifier
- 991019173584504721