Beam Domain Secure Transmission for Massive MIMO Communications

Abstract

We investigate the optimality and power allocation algorithm of beam domain transmission for single-cell massive multiple-input multiple-output (MIMO) systems with a multiantenna passive eavesdropper. Focusing on the secure massive MIMO downlink transmission with only statistical channel state information of legitimate users and the eavesdropper at base station, we introduce a lower bound on the achievable ergodic secrecy sum-rate, from which we derive the condition for eigenvectors of the optimal input covariance matrices. The result shows that beam domain transmission can achieve optimal performance in terms of secrecy sum-rate lower bound maximization. For the case of single-antenna legitimate users, we prove that it is optimal to allocate no power to the beams where the beam gains of the eavesdropper are stronger than those of legitimate users in order to maximize the secrecy sum-rate lower bound. Then, motivated by the concave-convex procedure and the large dimension random matrix theory, we develop an efficient iterative and convergent algorithm to optimize power allocation in the beam domain. Numerical simulations demonstrate the tightness of the secrecy sum-rate lower bound and the near-optimal performance of the proposed iterative algorithm.Index Terms-Beam domain, massive MIMO, physical layer security, statistical channel state information (CSI), power allocation.

Spectral Efficiency and Energy Efficiency Tradeoff in Massive MIMO Downlink Transmission With Statistical CSIT

“…Then, replacing f k (Λ) with its firstorder Taylor expansion △f k,ub (Λ), the non-concave term K k=1 (g k (Λ) − f k (Λ)) in problem P 3 can be lower-bounded by a concave function. This approximation has been used in some previous works [33], [43], [44], where its effectiveness has also been verified. By doing so, problem P 3 is tackled through solving the following optimization subproblems…”

Energy Efficiency Optimization for Multi-Cell Massive MIMO: Centralized and Distributed Power Allocation Algorithms

“…Under the above assumptions, we calculate the ergodic data rate of UT-(k, u) as in [38], [39], i.e.,…”

“…Specifically, with the precision set to be d digits [46], the required number of iterations for Newton's method is log d [49]. Then, the computational complexity of Algorithm 2 is O(L S U KM (log d + 1)) [39], where L S is the number of iterations in the subgradient method, and K = For the distributed approach where the problem P…”

Direction‐based jamming detection and suppression in mmWave massive MIMO networks

“…High angular resolution is one of the most important properties of the massive MIMO systems which can be used for combating different challenges of these networks [20,21]. Accurate directional information provided by high angular resolution can be also utilized to mitigate the undesirable effects of the jamming and eavesdropping attacks [22][23][24][25]. For example, a secure downlink transmission scheme exploiting angular information is suggested in [22] where the authors assume the BS has perfect knowledge of the eavesdropper's directional information and propose three precoding methods based on this information.…”