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

arXiv:1711.08606 · IEEE Journal on Selected Areas in Communications

Robust Beamforming for Physical Layer Security in BDMA Massive MIMO

Fengchao Zhu, Feifei Gao, Hai Feng Lin, Shi Jin, Junhui Zhao, Gongbin Qian

Published Apr 1, 2018• 42 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1109/jsac.2018.2824259

Related papers

Robust Secure Beamforming for Multiuser MISO Wiretap Channels

Yuchong Li, Lijian Zhang, Yuguo Wu +1 more

Physical layer security has recently emerged as a promising approach to provide secure wireless communications. Physical layer security technology is the key means to achieve security and communication integration. The built-in security mechanism based on the characteristics of wireless channel provides a feasible idea for the realization of “one secret at a time”. It has important application prospects in integrity protection of service data, Internet of things (IoT) lightweight encryption and blockchain wireless security technology. In this paper, we consider the scenario of a unicast multiuser multiple-input single-output (MISO) downlink system in the presence of multiple single-antenna passive eavesdroppers. Instead of assuming perfect channel state information (CSI), we investigate the artificial noise (AN)-aided robust transmit beamforming scheme with imperfect CSI on legitimate receivers and no CSI regarding eavesdroppers at the transmitter. Under the fixed total transmit power, the information symbol and the AN are transmitted concurrently. We aim to guarantee each legitimate receiver's signal-to-interference-and-noise ratio(SINR) outage probability below a preset level with minimum power. Hence, as much power as possible can be allocated to AN to confuse the eavesdroppers. In order to reduce the negative impact on the legitimate receivers, the AN is transmitted in the null space of the estimated legitimate channels. To deal with this nonconvex optimization problem, a rank relaxed formulation is obtained by employing semidefinite relaxation (SDR). Then we propose two approaches by using Bernstein-type inequality and S-procedure, respectively, to transform the probabilistic constraints into deterministic constraints. The optimization problem is reformulated as a convex semidefinite program (SDP). Simulation results show that the proposed approaches have better performances than the non-robust approach.

International Conference on Smart BlockChain (SmartBlock)•Oct 1, 2020•3 citations

Secure Multicast Transmission for Massive MIMO With Statistical Channel State Information

Li You, Jiaheng Wang, Wenjin Wang +1 more

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.

IEEE Signal Processing Letters•Feb 22, 2019•20 citations

Transmit Beamforming for Layered Physical Layer Security

Wei Zhang, Jian Chen, Yonghong Kuo +1 more

In this paper, we propose a novel layered physical layer security model, which is the extension of the traditional physical layer security to the domain of multiple-layer information security. It has a hierarchical information security structure that every transmitted message has a security level, while every user has a security clearance. Users can only decode the messages with security levels lower than or equal to their clearance, otherwise they will be deemed as eavesdroppers. Based on the framework of the layered information security and assuming perfect channel state information of all users, an artificial-noise-aided optimal beamforming scheme is proposed to minimize the total transmit power at the base station, while satisfying the minimum secrecy rate requirements of all secret messages. Due to the intrinsical complexity of the formulated nonconvex problem, a safe and convex reformulation based on the first-order Taylor series expansion method is proposed to generate a tractable approximation. A successive convex approximation-based algorithm is then proposed, which solves a series of second-order cone problems with convergence to the stationary point of the original problem. We also consider the imperfect channel state information case, and then propose a worst-case robust design to overcome the influence of channel uncertainties. Semi-definite relaxation method and S-procedure are utilized to get a computationally efficient lower bound of the intractable power minimization problem. Moreover, we investigate the application of the suboptimal zero-forcing-based beamforming scheme in the system to tradeoff the achievable performance and the computational complexity. Simulation results are provided to demonstrate the effectiveness of our proposed schemes.

IEEE Transactions on Vehicular Technology•Aug 2, 2019•66 citations

Robust Secure Beamforming Design for Two-User Downlink MISO Rate-Splitting Systems

Hao Fu, Suili Feng, Weijun Tang +1 more

In this paper, we consider max-min fairness for a downlink two-user multi-input single-output (MISO) system with imperfect channel state information available at transmitter (CSIT) taking into account the total power constraint and the physical layer security. Considering the worst-case channel uncertainty for a potential eavesdropper (PE), we study the robust secure beamforming algorithm design which maximizes the minimum achieved worst-case secrecy rate among single-antenna legitimate users. In contrast to existing schemes adopted in the literatures, we propose a rather unorthodox rate splitting (RS) scheme which advocates the dual use of a common message serving both as a desired message and artificial noise (AN) for legitimate users and the PE, respectively. The algorithm design is formulated as a non-convex optimization problem which is generally intractable. As a compromise approach, we apply the successive convex approximation (SCA) method which facilitates the design of a low-complexity suboptimal iterative algorithm. In each iteration, a rank-constrained semi-definite program (SDP) is solved optimally by SDP relaxation (SDR). Simulation results demonstrate that our proposed robust secure beamforming scheme in the MISO-RS secure transmission system outperforms that of the non-robust counterpart. Moreover, our results also unveil that the proposed RS scheme can achieve a superior performance compared to the existing non-orthogonal multiple access (NOMA) schemes and the traditional scheme.

