z-logo
Premium
Secure transmission for wireless collaborative systems based on second‐order channel statistics
Author(s) -
Yan Lei,
Lu Jihua,
Yang Zhiliang,
Liu Dan
Publication year - 2020
Publication title -
transactions on emerging telecommunications technologies
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.366
H-Index - 47
ISSN - 2161-3915
DOI - 10.1002/ett.4048
Subject(s) - beamforming , semidefinite programming , mathematical optimization , computer science , channel (broadcasting) , relay , wireless , constraint (computer aided design) , optimization problem , bisection method , convex optimization , aggregate (composite) , transmission (telecommunications) , power (physics) , mathematics , regular polygon , telecommunications , physics , geometry , materials science , quantum mechanics , composite material
In this article, we investigate the maximum secrecy rates (SRs) and the optimal beamforming schemes for a collaborative wireless network under uncertain channel levels of available second‐order statistics. Both decode‐and‐forward (DF) and amplify‐and‐forward (AF) strategies under the aggregate and individual power constraints are considered. We have derived the maximum SRs and the optimal beamforming vectors under aforementioned conditions and an efficient cooperation paradigm to provide secrecy in a multirelay environment. A closed‐form maximum SR in the DF scheme under aggregate power constraint is presented. Next, the upper and lower bounds for the maximum SR under aggregate power constraint in the AF scheme is derived. The optimization problem in the AF scheme can be converted into a convex semidefinite programming problem, which is efficiently solved by the bisection method. Moreover, the optimal beamforming weights are also obtained to maximize the SRs under both aggregate and individual relay power constraints. Numerical results are provided to demonstrate the effectiveness of proposed algorithms.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here