Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Signal Processing Letters

Secure Multicast Transmission for Massive MIMO With Statistical Channel State Information

Li You, Jiaheng Wang, Wenjin Wang, Xiqi Gao

Published Feb 22, 2019• 20 citations
Publisher

Abstract

We investigate physical layer security in massive multiple-input multiple-output multicast transmission where the base station only knows the statistical channel state information of the legitimate user terminals and the eavesdropper. We first introduce a tight lower bound of the achievable secrecy multicast rate as the design objective. Then, we find the closed-form transmit directions, i.e., the eigenvectors of the optimal multicast transmit covariance matrix, which simplifies the matrix-valued multicast transmit strategy design into a beam domain power allocation problem. We further propose an efficient iterative power allocation algorithm with guaranteed convergence to a local optimal solution by invoking the concave-convex procedure. We also derive the deterministic equivalent of the optimization objective to reduce the computation complexity. Numerical results demonstrate the performance gains of the proposed approach over the conventional approach.

DOI
10.1109/lsp.2019.2900940

Related papers

Artificial Noise Assisted Secure Massive MIMO Transmission Exploiting Statistical CSI

Wenjin Wang, Chen Xu, Li You +2 more

For the single-cell massive multiple-input multiple-output (MIMO) downlink transmission, we investigate an artificial noise (AN) assisted secure transmission strategy where the base station has only access to statistical channel state information (CSI) of the legitimate user terminals and the eavesdropper. By maximizing a lower bound of the ergodic secrecy sum rate, we figure out the eigenvectors of the optimal secrecy signal and AN transmit covariance matrices in the closed-form. Notably, such a solution reveals that it is more favorable to transmit both the secrecy signals and the AN in the beam domain, by which we translate the original problem into a simpler power allocation problem in the beam domain. Building on the approaches of sequential optimization and the deterministic equivalent, we further propose an iterative algorithm for power allocation with guaranteed convergence to a local optimum. Numerical results show the superior performance of the proposed approach compared with the traditional one without AN.

IEEE Communications Letters•Oct 15, 2019•27 citations

Robust Beamforming for Physical Layer Security in BDMA Massive MIMO

Fengchao Zhu, Feifei Gao, Hai Feng Lin +3 more

In this paper, we design robust beamforming to guarantee the physical layer security for a multiuser beam division multiple access (BDMA) massive multiple-input multiple-output (MIMO) system, when the channel estimation errors are taken into consideration. With the aid of artificial noise, the proposed design are formulated as minimizing the transmit power of the base station, while providing legal users and the eavesdropper with different signal-to-interference-plus-noise ratio. It is strictly proved that, under BDMA massive MIMO scheme, the initial non-convex optimization can be equivalently converted to a convex semi-definite programming problem and the optimal rank-one beamforming solutions can be guaranteed. In stead of directly resorting to the convex tool, we make one step further by deriving the optimal beamforming direction and the optimal beamforming power allocation in closed-form, which greatly reduces the computational complexity and makes the proposed design practical for real world applications. Simulation results are then provided to verify the efficiency of the proposed algorithm.

arXiv:1711.08606•IEEE Journal on Selected Areas in Communications•Apr 1, 2018•42 citations

Implementation of Secure Multicast Routing for Cognitive Satellite-Terrestrial Networks

Keshavamurthy Keshavamurthy, Shivashakar, Shivaling Hunagund +2 more

The research aims to be a secured multi-casts transmission for cognitive satellite-terrestrial networks with Multiple input and Multiple Output (MIMO) antenna eavesdroppers where the satellite provides the group of legitimate users with a common confidential message and where interferences from the terrestrial base station (BS) are used to enhance the safety of the satellite link. Idea of this work is to reduce total transmitting power, subject to satellite connectivity secrecy rates and the terrestrial link data rate. The resulting problem of optimization involves the joint optimization of the non-convex and challenging information covariance matrices at the SAT and the BS. In order to turn the non-convex constraints into linear ones, we introduced a successive concave approximation method and proposed an efficient iterative algorithm. The results of the simulation show that the proposed algorithm is superior.

