Abstract
This paper studies robust transmit design for secure AF relay networks with imperfect channel state information (CSI). Two CSI error models, deterministically bounded error model and stochastic error model, are considered. In order to use the power at relays more efficiently, a joint cooperative relaying and jamming scheme is considered, where relays cooperate to forward the source signal and simultaneously they cooperate to send jamming signals to confuse the eavesdroppers. In this joint cooperative relaying and jamming framework, we address the robust joint optimization of the relay weights and the input covariance matrix of jamming signals for secrecy rate maximization (SRM), under both total and individual relay power constraints. Specifically, for the case of deterministically bounded error model, where the CSI error can be specified by an uncertainty set, we maximize the worst-case secrecy rate. While for the case of stochastic error model, where the probability distribution of the CSI error is Gaussian, we maximize the outage constrained secrecy rate. The challenge of these considered SRM-based optimizations lies in their non-convexity. This paper shows that such SRM-based optimization can be solved in a convex fashion and via solving a sequence of semidefinite programs (SDPs). Numerical results are presented to show the efficacy of the proposed scheme.
Highlights
In the classical three-node wiretap channel, secrecy capacity is typically zero when the source-destination link is weaker than the source-eavesdropper link [1, 2]
When the power budget at relays is large enough, the secrecy rate achieved by the proposed scheme approaches the maximal achievable rate of the SRD link
It can be observed that both the secrecy rate achieved by the proposed scheme and that achieved by the relaying without jamming scheme decline with the increasing number of eavesdroppers
Summary
In the classical three-node wiretap channel, secrecy capacity is typically zero when the source-destination link is weaker than the source-eavesdropper link [1, 2]. 1. Robust joint optimization of the relay weights and the input covariance matrix of jamming signals for secrecy rate maximization (SRM) is addressed, under both total and individual relay power constraints. Robust joint optimization of the relay weights and the input covariance matrix of jamming signals for secrecy rate maximization (SRM) is addressed, under both total and individual relay power constraints The challenge of these SRM-based optimizations lies in their non-convexity. We prove that the optimal relay weights and input covariance matrix of jamming signals in the SRC power minimization problem constitute an optimal solution to our inner problem In this way, we provide a tight convex relaxation of our inner problem. For a given relaying weight vector v and input covariance matrix of jamming signals QJ , the received signal-to-noise (SNR) at the destination and the mth eavesdropper are, respectively, γD.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: EURASIP Journal on Wireless Communications and Networking
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
