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 Access

Secure Communication for MISO Secrecy Channel With Multiple Multiantenna Eavesdroppers Having Finite Alphabet Inputs

Kuo Cao, Yueming Cai, Yongpeng Wu, Weiwei Yang, Xinrong Guan

Published Jan 1, 2018• 6 citations
Publisher

Abstract

This paper considers secure transmission design for multiple-input-single-output multiple multi-antenna eavesdroppers networks with finite alphabet inputs. To improve the achievable secrecy rate, the joint optimization of beamforming vector and transmitting power is studied. We transform the multivariable problem into a single-variable problem, and then derive the beamforming vector and the transmitting power using one-dimensional search method. Specially, the secure transmission designs in the extremely signal-to-noise ratio (SNR) regime are investigated. In the low SNR regime, the problem of beamforming design is transformed into a semi-definite programming problem, which can be handled by interior-pointbased methods, and the optimal transmitting power is obtained. Besides, two different secure schemes, which are zero-force beamforming scheme and joint beamforming and jamming scheme, are proposed to increase the achievable secrecy rate at high SNR. Numerical results demonstrate that the proposed schemes significantly improve the secrecy performance of the system.

DOI
10.1109/access.2018.2792155

Related papers

Secure Transmission With Aid of a Helper for MIMOME Network Having Finite Alphabet Inputs

Kuo Cao, Yongpeng Wu, Yueming Cai +1 more

This paper considers secure transmission with the aid of a helper for finite alphabet signals in multiple-input-multiple-output multiple antenna eavesdropper networks, where the helper transmits a jamming signal along with the confidential message sent by the source node to confuse the eavesdropper. For the scenario in which the only statistical channel-state-information (CSI) of the eavesdropper links is available at the transmitter, the ergodic secrecy rate lacks closed-form expression, and the evaluation of the ergodic secrecy rate is computationally prohibitive. To address this problem, an accurate approximation of the ergodic secrecy rate is proposed to reduce the computational complexity. Utilizing this approximation of the ergodic secrecy rate, the joint optimization of precoding design and power allocation between the source and the helper is investigated to improve the ergodic secrecy rate. Furthermore, to achieve a tradeoff between computational complexity and performance, low-complexity schemes without iteration are proposed based on the analysis at extreme signal-to-noise ratio (SNR). In the low SNR regime, we prove that it is optimal to transmit confidential messages with full power, and the beamforming design is the first-order optimal precoder. At high SNR, we transform the problem of precoding design into a semi-definite programming problem, which can be efficiently solved by the interior-point method.

IEEE Access•Jan 1, 2017•14 citations

Secure Transmission for MISOME Wiretap Channels With Finite Alphabet Inputs

Kuo Cao, Yueming Cai, Yongpeng Wu +1 more

This letter investigates secure transmission design for multiple-input single-output multi-antenna eavesdropper wiretap channels with finite alphabet inputs. With statistical channel state information of the eavesdropper's channel at the transmitter, we utilize an approximated ergodic secrecy rate to reduce the computational complexity. Then we study joint optimization of beamforming design and power control for maximizing the approximated ergodic secrecy rate. We transform the original multi-variable optimization problem into a single-variable optimization problem, which can be solved by 1-D optimization techniques. Numerical examples show that the proposed scheme is superior to the conventional schemes.

IEEE Wireless Communications Letters•Jan 23, 2018•9 citations

Secure Communication for Amplify-and-Forward Relay Networks With Finite Alphabet Input

Kuo Cao, Yueming Cai, Yongpeng Wu +1 more