International Conference on Recent Trends on Electronics, Information, Communication & Technology (RTEICT)•Nov 12, 2020•0 citations

Secure MIMO Communication Relying on Movable Antennas

Jun Tang, Cunhua Pan, Yang Zhang +2 more

This paper considers a movable antenna (MA)-aided secure multiple-input multiple-output (MIMO) communication system consisting of a base station (BS), a legitimate information receiver (IR) and an eavesdropper (Eve), where the BS is equipped with MAs to enhance the system’s physical layer security (PLS). Specifically, we aim to maximize the secrecy rate (SR) by jointly optimizing the transmit precoding (TPC) matrix, the artificial noise (AN) covariance matrix and the MAs’ positions under the constraints of the maximum transmit power and the minimum spacing between MAs. To solve this non-convex problem with highly coupled optimization variables, the block coordinate descent (BCD) method is applied to alternately update the variables. Specifically, we first reformulate the SR into a tractable form, and derive the optimal TPC matrix and the AN covariance matrix with fixed MAs’ positions by applying the Lagrangian multiplier method in semi-closed forms. Then, the majorization-minimization (MM) algorithm is employed to iteratively optimize each MA’s position while keeping others fixed. We also extend this work to the more general multicast scenario. Finally, simulation results are provided to demonstrate the effectiveness of the proposed algorithms and the significant advantages of the MAs over conventional fixed position antennas (FPAs) in enhancing system’s security.

arXiv:2403.04269•IEEE Transactions on Communications•Sep 20, 2024•85 citations

Secure Transmission in Multicell Massive MIMO Systems

Jun Zhu, Robert Schober, Vijay K. Bhargava

In this paper, we consider physical layer security provisioning in multicell massive multiple-input-multiple-output (MIMO) systems. Specifically, we consider secure downlink transmission in a multicell massive MIMO system with matched-filter precoding and artificial noise (AN) generation at the base station (BS) in the presence of a passive multiantenna eavesdropper. We investigate the resulting achievable ergodic secrecy rate and the secrecy outage probability for the cases of perfect training and pilot contamination. Thereby, we consider two different AN shaping matrices, namely, the conventional AN shaping matrix, where the AN is transmitted in the null space of the matrix formed by all user channels, and a random AN shaping matrix, which avoids the complexity associated with finding the null space of a large matrix. Our analytical and numerical results reveal the following, in multicell massive MIMO systems employing matched-filter precoding: 1) AN generation is required to achieve a positive ergodic secrecy rate if the user and the eavesdropper experience the same path loss; 2) even with AN generation, secure transmission may not be possible if the number of eavesdropper antennas is too large and not enough power is allocated to channel estimation; 3) for a given fraction of power allocated to AN and a given number of users, in case of pilot contamination, the ergodic secrecy rate is not a monotonically increasing function of the number of BS antennas; and 4) random AN shaping matrices provide a favorable performance/complexity tradeoff and are an attractive alternative to conventional AN shaping matrices.

IEEE Transactions on Wireless Communications•Jul 9, 2014•308 citations

Secure Transmission in Multi-Cell Massive MIMO Systems

Jun Zhu, Robert Schober, Vijay K. Bhargava

