Robust Power Allocation and Outage Analysis for Secrecy in Independent Parallel Gaussian Channels

Abstract

This is the author's version of an article that has been published in IEEE Wireless Communications Letters. Changes were made to this version by the publisher prior to publication. Abstract-This letter studies parallel independent Gaussian channels with uncertain eavesdropper channel state information (CSI). Firstly, we evaluate the probability of zero secrecy rate in this system for (i) given instantaneous channel conditions and (ii) a Rayleigh fading scenario. Secondly, when non-zero secrecy is achievable in the low SNR regime, we aim to solve a robust power allocation problem which minimizes the outage probability at a target secrecy rate. We bound the outage probability and obtain a linear fractional program that takes into account the uncertainty in eavesdropper CSI while allocating power on the parallel channels. Problem structure is exploited to solve this optimization problem efficiently. We find the proposed scheme effective for uncertain eavesdropper CSI in comparison with conventional power allocation schemes.

Probabilistic‐based secrecy rate maximisation for MIMOME wiretap channels: Towards novel convexification procedures

“…Comparison among the methods discovered in the paper from various points of view FIGURE 11 Proposed resource scheduling algorithm: for both first and second approaches Figure 11 powerfully demonstrates the proposed algorithm to apply our procedures. Such algorithm is applicable for Problems  2 and  3 to select the candidates among which the best one is efficiently guaranteed.…”

“…In the previous study by Sarma, the tight bound of the accurately defined outage probability was fixed, specifically achieving a linear fractional programme‐based algorithm. Meanwhile, with the aid of corresponding central chi‐squarely distributed random subsets, the vicinity of noncentral ones was estimated.…”

Secure robust relay beamforming: a convex conic approximation approach

“…The first challenge lies in the lack of a closed-form expression for the first probabilistic constraints which are a type of the quadratic form that consists of the sum of the firstand second-order statistics of complex Gaussian variables [27]. To handle this constraint, we have proposed three different novel inequalities to resort to an approximate solution for the probabilistic constraint in (23). The second challenge emerged from the fact that the rank constraint is non-convex.…”

“…More recently, in [23], Sarma et al have solved a robust power allocation problem which minimises the outage probability at the target secrecy rate. They have bounded the outage probability and obtained a linear fractional programme for allocating the power on the parallel channels.…”

“…This method tried to hold all of the cases that have a high probability. In this respect, in [19][20][21][22][23], the stochastic robust approach for the physical layer security has been studied.…”