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:2003.10676 · IEEE Transactions on Information Forensics and Security

Robust Beamforming Design for Sum Secrecy Rate Optimization in MU-MISO Networks

Pu Zhao, Meng Zhang, Hui Yu, Hanwen Luo, Wen Chen

Published Apr 15, 2015• 58 citations
arXivHTMLPDF

Abstract

This paper studies the beamforming design problem of a multiuser downlink network, assuming imperfect channel state information known to the base station. In this scenario, the base station is equipped with multiple antennas, and each user is wiretapped by a specific eavesdropper where each user or eavesdropper is equipped with one antenna. It is supposed that the base station employs transmit beamforming with a given requirement on sum transmitting power. The objective is to maximize the sum secrecy rate of the network. Due to the uncertainty of the channel, it is difficult to calculate the exact sum secrecy rate of the system. Thus, the maximum of lower bound of sum secrecy rate is considered. The optimization of the lower bound of sum secrecy rate still makes the considered beamforming design problem difficult to handle. To solve this problem, a beamforming design scheme is proposed to transform the original problem into a convex approximation problem, by employing semidefinite relaxation and first-order approximation technique based on Taylor expansion. In addition, with the advantage of low complexity, a zero-forcing-based beamforming method is presented in the case that base station is able to nullify the eavesdroppers' rate. When the base station does not have the ability, user selection algorithm would be in use. Numerical results show that the former strategy achieves better performance than the latter one, which is mainly due to the ability of optimizing beamforming direction, and both outperform the signal-to-leakage-and-noise ratio-based algorithm.

DOI
10.1109/tifs.2015.2423263

Related papers

Beamforming design of sum secrecy rate optimization for MU-MISO channel under sum power constraint

Pu Zhao, Meng Zhang, Hui Ling Yu +2 more

This paper studies the beamforming design problem of a multi-user downlink network, assuming perfect channel state information (CSI) known to the base station (BS). In this scenario, the BS is equipped with multiple antennas, and each user is wiretapped by a specific eavesdropper where each user or eavesdropper is equipped with one antenna. It is supposed that the BS employs transmit beamforming with a given requirement on sum transmitting power. The object is to maximize the sum secrecy rate (SSR) of the network, which leads to a nonconvex complicated structure, and makes he considered beamforming design problem difficult to handle. To solve this problem, a beamforming design scheme is proposed to transform the original problem into a convex approximation problem, by employing semidefinite relaxation (SDR) and first-order approximation technique based on Taylor expansion. Besides, with the advantage of low complexity, a zero-forcing (ZF) based beamforming method is presented in the case that BS is able to nullify he eavesdroppers' rate. Numerical results show that the former strategy achieves better performance than the later one, which is mainly due to the ability of optimizing beamforming direction, and both outperform the traditional signal-to-leakage-and-noise ratio (SLNR) based algorithm.

International Conference on Wireless Communications and Signal Processing (WCSP)•Oct 1, 2014•3 citations

Robust Beamforming Design for Sum Secrecy Rate Maximization in Multibeam Satellite Systems

Weixin Lu, Kang An, Tao Liang

This letter investigates the secure transmission optimization in a multibeam satellite downlink network with multiple eavesdroppers, where each legitimate user is wiretapped by a corresponding eavesdropper. Our design objective is to maximize the sum secrecy rate of the multibeam satellite network in the presence of imperfect channel state information (CSI) of eavesdroppers, while guaranteeing the total transmit power constraint on-board the satellite. Due to the nonconvexity and intractability resulting from the eavesdroppers' CSI uncertainty, a robust beamforming scheme is proposed to transform the initial optimization problem into a convex framework by jointly applying the Taylor expansion, S-Procedure, and Cauchy-Schwarz inequality. Meanwhile, an iterative algorithm is introduced to obtain the optimal solution. Finally, the validity and superiority of the proposed scheme are confirmed through comparisons with the existing nonrobust and perfect CSI approaches.

IEEE Transactions on Aerospace and Electronic Systems•Mar 20, 2019•99 citations

Robust Secure Transmit Design with Artificial Noise in the Presence of Multiple Eavesdroppers

Xiaochen Liu, Yuanyuan Gao, Nan Sha +2 more

This paper studies secure wireless transmission from a multi-antenna transmitter to a single-antenna intended receiver overheard by multiple eavesdroppers with considering the imperfect channel state information (CSI) of wiretap channel.To enhance security of communication link, the artificial noise (AN) is generated at transmitter.We first design the robust joint optimal beamforming of secret signal and AN to minimize transmit power with constraints of security quality of service (QoS), i.e., minimum allowable signal-to-interference-and-noise ratio (SINR) at receiver and maximum tolerable SINR at eavesdroppers.The formulated design problem is shown to be nonconvex and we transfer it into linear matrix inequalities (LMIs).The semidefinite relaxation (SDR) technique is used and the approximated method is proved to solve the original problem exactly.To verify the robustness and tightness of proposed beamforming, we also provide a method to calculate the worst-case SINR at eavesdroppers for a designed transmit scheme using semidefinite programming (SDP).Additionally, the secrecy rate maximization is explored for fixed total transmit power.To tackle the nonconvexity of original formulation, we develop an iterative approach employing sequential parametric convex approximation (SPCA).The simulation results illustrate that the proposed robust transmit schemes can effectively improve the transmit performance.

