Secure robust relay beamforming: a convex conic approximation approach

• Published in: IET communications Vol. 10; no. 10; pp. 1138 - 1150
• Main Authors: Maleki Sadr, Mohammad Amin, Ahmadian-Attari, Mahmoud
• Format: Journal Article
• Language: English
• Published: The Institution of Engineering and Technology 01.07.2016
• Subjects: approximation theory; array signal processing; Beamforming; channel state information; Channels; convex conic approximation approach; convex optimisation problem; convex programming; Exact solutions; interior point methods; Mathematical analysis; Networks; nondeterministic polynomial complete problem; novel stochastic methods; Optimization; outage probability; Outages; peer‐to‐peer networks; probabilistic secrecy rate; probability; Relay; relay networks (telecommunication); secure robust relay beamforming; wiretap CSI; approximation theory; peer-to-peer networks; convex optimisation problem; probability; wiretap CSI; secure robust relay beamforming; channel state information; convex programming; novel stochastic methods; probabilistic secrecy rate; interior point methods; convex conic approximation approach; outage probability; nondeterministic polynomial complete problem; relay networks (telecommunication); array signal processing
• ISSN: 1751-8628; 1751-8636
• DOI: 10.1049/iet-com.2015.0762

In this study, the problem of secure robust relay beamforming for peer-to-peer networks in the presence of eavesdroppers has been optimised and relaxed by assuming the imperfect knowledge of eavesdroppers’ channel state information (CSI). Since the wiretap CSI is imperfect at its legitimate transmitter and receiver, it is a critical issue to make the optimisation problem robust against the channel uncertainty. The authors’ optimisation problem aims to maximise the probabilistic secrecy rate that is subject to keeping the probability of the transmission power of the relays below a specific threshold. The problem is shown to be non-convex in its original form since the outage probability constraint does not admit a closed-form expression and it is a non-deterministic polynomial complete problem. They have presented three novel stochastic methods to handle the outage probability constraint. It has been shown that after some relaxation and randomisation, the problem can be represented as a convex optimisation problem which can be efficiently solved using interior point methods. Simulation results have been presented to verify the advantages of their methods.