اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدBeam domain secure transmission for massive MIMO communications
117
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We investigate the optimality and power allocation algorithm of beam domain transmission for single-cell massive multiple-input multiple-output (MIMO) systems with a multi-antenna 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.
قيم البحث
اقرأ أيضاً
Physical-layer key generation (PKG) in multi-user massive MIMO networks faces great challenges due to the large length of pilots and the high dimension of channel matrix. To tackle these problems, we propose a novel massive MIMO key generation scheme
with pilot reuse based on the beam domain channel model and derive close-form expression of secret key rate. Specifically, we present two algorithms, i.e., beam-domain based channel probing (BCP) algorithm and interference neutralization based multi-user beam allocation (IMBA) algorithm for the purpose of channel dimension reduction and multi-user pilot reuse, respectively. Numerical results verify that the proposed PKG scheme can achieve the secret key rate that approximates the perfect case, and significantly reduce the dimension of the channel estimation and pilot overhead.
In this paper, the design of robust linear precoders for the massive multi-input multi-output (MIMO) downlink with imperfect channel state information (CSI) is investigated. The imperfect CSI for each UE obtained at the BS is modeled as statistical C
SI under a jointly correlated channel model with both channel mean and channel variance information, which includes the effects of channel estimation error, channel aging and spatial correlation. The design objective is to maximize the expected weighted sum-rate. By combining the minorize-maximize (MM) algorithm with the deterministic equivalent method, an algorithm for robust linear precoder design is derived. The proposed algorithm achieves a stationary point of the expected weighted sum-rate maximization problem. To reduce the computational complexity, two low-complexity algorithms are then derived. One for the general case, and the other for the case when all the channel means are zeros. For the later case, it is proved that the beam domain transmission is optimal, and thus the precoder design reduces to the power allocation optimization in the beam domain. Simulation results show that the proposed robust linear precoder designs apply to various mobile scenarios and achieve high spectral efficiency.
In this paper, an energy harvesting scheme for a multi-user multiple-input-multiple-output (MIMO) secrecy channel with artificial noise (AN) transmission is investigated. Joint optimization of the transmit beamforming matrix, the AN covariance matrix
, and the power splitting ratio is conducted to minimize the transmit power under the target secrecy rate, the total transmit power, and the harvested energy constraints. The original problem is shown to be non-convex, which is tackled by a two-layer decomposition approach. The inner layer problem is solved through semi-definite relaxation, and the outer problem is shown to be a single-variable optimization that can be solved by one-dimensional (1-D) line search. To reduce computational complexity, a sequential parametric convex approximation (SPCA) method is proposed to find a near-optimal solution. Furthermore, tightness of the relaxation for the 1-D search method is validated by showing that the optimal solution of the relaxed problem is rank-one. Simulation results demonstrate that the proposed SPCA method achieves the same performance as the scheme based on 1-D search method but with much lower complexity.
The fading wire-tap channel is investigated, where the source-to-destination channel and the source-to-wire-tapper channel are corrupted by multiplicative fading gain coefficients in addition to additive Gaussian noise terms. The channel state inform
ation is assumed to be known at both the transmitter and the receiver. The parallel wire-tap channel with independent subchannels is first studied, which serves as an information-theoretic model for the fading wire-tap channel. The secrecy capacity of the parallel wire-tap channel is established. This result is then specialized to give the secrecy capacity of the fading wire-tap channel, which is achieved with the source node dynamically changing the power allocation according to the channel state realization. An optimal source power allocation is obtained to achieve the secrecy capacity.
The feasibility of physical-layer-based security approaches for wireless communications in the presence of one or more eavesdroppers is hampered by channel conditions. In this paper, cooperation is investigated as an approach to overcome this problem
and improve the performance of secure communications. In particular, a decode-and-forward (DF) based cooperative protocol is considered, and the objective is to design the system for secrecy capacity maximization or transmit power minimization. System design for the DF-based cooperative protocol is first studied by assuming the availability of global channel state information (CSI). For the case of one eavesdropper, an iterative scheme is proposed to obtain the optimal solution for the problem of transmit power minimization. For the case of multiple eavesdroppers, the problem of secrecy capacity maximization or transmit power minimization is in general intractable. Suboptimal system design is proposed by adding an additional constraint, i.e., the complete nulling of signals at all eavesdroppers, which yields simple closed-form solutions for the aforementioned two problems. Then, the impact of imperfect CSI of eavesdroppers on system design is studied, in which the ergodic secrecy capacity is of interest.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