This paper considers secure communication for amplify-and-forward (AF) relay networks with finite alphabet input. The joint optimization of power selection and beamforming design for improving the physical layer security of AF relay networks with single and multiple eavesdroppers is investigated. For the case with one eavesdropper, we transform the problem of multi-variable beamforming design into a single-variable optimization problem through semi-definite programming and solve it with one-dimensional optimization techniques. Moreover, the corresponding source power is obtained by utilizing the relation between the mutual information and minimum mean square error. Then, an iterative two-step algorithm is proposed to maximize the achievable secrecy rate. In the presence of multiple eavesdroppers, a zero-forcing beamforming scheme, where the confidential signal is nulled out in the direction of all eavesdroppers, is proposed to enhance the physical layer security. We decouple the source power and the beamforming vector by transforming the achievable secrecy rate into a single-variable function of the source power. Then, the suboptimal source power and the corresponding beamforming vector with low-complexity are derived. Numerical examples show that the proposed schemes significantly enhance the secrecy performance of the AF relay networks.

IEEE Transactions on Information Forensics and Security•Mar 21, 2018•12 citations

Robust MISO Beamforming With Cooperative Jamming for Secure Transmission From Perspectives of QoS and Secrecy Rate

Hui Ma, Julian Cheng, Xianfu Wang +1 more

Robust quality-of-service (QoS)-based and secrecy rate-based secure transmission designs are investigated for a multiple-input single-output system with multiple eavesdroppers and a cooperative jammer. Two scenarios are considered: (a) eavesdroppers' channel state information (ECSI) is available and (b) ECSI is unavailable. In scenario (a), a QoS-based design is considered to minimize the worst case signal-to-interference-and-noise ratio at the eavesdroppers and to guarantee the QoS of the legitimate receiver. A secrecy rate-based design is also studied where the worst case secrecy rate is maximized. In scenario (b), a QoS-based design is considered to maximize the power of jamming signals under the QoS constraint of the legitimate receiver, and the secrecy rate-based design is not applicable. In all these designs, we jointly optimize the transmit beamforming vector and the covariance matrix of jamming signals under individual power constraints. As the optimization problems are non-convex, we propose an algorithm for each problem through semidefinite relaxation. Our analysis and simulation results show that, even though the linear precoding scheme in our designs is transmit beamforming rather than the general rank transmit covariance, this does not cause any loss of optimality.

IEEE Transactions on Communications•Oct 23, 2017•39 citations

Linear Precoding for Finite-Alphabet Signaling Over MIMOME Wiretap Channels

Yongpeng Wu, Chengshan Xiao, Zhi Jun Ding +2 more

In this paper, we investigate the secrecy rate of finite-alphabet communications over multiple-input-multiple-output-multiple-antenna eavesdropper (MIMOME) channels. Traditional precoding designs based on Gaussian input assumption may lead to substantial secrecy rate loss when the Gaussian input is replaced by practical finite-alphabet input. To address this issue, we investigate linear precoding designs to directly maximize the secrecy rate for MIMOME systems under the constraint of finite-alphabet input. By exploiting the theory of Karush-Kuhn-Tucker (KKT) analysis and matrix calculus, we first present necessary conditions of the optimal precoding design when instantaneous channel-state information (CSI) of the eavesdropper is known at the transmitter. In this light, an iterative algorithm for finding the optimal precoding matrix is developed, utilizing a gradient decent method with backtracking line search. Moreover, we find that the beamforming design in MIMONE systems, which is a secrecy-capacity-achieving approach for Gaussian signaling, no longer provides the maximum secrecy rate for finite-alphabet input data. This case is substantially different from the Gaussian input case. In addition, we derive the closed-form results on the precoding matrix, which maximizes the secrecy rate in the low signal-to-noise ratio (SNR) region, and reveal the optimal precoding structure in the high-SNR region. A novel jamming signal generation method that draws on the CSI of the eavesdropper to additionally increase the secrecy rate is further proposed. The precoding design with only statistical CSI of the eavesdropper available at the transmitter is also considered. Numerical results show that the proposed designs provide significant gains over recent precoding designs through a power control policy and the precoding design with the Gaussian input assumption in various scenarios.

IEEE Transactions on Vehicular Technology•Apr 20, 2012•129 citations

Secure Transmission for MISO Integrated Sensing and Communication Secrecy Systems

Yajie Zhang, Zengbao Zhu, Qimei Cui +2 more