IEEE Transactions on Wireless Communications•Sep 14, 2020•119 citations

Robust Beamforming and Jamming for Enhancing the Physical Layer Security of Full Duplex Radios

Zhengmin Kong, Shaoshi Yang, Die Wang +1 more

In this paper, we investigate the physical layer security of a full-duplex base station (BS)-aided system in the worst case, where an uplink transmitter (UT) and a downlink receiver (DR) are equipped with a single antenna, while a powerful eavesdropper is equipped with multiple antennas. For securing the confidentiality of signals transmitted from the BS and UT, an artificial noise (AN)-aided secrecy beamforming scheme is proposed, which is robust to the realistic imperfect state information of both the eavesdropping channel and the residual self-interference channel. Our objective function is that of maximizing the worst-case sum secrecy rate achieved by the BS and UT, through jointly optimizing the beamforming vector of the confidential signals and the transmit covariance matrix of the AN. However, the resulting optimization problem is non-convex and non-linear. In order to efficiently obtain the solution, we transform the non-convex problem into a sequence of convex problems by adopting the block coordinate descent algorithm. We invoke a linear matrix inequality for finding its Karush-Kuhn-Tucker (KKT) solution. In order to evaluate the achievable performance, the worst-case secrecy rate is analytically derived. Furthermore, we construct another secrecy transmission scheme using the projection matrix theory for performance comparison. Our simulation results show that the proposed robust secrecy transmission scheme achieves substantial secrecy performance gains, which verifies the efficiency of the proposed method.

arXiv:1903.10787•IEEE Transactions on Information Forensics and Security•Apr 1, 2019•48 citations

AN-aided robust secure beamforming design in MIMO two-way relay systems with PNC

Yunqin Hao, Tiejun Lv, Hui Gao

This paper investigates the artificial noise (AN)-aided robust secure beamforming design for multiple-input multiple-output (MIMO) two-way relaying (TWR) systems based on physical layer network coding (PNC). In terms of signal-to-interference-and-noise ratio (SINR), we propose two robust beamforming designs to optimize worst-case secrecy sum rate in the presence of an eavesdropper, where the eavesdropper's channel state information (ECSI) is imperfect. In low SINR regime, we give a robust joint beamforming design. Since the optimization problem is non-convex, we use a zero-forcing (ZF) constraint on AN beamforming, and after approximating the objective function, the non-convex problem is formulated into a semidefinite programming (SDP). On the other hand, in high SINR regime, we provide a quality-of-service (QoS)-based robust beamforming design, in which the optimal solution can be efficiently obtained by employing an iterative algorithm based on Taylor expansion and semidefinite relaxation (SDR) techniques. Numerical results show the efficiency of the proposed schemes.

