Energy Efficient Secure Communication Over Decode-and-Forward Relay Channels

In this paper, we raise the concern on energy-efficient secure communication over a decode-and-forward relay network with potential eavesdroppers. Our objective is maximizing the secure energy efficiency (EE), which is defined as the ratio of secrecy rate to total power, subject to the given individ...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on communications Ročník 63; číslo 3; s. 892 - 905
Hlavní autori: Wang, Dong, Bai, Bo, Chen, Wei, Han, Zhu
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York IEEE 01.03.2015
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
Algorithms
Array signal processing
Channels
Combinatorial analysis
difference of convex functions programming
dual decomposition
Energy management
fractional programming
Integer programming
Linear programming
Mathematical analysis
Optimization
Physical layer security
power control
Programming
Relay
relay networks
Relay networks (telecommunications)
secure energy efficiency
Security
fractional programming
dual decomposition
Physical layer security
relay networks
secure energy efficiency (EE)
power control
difference of convex functions programming
ISSN:0090-6778, 1558-0857
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In this paper, we raise the concern on energy-efficient secure communication over a decode-and-forward relay network with potential eavesdroppers. Our objective is maximizing the secure energy efficiency (EE), which is defined as the ratio of secrecy rate to total power, subject to the given individual power, relay decoding rate, and target secrecy rate constraints. The problem is formulated as a unified mixed integer nonlinear optimization adapting to different assumptions of channel state information (CSI). To deal with this combinatorial optimization, a suboptimal solution scheme is developed upon some mathematical methods as decoupling of mixed integer programming, fractional programming, dual decomposition, and difference of convex functions programming. The core of the scheme is to transform the primal problem into simple subproblems step by step, and then convex programming can be exploited finally. The proposed scheme for the case with statistical eavesdropper's CSI, may be conditionally extended to the scenario with full CSI in which a local optimal solution may be obtained in certain cases. Finally, the performance and achievable secure EE of the proposed algorithm are demonstrated by simulations where the tradeoff between secure EE and secrecy rate is also revealed.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2014.2387342