KSII Transactions on Internet and Information Systems•Jun 30, 2021•0 citations

Robust Transmit Designs for Secrecy Rate Constrained MISO NOMA System

Binbin Su, Qiang Ni, Bingtao He

This paper studies the secure transmission for downlink multiple-input single-output (MISO) non-orthogonal multiple access (NOMA) system in which imperfect channel state information (CSI) of the eavesdropper links is considered. We propose the novel robust beamforming strategies for the direct transmission NOMA (DT NOMA) and cooperative jamming NOMA (CJ NOMA) with a helper. We formulate our problem as the worst-case sum power minimization subject to secrecy rate constraint. The semidefinite relaxation (SDR) method is firstly applied to relax the quadratic terms and rank-one optimality is proved. Then an iterative algorithm based on successive convex approximation (SCA) is proposed to transform the nonconvex problem into convex approximations. Simulation results show that both the proposed NOMA schemes outperform the orthogonal multiple scheme, and CJ NOMA scheme can achieve much better system performance gain than DT NOMA scheme.

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)•Sep 1, 2018•7 citations

Robust Energy Efficient Beamforming in MISOME-SWIPT Systems With Proportional Secrecy Rate

Yanjie Dong, Md. Jahangir Hossain, Julian Cheng +1 more

The joint design of beamforming vector and artificial noise covariance matrix is investigated for the multiple-input-single-output-multiple-eavesdropper simultaneous wireless information and power transferring (MISOME-SWIPT) systems. In the MISOME-SWIPT system, the base station delivers information signals to the legitimate user equipment and broadcasts jamming signals to the eavesdroppers. A secrecy energy efficiency (SEE) maximization problem is formulated for the considered MISOME-SWIPT system with imperfect channel state information, where the SEE is defined as the ratio of sum secrecy rate over total power consumption. Since the formulated SEE maximization problem is non-convex, it is first recast into a series of convex problems in order to obtain the optimal solution with a reasonable computational complexity. Two suboptimal solutions are also proposed based on the heuristic beamforming techniques that trade performance for computational complexity. In addition, the analysis of computational complexity is performed for the optimal and suboptimal solutions. Numerical results are used to verify the performance of proposed algorithms and to reveal practical insights.

arXiv:1809.03856•IEEE Journal on Selected Areas in Communications•Oct 4, 2018•29 citations

Robust Beamforming Design for Secure Multiuser MISO Interference Channel

Hongbo Xu, Bingru Zhu, Jun Liu +1 more

In this letter, we investigate the secure beamforming design for multiuser multiple-input single-output interference channel with an eavesdropper. The robust secrecy rate optimization problem is studied with the imperfect channel state information. We consider the beamforming design to maximize the minimum worst case secrecy rate subject to the transmit power constraints with norm-bounded channel uncertainty. The problem is non-convex and hard to solve. We propose an effective method to reformulate this non-convex problem as a series of tractable convex program problems with linear matrix inequality and second-order cone constraints by exploiting the conservative approximation and the sequential convex approximation methods. The simulation results demonstrate the effectiveness of the proposed algorithm.

