Open AccessBeamforming strategies for multi‐antenna relay‐assisted networks
Author(s) -
Mirzaee Meysam,
Akhlaghi Soroush
Publication year - 2016
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2015.0473
Subject(s) - beamforming , computer science , relay , secrecy , constraint (computer aided design) , mathematical optimization , power (physics) , rank (graph theory) , physical layer , computer network , telecommunications , mathematics , wireless , computer security , physics , quantum mechanics , geometry , combinatorics
Physical layer security has received considerable attentions in recent years. Moreover, cooperative communications using some nodes of network as relays make use of the benefit of multi‐antenna systems such as increasing the secrecy capacity. This study studies a communication network incorporating some multi‐input–multi‐output amplify and forward relays in the presence of some eavesdroppers. The objective persuaded in the current work is to find the beamforming matrices at the relays to maximise the achievable secrecy rate under either individual or total power constraint at these nodes. Accordingly, three main approaches including general rank beamforming (GRBF), rank‐1 beamforming (RBF) and null‐space beamforming (NSBF) are developed. For the NSBF under the total power constraint, a closed‐form solution is obtained, while for the remaining scenarios the corresponding optimisation problem is expressed as a semi‐definite programming problem. Numerical results indicate that the RBF and NSBF methods follow GRBF in some cases and degraded from GRBF in the others. However, it is shown that these two methods have much lower complexity than GRBF.