In this paper, we consider physical layer security provisioning in multi-cell massive multiple-input multiple-output (MIMO) systems. Specifically, we consider secure downlink transmission in a multi-cell massive MIMO system with matched-filter precoding and artificial noise (AN) generation at the base station (BS) in the presence of a passive multi-antenna eavesdropper. We investigate the resulting achievable ergodic secrecy rate and the secrecy outage probability for the cases of perfect training and pilot contamination. Thereby, we consider two different AN shaping matrices, namely, the conventional AN shaping matrix, where the AN is transmitted in the null space of the matrix formed by all user channels, and a random AN shaping matrix, which avoids the complexity associated with finding the null space of a large matrix. Our analytical and numerical results reveal that in multi-cell massive MIMO systems employing matched-filter precoding (1) AN generation is required to achieve a positive ergodic secrecy rate if the user and the eavesdropper experience the same path-loss, (2) even with AN generation secure transmission may not be possible if the number of eavesdropper antennas is too large and not enough power is allocated to channel estimation, (3) for a given fraction of power allocated to AN and a given number of users, in case of pilot contamination, the ergodic secrecy rate is not a monotonically increasing function of the number of BS antennas, and (4) random AN shaping matrices provide a favourable performance/complexity tradeoff and are an attractive alternative to conventional AN shaping matrices.