Integrated Sensing and Communication (ISAC) can reuse the same spectrum and hardware resources for communication and radar sensing, which is a promising technology to alleviate spectrum congestion. Recently, there has been an increasing research interest in the physical layer secrecy aspects of ISAC systems. This paper studies a basic multiple-input single-output ISAC secrecy system, where a multi-antenna base station transmits a unified signal to sense a point target and communicate to a single-antenna receiver in the presence of$K$single antenna eavesdroppers. Under this setup, a sensing signal-to-noise ratio (SNR) constrained secrecy rate maximization problem has been formulated. We showed that the problem can be reformulated as a convex semidefinite programming problem and proved that beamforming is the optimal transmission scheme. We derived two low-complexity semiclosed-form optimal beamforming solutions and one suboptimal closed-form solution. Numerical results demonstrate that the proposed solutions attain the optimum of the sensing SNR constrained secrecy rate maximization problem and have lower computational complexity than the existing method.

International Conference on Communications•Jun 9, 2024•6 citations
This paper considers secure transmission design for multiple-input-single-output multiple multi-antenna eavesdroppers networks with finite alphabet inputs. To improve the achievable secrecy rate, the joint optimization of beamforming vector and transmitting power is studied. We transform the multivariable problem into a single-variable problem, and then derive the beamforming vector and the transmitting power using one-dimensional search method. Specially, the secure transmission designs in the extremely signal-to-noise ratio (SNR) regime are investigated. In the low SNR regime, the problem of beamforming design is transformed into a semi-definite programming problem, which can be handled by interior-pointbased methods, and the optimal transmitting power is obtained. Besides, two different secure schemes, which are zero-force beamforming scheme and joint beamforming and jamming scheme, are proposed to increase the achievable secrecy rate at high SNR. Numerical results demonstrate that the proposed schemes significantly improve the secrecy performance of the system.
This paper considers secure transmission with the aid of a helper for finite alphabet signals in multiple-input-multiple-output multiple antenna eavesdropper networks, where the helper transmits a jamming signal along with the confidential message sent by the source node to confuse the eavesdropper. For the scenario in which the only statistical channel-state-information (CSI) of the eavesdropper links is available at the transmitter, the ergodic secrecy rate lacks closed-form expression, and the evaluation of the ergodic secrecy rate is computationally prohibitive. To address this problem, an accurate approximation of the ergodic secrecy rate is proposed to reduce the computational complexity. Utilizing this approximation of the ergodic secrecy rate, the joint optimization of precoding design and power allocation between the source and the helper is investigated to improve the ergodic secrecy rate. Furthermore, to achieve a tradeoff between computational complexity and performance, low-complexity schemes without iteration are proposed based on the analysis at extreme signal-to-noise ratio (SNR). In the low SNR regime, we prove that it is optimal to transmit confidential messages with full power, and the beamforming design is the first-order optimal precoder. At high SNR, we transform the problem of precoding design into a semi-definite programming problem, which can be efficiently solved by the interior-point method.
This letter investigates secure transmission design for multiple-input single-output multi-antenna eavesdropper wiretap channels with finite alphabet inputs. With statistical channel state information of the eavesdropper's channel at the transmitter, we utilize an approximated ergodic secrecy rate to reduce the computational complexity. Then we study joint optimization of beamforming design and power control for maximizing the approximated ergodic secrecy rate. We transform the original multi-variable optimization problem into a single-variable optimization problem, which can be solved by 1-D optimization techniques. Numerical examples show that the proposed scheme is superior to the conventional schemes.
This paper considers secure communication for amplify-and-forward (AF) relay networks with finite alphabet input. The joint optimization of power selection and beamforming design for improving the physical layer security of AF relay networks with single and multiple eavesdroppers is investigated. For the case with one eavesdropper, we transform the problem of multi-variable beamforming design into a single-variable optimization problem through semi-definite programming and solve it with one-dimensional optimization techniques. Moreover, the corresponding source power is obtained by utilizing the relation between the mutual information and minimum mean square error. Then, an iterative two-step algorithm is proposed to maximize the achievable secrecy rate. In the presence of multiple eavesdroppers, a zero-forcing beamforming scheme, where the confidential signal is nulled out in the direction of all eavesdroppers, is proposed to enhance the physical layer security. We decouple the source power and the beamforming vector by transforming the achievable secrecy rate into a single-variable function of the source power. Then, the suboptimal source power and the corresponding beamforming vector with low-complexity are derived. Numerical examples show that the proposed schemes significantly enhance the secrecy performance of the AF relay networks.
Robust quality-of-service (QoS)-based and secrecy rate-based secure transmission designs are investigated for a multiple-input single-output system with multiple eavesdroppers and a cooperative jammer. Two scenarios are considered: (a) eavesdroppers' channel state information (ECSI) is available and (b) ECSI is unavailable. In scenario (a), a QoS-based design is considered to minimize the worst case signal-to-interference-and-noise ratio at the eavesdroppers and to guarantee the QoS of the legitimate receiver. A secrecy rate-based design is also studied where the worst case secrecy rate is maximized. In scenario (b), a QoS-based design is considered to maximize the power of jamming signals under the QoS constraint of the legitimate receiver, and the secrecy rate-based design is not applicable. In all these designs, we jointly optimize the transmit beamforming vector and the covariance matrix of jamming signals under individual power constraints. As the optimization problems are non-convex, we propose an algorithm for each problem through semidefinite relaxation. Our analysis and simulation results show that, even though the linear precoding scheme in our designs is transmit beamforming rather than the general rank transmit covariance, this does not cause any loss of optimality.
In this paper, we investigate the secrecy rate of finite-alphabet communications over multiple-input-multiple-output-multiple-antenna eavesdropper (MIMOME) channels. Traditional precoding designs based on Gaussian input assumption may lead to substantial secrecy rate loss when the Gaussian input is replaced by practical finite-alphabet input. To address this issue, we investigate linear precoding designs to directly maximize the secrecy rate for MIMOME systems under the constraint of finite-alphabet input. By exploiting the theory of Karush-Kuhn-Tucker (KKT) analysis and matrix calculus, we first present necessary conditions of the optimal precoding design when instantaneous channel-state information (CSI) of the eavesdropper is known at the transmitter. In this light, an iterative algorithm for finding the optimal precoding matrix is developed, utilizing a gradient decent method with backtracking line search. Moreover, we find that the beamforming design in MIMONE systems, which is a secrecy-capacity-achieving approach for Gaussian signaling, no longer provides the maximum secrecy rate for finite-alphabet input data. This case is substantially different from the Gaussian input case. In addition, we derive the closed-form results on the precoding matrix, which maximizes the secrecy rate in the low signal-to-noise ratio (SNR) region, and reveal the optimal precoding structure in the high-SNR region. A novel jamming signal generation method that draws on the CSI of the eavesdropper to additionally increase the secrecy rate is further proposed. The precoding design with only statistical CSI of the eavesdropper available at the transmitter is also considered. Numerical results show that the proposed designs provide significant gains over recent precoding designs through a power control policy and the precoding design with the Gaussian input assumption in various scenarios.
Integrated Sensing and Communication (ISAC) can reuse the same spectrum and hardware resources for communication and radar sensing, which is a promising technology to alleviate spectrum congestion. Recently, there has been an increasing research interest in the physical layer secrecy aspects of ISAC systems. This paper studies a basic multiple-input single-output ISAC secrecy system, where a multi-antenna base station transmits a unified signal to sense a point target and communicate to a single-antenna receiver in the presence ofKKKsingle antenna eavesdroppers. Under this setup, a sensing signal-to-noise ratio (SNR) constrained secrecy rate maximization problem has been formulated. We showed that the problem can be reformulated as a convex semidefinite programming problem and proved that beamforming is the optimal transmission scheme. We derived two low-complexity semiclosed-form optimal beamforming solutions and one suboptimal closed-form solution. Numerical results demonstrate that the proposed solutions attain the optimum of the sensing SNR constrained secrecy rate maximization problem and have lower computational complexity than the existing method.