IEEE Wireless Communications and Networking Conference•Apr 1, 2018•4 citations
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.
Physical layer security has recently emerged as a promising approach to provide secure wireless communications. Physical layer security technology is the key means to achieve security and communication integration. The built-in security mechanism based on the characteristics of wireless channel provides a feasible idea for the realization of “one secret at a time”. It has important application prospects in integrity protection of service data, Internet of things (IoT) lightweight encryption and blockchain wireless security technology. In this paper, we consider the scenario of a unicast multiuser multiple-input single-output (MISO) downlink system in the presence of multiple single-antenna passive eavesdroppers. Instead of assuming perfect channel state information (CSI), we investigate the artificial noise (AN)-aided robust transmit beamforming scheme with imperfect CSI on legitimate receivers and no CSI regarding eavesdroppers at the transmitter. Under the fixed total transmit power, the information symbol and the AN are transmitted concurrently. We aim to guarantee each legitimate receiver's signal-to-interference-and-noise ratio(SINR) outage probability below a preset level with minimum power. Hence, as much power as possible can be allocated to AN to confuse the eavesdroppers. In order to reduce the negative impact on the legitimate receivers, the AN is transmitted in the null space of the estimated legitimate channels. To deal with this nonconvex optimization problem, a rank relaxed formulation is obtained by employing semidefinite relaxation (SDR). Then we propose two approaches by using Bernstein-type inequality and S-procedure, respectively, to transform the probabilistic constraints into deterministic constraints. The optimization problem is reformulated as a convex semidefinite program (SDP). Simulation results show that the proposed approaches have better performances than the non-robust approach.
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.
In this paper, we propose a novel layered physical layer security model, which is the extension of the traditional physical layer security to the domain of multiple-layer information security. It has a hierarchical information security structure that every transmitted message has a security level, while every user has a security clearance. Users can only decode the messages with security levels lower than or equal to their clearance, otherwise they will be deemed as eavesdroppers. Based on the framework of the layered information security and assuming perfect channel state information of all users, an artificial-noise-aided optimal beamforming scheme is proposed to minimize the total transmit power at the base station, while satisfying the minimum secrecy rate requirements of all secret messages. Due to the intrinsical complexity of the formulated nonconvex problem, a safe and convex reformulation based on the first-order Taylor series expansion method is proposed to generate a tractable approximation. A successive convex approximation-based algorithm is then proposed, which solves a series of second-order cone problems with convergence to the stationary point of the original problem. We also consider the imperfect channel state information case, and then propose a worst-case robust design to overcome the influence of channel uncertainties. Semi-definite relaxation method and S-procedure are utilized to get a computationally efficient lower bound of the intractable power minimization problem. Moreover, we investigate the application of the suboptimal zero-forcing-based beamforming scheme in the system to tradeoff the achievable performance and the computational complexity. Simulation results are provided to demonstrate the effectiveness of our proposed schemes.
In this paper, we consider max-min fairness for a downlink two-user multi-input single-output (MISO) system with imperfect channel state information available at transmitter (CSIT) taking into account the total power constraint and the physical layer security. Considering the worst-case channel uncertainty for a potential eavesdropper (PE), we study the robust secure beamforming algorithm design which maximizes the minimum achieved worst-case secrecy rate among single-antenna legitimate users. In contrast to existing schemes adopted in the literatures, we propose a rather unorthodox rate splitting (RS) scheme which advocates the dual use of a common message serving both as a desired message and artificial noise (AN) for legitimate users and the PE, respectively. The algorithm design is formulated as a non-convex optimization problem which is generally intractable. As a compromise approach, we apply the successive convex approximation (SCA) method which facilitates the design of a low-complexity suboptimal iterative algorithm. In each iteration, a rank-constrained semi-definite program (SDP) is solved optimally by SDP relaxation (SDR). Simulation results demonstrate that our proposed robust secure beamforming scheme in the MISO-RS secure transmission system outperforms that of the non-robust counterpart. Moreover, our results also unveil that the proposed RS scheme can achieve a superior performance compared to the existing non-orthogonal multiple access (NOMA) schemes and the traditional scheme.
In this paper, we investigate the physical layer security of a full-duplex base station (BS)-aided system in the worst case, where an uplink transmitter (UT) and a downlink receiver (DR) are equipped with a single antenna, while a powerful eavesdropper is equipped with multiple antennas. For securing the confidentiality of signals transmitted from the BS and UT, an artificial noise (AN)-aided secrecy beamforming scheme is proposed, which is robust to the realistic imperfect state information of both the eavesdropping channel and the residual self-interference channel. Our objective function is that of maximizing the worst-case sum secrecy rate achieved by the BS and UT, through jointly optimizing the beamforming vector of the confidential signals and the transmit covariance matrix of the AN. However, the resulting optimization problem is non-convex and non-linear. In order to efficiently obtain the solution, we transform the non-convex problem into a sequence of convex problems by adopting the block coordinate descent algorithm. We invoke a linear matrix inequality for finding its Karush-Kuhn-Tucker (KKT) solution. In order to evaluate the achievable performance, the worst-case secrecy rate is analytically derived. Furthermore, we construct another secrecy transmission scheme using the projection matrix theory for performance comparison. Our simulation results show that the proposed robust secrecy transmission scheme achieves substantial secrecy performance gains, which verifies the efficiency of the proposed method.
This paper investigates the artificial noise (AN)-aided robust secure beamforming design for multiple-input multiple-output (MIMO) two-way relaying (TWR) systems based on physical layer network coding (PNC). In terms of signal-to-interference-and-noise ratio (SINR), we propose two robust beamforming designs to optimize worst-case secrecy sum rate in the presence of an eavesdropper, where the eavesdropper's channel state information (ECSI) is imperfect. In low SINR regime, we give a robust joint beamforming design. Since the optimization problem is non-convex, we use a zero-forcing (ZF) constraint on AN beamforming, and after approximating the objective function, the non-convex problem is formulated into a semidefinite programming (SDP). On the other hand, in high SINR regime, we provide a quality-of-service (QoS)-based robust beamforming design, in which the optimal solution can be efficiently obtained by employing an iterative algorithm based on Taylor expansion and semidefinite relaxation (SDR) techniques. Numerical results show the efficiency of the proposed schemes.