arXiv:1405.7161•May 28, 2014•0 citations
We investigate physical layer security in massive multiple-input multiple-output multicast transmission where the base station only knows the statistical channel state information of the legitimate user terminals and the eavesdropper. We first introduce a tight lower bound of the achievable secrecy multicast rate as the design objective. Then, we find the closed-form transmit directions, i.e., the eigenvectors of the optimal multicast transmit covariance matrix, which simplifies the matrix-valued multicast transmit strategy design into a beam domain power allocation problem. We further propose an efficient iterative power allocation algorithm with guaranteed convergence to a local optimal solution by invoking the concave-convex procedure. We also derive the deterministic equivalent of the optimization objective to reduce the computation complexity. Numerical results demonstrate the performance gains of the proposed approach over the conventional approach.
For the single-cell massive multiple-input multiple-output (MIMO) downlink transmission, we investigate an artificial noise (AN) assisted secure transmission strategy where the base station has only access to statistical channel state information (CSI) of the legitimate user terminals and the eavesdropper. By maximizing a lower bound of the ergodic secrecy sum rate, we figure out the eigenvectors of the optimal secrecy signal and AN transmit covariance matrices in the closed-form. Notably, such a solution reveals that it is more favorable to transmit both the secrecy signals and the AN in the beam domain, by which we translate the original problem into a simpler power allocation problem in the beam domain. Building on the approaches of sequential optimization and the deterministic equivalent, we further propose an iterative algorithm for power allocation with guaranteed convergence to a local optimum. Numerical results show the superior performance of the proposed approach compared with the traditional one without AN.
In this paper, we design robust beamforming to guarantee the physical layer security for a multiuser beam division multiple access (BDMA) massive multiple-input multiple-output (MIMO) system, when the channel estimation errors are taken into consideration. With the aid of artificial noise, the proposed design are formulated as minimizing the transmit power of the base station, while providing legal users and the eavesdropper with different signal-to-interference-plus-noise ratio. It is strictly proved that, under BDMA massive MIMO scheme, the initial non-convex optimization can be equivalently converted to a convex semi-definite programming problem and the optimal rank-one beamforming solutions can be guaranteed. In stead of directly resorting to the convex tool, we make one step further by deriving the optimal beamforming direction and the optimal beamforming power allocation in closed-form, which greatly reduces the computational complexity and makes the proposed design practical for real world applications. Simulation results are then provided to verify the efficiency of the proposed algorithm.
The research aims to be a secured multi-casts transmission for cognitive satellite-terrestrial networks with Multiple input and Multiple Output (MIMO) antenna eavesdroppers where the satellite provides the group of legitimate users with a common confidential message and where interferences from the terrestrial base station (BS) are used to enhance the safety of the satellite link. Idea of this work is to reduce total transmitting power, subject to satellite connectivity secrecy rates and the terrestrial link data rate. The resulting problem of optimization involves the joint optimization of the non-convex and challenging information covariance matrices at the SAT and the BS. In order to turn the non-convex constraints into linear ones, we introduced a successive concave approximation method and proposed an efficient iterative algorithm. The results of the simulation show that the proposed algorithm is superior.
This paper considers a movable antenna (MA)-aided secure multiple-input multiple-output (MIMO) communication system consisting of a base station (BS), a legitimate information receiver (IR) and an eavesdropper (Eve), where the BS is equipped with MAs to enhance the system’s physical layer security (PLS). Specifically, we aim to maximize the secrecy rate (SR) by jointly optimizing the transmit precoding (TPC) matrix, the artificial noise (AN) covariance matrix and the MAs’ positions under the constraints of the maximum transmit power and the minimum spacing between MAs. To solve this non-convex problem with highly coupled optimization variables, the block coordinate descent (BCD) method is applied to alternately update the variables. Specifically, we first reformulate the SR into a tractable form, and derive the optimal TPC matrix and the AN covariance matrix with fixed MAs’ positions by applying the Lagrangian multiplier method in semi-closed forms. Then, the majorization-minimization (MM) algorithm is employed to iteratively optimize each MA’s position while keeping others fixed. We also extend this work to the more general multicast scenario. Finally, simulation results are provided to demonstrate the effectiveness of the proposed algorithms and the significant advantages of the MAs over conventional fixed position antennas (FPAs) in enhancing system’s security.
In this paper, we consider physical layer security provisioning in multicell massive multiple-input-multiple-output (MIMO) systems. Specifically, we consider secure downlink transmission in a multicell massive MIMO system with matched-filter precoding and artificial noise (AN) generation at the base station (BS) in the presence of a passive multiantenna eavesdropper. We investigate the resulting achievable ergodic secrecy rate and the secrecy outage probability for the cases of perfect training and pilot contamination. Thereby, we consider two different AN shaping matrices, namely, the conventional AN shaping matrix, where the AN is transmitted in the null space of the matrix formed by all user channels, and a random AN shaping matrix, which avoids the complexity associated with finding the null space of a large matrix. Our analytical and numerical results reveal the following, in multicell massive MIMO systems employing matched-filter precoding: 1) AN generation is required to achieve a positive ergodic secrecy rate if the user and the eavesdropper experience the same path loss; 2) even with AN generation, secure transmission may not be possible if the number of eavesdropper antennas is too large and not enough power is allocated to channel estimation; 3) for a given fraction of power allocated to AN and a given number of users, in case of pilot contamination, the ergodic secrecy rate is not a monotonically increasing function of the number of BS antennas; and 4) random AN shaping matrices provide a favorable performance/complexity tradeoff and are an attractive alternative to conventional AN shaping matrices.
In this paper, we consider physical layer security provisioning in multi-cell massive multiple-input multiple-output (MIMO) systems. Specifically, we consider secure downlink transmission in a multi-cell massive MIMO system with matched-filter precoding and artificial noise (AN) generation at the base station (BS) in the presence of a passive multi-antenna eavesdropper. We investigate the resulting achievable ergodic secrecy rate and the secrecy outage probability for the cases of perfect training and pilot contamination. Thereby, we consider two different AN shaping matrices, namely, the conventional AN shaping matrix, where the AN is transmitted in the null space of the matrix formed by all user channels, and a random AN shaping matrix, which avoids the complexity associated with finding the null space of a large matrix. Our analytical and numerical results reveal that in multi-cell massive MIMO systems employing matched-filter precoding (1) AN generation is required to achieve a positive ergodic secrecy rate if the user and the eavesdropper experience the same path-loss, (2) even with AN generation secure transmission may not be possible if the number of eavesdropper antennas is too large and not enough power is allocated to channel estimation, (3) for a given fraction of power allocated to AN and a given number of users, in case of pilot contamination, the ergodic secrecy rate is not a monotonically increasing function of the number of BS antennas, and (4) random AN shaping matrices provide a favourable performance/complexity tradeoff and are an attractive alternative to conventional AN shaping matrices.