Open AccessLow‐complexity robust relay optimisation for multiple peer‐to‐peer beamforming: a safe tractable approximation approach
Author(s) -
Maleki Sadr Mohammad Amin,
AhmadianAttari Mahmoud,
Mahboobi Behrad
Publication year - 2015
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.2014.1043
Subject(s) - beamforming , relay , robustness (evolution) , mathematical optimization , computer science , probabilistic logic , computational complexity theory , algorithm , mathematics , power (physics) , telecommunications , physics , quantum mechanics , biochemistry , chemistry , artificial intelligence , gene
In this study, the authors present a novel outage‐based approach for distributed multiuser relay beamforming problem which can provide robustness against channel uncertainty. They assume all the channels are subject to Gaussian perturbation. The relay beamforming design is based on stochastic performance optimisation and has been shown to provide an excellent robustness against channel uncertainty. The robust problem aims to minimise the total power transmission of the relays that are subject to the probability of each receiver's signal‐to‐interference noise ratio (SINR) do not fall below a given outage‐probability specification. The underlying goal is to establish approximate probabilistic SINR constrained formulations in the form of convex conic optimisation problem. They show that the aforementioned problem is non‐convex, in general. They develop two novel conservative approximation schemes for handling non‐convex probabilistic constraint. Simulation results show the robustness of the proposed methods significantly improves the existing methods, both in terms of the solution quality and the computational complexity.