IEEE Communications Letters•Jan 2, 2017•11 citations
This paper studies the beamforming design problem of a multiuser downlink network, assuming imperfect channel state information known to the base station. In this scenario, the base station is equipped with multiple antennas, and each user is wiretapped by a specific eavesdropper where each user or eavesdropper is equipped with one antenna. It is supposed that the base station employs transmit beamforming with a given requirement on sum transmitting power. The objective is to maximize the sum secrecy rate of the network. Due to the uncertainty of the channel, it is difficult to calculate the exact sum secrecy rate of the system. Thus, the maximum of lower bound of sum secrecy rate is considered. The optimization of the lower bound of sum secrecy rate still makes the considered beamforming design problem difficult to handle. To solve this problem, a beamforming design scheme is proposed to transform the original problem into a convex approximation problem, by employing semidefinite relaxation and first-order approximation technique based on Taylor expansion. In addition, with the advantage of low complexity, a zero-forcing-based beamforming method is presented in the case that base station is able to nullify the eavesdroppers' rate. When the base station does not have the ability, user selection algorithm would be in use. Numerical results show that the former strategy achieves better performance than the latter one, which is mainly due to the ability of optimizing beamforming direction, and both outperform the signal-to-leakage-and-noise ratio-based algorithm.
This paper studies the beamforming design problem of a multi-user downlink network, assuming perfect channel state information (CSI) known to the base station (BS). In this scenario, the BS is equipped with multiple antennas, and each user is wiretapped by a specific eavesdropper where each user or eavesdropper is equipped with one antenna. It is supposed that the BS employs transmit beamforming with a given requirement on sum transmitting power. The object is to maximize the sum secrecy rate (SSR) of the network, which leads to a nonconvex complicated structure, and makes he considered beamforming design problem difficult to handle. To solve this problem, a beamforming design scheme is proposed to transform the original problem into a convex approximation problem, by employing semidefinite relaxation (SDR) and first-order approximation technique based on Taylor expansion. Besides, with the advantage of low complexity, a zero-forcing (ZF) based beamforming method is presented in the case that BS is able to nullify he eavesdroppers' rate. Numerical results show that the former strategy achieves better performance than the later one, which is mainly due to the ability of optimizing beamforming direction, and both outperform the traditional signal-to-leakage-and-noise ratio (SLNR) based algorithm.
This letter investigates the secure transmission optimization in a multibeam satellite downlink network with multiple eavesdroppers, where each legitimate user is wiretapped by a corresponding eavesdropper. Our design objective is to maximize the sum secrecy rate of the multibeam satellite network in the presence of imperfect channel state information (CSI) of eavesdroppers, while guaranteeing the total transmit power constraint on-board the satellite. Due to the nonconvexity and intractability resulting from the eavesdroppers' CSI uncertainty, a robust beamforming scheme is proposed to transform the initial optimization problem into a convex framework by jointly applying the Taylor expansion, S-Procedure, and Cauchy-Schwarz inequality. Meanwhile, an iterative algorithm is introduced to obtain the optimal solution. Finally, the validity and superiority of the proposed scheme are confirmed through comparisons with the existing nonrobust and perfect CSI approaches.
This paper studies secure wireless transmission from a multi-antenna transmitter to a single-antenna intended receiver overheard by multiple eavesdroppers with considering the imperfect channel state information (CSI) of wiretap channel.To enhance security of communication link, the artificial noise (AN) is generated at transmitter.We first design the robust joint optimal beamforming of secret signal and AN to minimize transmit power with constraints of security quality of service (QoS), i.e., minimum allowable signal-to-interference-and-noise ratio (SINR) at receiver and maximum tolerable SINR at eavesdroppers.The formulated design problem is shown to be nonconvex and we transfer it into linear matrix inequalities (LMIs).The semidefinite relaxation (SDR) technique is used and the approximated method is proved to solve the original problem exactly.To verify the robustness and tightness of proposed beamforming, we also provide a method to calculate the worst-case SINR at eavesdroppers for a designed transmit scheme using semidefinite programming (SDP).Additionally, the secrecy rate maximization is explored for fixed total transmit power.To tackle the nonconvexity of original formulation, we develop an iterative approach employing sequential parametric convex approximation (SPCA).The simulation results illustrate that the proposed robust transmit schemes can effectively improve the transmit performance.
This paper studies the secure transmission for downlink multiple-input single-output (MISO) non-orthogonal multiple access (NOMA) system in which imperfect channel state information (CSI) of the eavesdropper links is considered. We propose the novel robust beamforming strategies for the direct transmission NOMA (DT NOMA) and cooperative jamming NOMA (CJ NOMA) with a helper. We formulate our problem as the worst-case sum power minimization subject to secrecy rate constraint. The semidefinite relaxation (SDR) method is firstly applied to relax the quadratic terms and rank-one optimality is proved. Then an iterative algorithm based on successive convex approximation (SCA) is proposed to transform the nonconvex problem into convex approximations. Simulation results show that both the proposed NOMA schemes outperform the orthogonal multiple scheme, and CJ NOMA scheme can achieve much better system performance gain than DT NOMA scheme.
The joint design of beamforming vector and artificial noise covariance matrix is investigated for the multiple-input-single-output-multiple-eavesdropper simultaneous wireless information and power transferring (MISOME-SWIPT) systems. In the MISOME-SWIPT system, the base station delivers information signals to the legitimate user equipment and broadcasts jamming signals to the eavesdroppers. A secrecy energy efficiency (SEE) maximization problem is formulated for the considered MISOME-SWIPT system with imperfect channel state information, where the SEE is defined as the ratio of sum secrecy rate over total power consumption. Since the formulated SEE maximization problem is non-convex, it is first recast into a series of convex problems in order to obtain the optimal solution with a reasonable computational complexity. Two suboptimal solutions are also proposed based on the heuristic beamforming techniques that trade performance for computational complexity. In addition, the analysis of computational complexity is performed for the optimal and suboptimal solutions. Numerical results are used to verify the performance of proposed algorithms and to reveal practical insights.
In this letter, we investigate the secure beamforming design for multiuser multiple-input single-output interference channel with an eavesdropper. The robust secrecy rate optimization problem is studied with the imperfect channel state information. We consider the beamforming design to maximize the minimum worst case secrecy rate subject to the transmit power constraints with norm-bounded channel uncertainty. The problem is non-convex and hard to solve. We propose an effective method to reformulate this non-convex problem as a series of tractable convex program problems with linear matrix inequality and second-order cone constraints by exploiting the conservative approximation and the sequential convex approximation methods. The simulation results demonstrate the effectiveness of the proposed algorithm.