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:1808.02004 · Globecom

Robust Secrecy Energy Efficient Beamforming in MISOME-SWIPT Systems with Proportional Fairness

Yanjie Dong, Md. Jahangir Hossain, Julian Cheng, Victor C. M. Leung

Published Dec 1, 2018• 1 citation
arXivHTMLPDF

Abstract

The joint design of beamforming vector and artificial noise covariance matrix is investigated for multiple-input-single-output-multiple-eavesdropper simultaneous wireless information and power transferring (MISOME-SWIPT) systems. A secrecy energy efficiency (SEE) minimization problem is formulated in the MISOME-SWIPT system with imperfect channel state information and proportional secrecy rate constraints. Since the formulated SEE minimization 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. Numerical results are used to verify the performance of the proposed algorithm and to reveal practical insights.

DOI
10.1109/glocom.2018.8647782

Related papers

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 Secure Beamforming for Multi-Receiver Multi-Eavesdropper MIMO SWIPT Systems

Yao Yu, Shumei Liu, Weina Yuan +3 more

In this paper, we consider a multiuser multiple-input multiple-output (MIMO) downlink communication system with simultaneous wireless information and power transfer (SWIPT). In particular, we focus on a realistic and efficient multi-receiver multi-eavesdropper MIMO SWIPT system, in which the channel state information (CSI) of each legitimate receiver and energy receiver (i.e., potential eavesdropper) is partially known to the transmitter. Based on this, we propose a robust artificial noise (AN)-aided secure transmission scheme for the system, where the channel uncertainties are modeled by the worst-case model. In the proposed scheme, we aim to maximize the worst-case achievable secrecy rate under the transmit power constraint and the energy harvesting (EH) constraint, by jointly optimizing the transmit precoding matrix and the AN covariance matrix. We utilize the S-Procedure and Taylor series approximation to transform the non-convex problem. Then, we apply the interior point method to tackle the transformed convex problem, obtaining the approximate optimal matrices and the corresponding maximum worst-case secrecy rate. Simulation results show that our proposed scheme achieves significant performance improvements in terms of convergence and the worst-case achievable secrecy rate.

Globecom•Dec 1, 2020•4 citations

Robust secure beamforming for MISO SWIPT broadcast channels with confidential messages

Yuanlian Huo, Tingting Zhang, Chunguo Li

In this paper, we investigate multiple-input single-output (MISO) simultaneous wireless information and power transfer (SWIPT) broadcast channels with confidential messages (BCC) scenario, in which a multiple-antenna transmitter simultaneously transmits confidential messages and power to multiple single-antenna receivers. Considering the imperfect channel state information (CSI), we study the joint optimization of transmit beamforming vectors, covariance of artificial noise, and power splitting ratios so as to minimize the total transmit power while satisfying the worst-case conservative secrecy rate and energy harvesting constraints. The original optimization is non-convex and intractable in general. To handle this challenge, in this paper, we first derive the exact upper or lower bounds of the constraints in original optimization problem by using the Lagrangian approach, and then convert the corresponding non-convex problem into a convex one with the aid of the rank relaxation technique. Finally, we provide simulation results to illustrate the robustness of the proposed design.

International Conference on Wireless Communications and Signal Processing (WCSP)•Oct 1, 2017•1 citation

Secure Beamforming Design for SWIPT in MISO Broadcast Channel With Confidential Messages and External Eavesdroppers

Haiyang Zhang, Yongming Huang, Chunguo Li +1 more

This paper studies the secure beamforming design for simultaneous wireless information and power transfer in a multiple-input single-output broadcast channel with confidential messages and external eavesdroppers, where each receiver adopts the power splitting (PS) scheme to decode information and harvest energy concurrently, and it is also seen as a potential eavesdropper for messages not intended for it. Our objective is to minimize the total transmit power while guaranteeing the individual secrecy rate and energy harvesting constraints at each receiver by jointly optimizing transmit beamforming vectors, artificial noise covariance, and receive PS ratios. Both scenarios of perfect and imperfect channel state information (CSI) at the transmitter are considered. For the perfect CSI case, we propose a two-stage optimization approach to solve the original non-convex problem global optimality, and also provide a low-complexity suboptimal solution based on the particle swarm optimization algorithm. Furthermore, we also extend the above result to the colluding eavesdroppers scenario. For the imperfect CSI case, we propose a worst-case-based robust formulation, where the CSI errors are norm-bounded. With the aid of S-Procedure, we derive the equivalent forms for constraints and then transform the non-convex robust design into a convex optimization problem. Simulation results are finally presented to demonstrate the performance of our proposed schemes.

IEEE Transactions on Wireless Communications•Sep 12, 2016•64 citations

ROBUST SECRECY DESIGN FOR MIMO SWIPT WITH ARTIFICIAL NOISE AND FULL-DUPLEX RECEIVER JAMMING

Yao Ge, P.C. Ching

In this paper, we consider a multiple-input-multiple-output (MIMO) simultaneous wireless information and power transfer (SWIPT) system, which consists of a transmitter, a full-duplex (FD) desired receiver (DR) and multiple energy receivers (ERs), i.e., potential eavesdroppers. The transmitter and DR can send artificial noise (AN) and jamming signals to interfere and carry the energy to the ERs, respectively. Considering the imperfect channel state information (CSI) related to ERs, we aim to maximize the worst-case secrecy rate by jointly optimize the information covariance matrix, AN covariance matrix at the transmitter as well as the jamming covariance matrix at the DR, subject to their individual transmit power constraints and the minimum required power transferred to the ERs. In order to solve this non-convex and semi-infinite problem, we employ the S-procedure and propose a successive convex approximation (SCA) scheme based on Taylor series approximation, which can be efficiently solved by the proposed iterative method. Simulation results are finally presented to show the effectiveness of the new robust secrecy design.

IEEE Global Conference on Signal and Information Processing•Nov 1, 2018•3 citations

Secrecy rate maximization for MISO multicasting SWIPT system with power splitting scheme

Miao Zhang, Kanapathippillai Cumanan, Alister Graham Burr

This paper considers transmit covariance matrix design for secrecy rate maximization problem in a multiple-input single-output (MISO) multicasting simultaneous wireless information and power transfer (SWIPT) system. In order to enhance the performance of the system, artificial noise (AN) is added to the transmit signal in the design for the following purposes: to reduce the received signal-to-noise ratio (SNR) at the eavesdroppers and increase the harvested energy. We assume that all the channel-state-information (CSI) is perfectly known at the transmitter and all legitimate users are capable of simultaneously receiving information and harvesting energy. In addition, all the eavesdroppers are passive and they can harvest energy only when they are not intercepting or eavesdropping the messages intended for the legitimate users. The original secrecy rate maximization problem is not convex in terms of transmit and artificial covariance matrices as well as the power splitting (PS) ratio. In order to circumvent this non-convexity issue, we exploit the Charnes-Cooper Transformation and semidefinite relaxation (SDR) to convert this original problem into a convex one. However, this convex problem does not always yield the rank-one transmit and AN covariance matrices to obtain the solution of the original problem. Therefore, we analyze the optimal conditions and utilize a Gaussian randomization (GR) method to construct the rank-one solutions from the non-rank one results. Simulation results have been provided to demonstrate the performance of the proposed transmit covariance matrices design for MISO multicasting SWIPT system.

IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)•Jul 1, 2016•18 citations
The joint design of beamforming vector and artificial noise covariance matrix is investigated for multiple-input-single-output-multiple-eavesdropper simultaneous wireless information and power transferring (MISOME-SWIPT) systems. A secrecy energy efficiency (SEE) minimization problem is formulated in the MISOME-SWIPT system with imperfect channel state information and proportional secrecy rate constraints. Since the formulated SEE minimization 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. Numerical results are used to verify the performance of the proposed algorithm and to reveal practical insights.
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 paper, we consider a multiuser multiple-input multiple-output (MIMO) downlink communication system with simultaneous wireless information and power transfer (SWIPT). In particular, we focus on a realistic and efficient multi-receiver multi-eavesdropper MIMO SWIPT system, in which the channel state information (CSI) of each legitimate receiver and energy receiver (i.e., potential eavesdropper) is partially known to the transmitter. Based on this, we propose a robust artificial noise (AN)-aided secure transmission scheme for the system, where the channel uncertainties are modeled by the worst-case model. In the proposed scheme, we aim to maximize the worst-case achievable secrecy rate under the transmit power constraint and the energy harvesting (EH) constraint, by jointly optimizing the transmit precoding matrix and the AN covariance matrix. We utilize the S-Procedure and Taylor series approximation to transform the non-convex problem. Then, we apply the interior point method to tackle the transformed convex problem, obtaining the approximate optimal matrices and the corresponding maximum worst-case secrecy rate. Simulation results show that our proposed scheme achieves significant performance improvements in terms of convergence and the worst-case achievable secrecy rate.
In this paper, we investigate multiple-input single-output (MISO) simultaneous wireless information and power transfer (SWIPT) broadcast channels with confidential messages (BCC) scenario, in which a multiple-antenna transmitter simultaneously transmits confidential messages and power to multiple single-antenna receivers. Considering the imperfect channel state information (CSI), we study the joint optimization of transmit beamforming vectors, covariance of artificial noise, and power splitting ratios so as to minimize the total transmit power while satisfying the worst-case conservative secrecy rate and energy harvesting constraints. The original optimization is non-convex and intractable in general. To handle this challenge, in this paper, we first derive the exact upper or lower bounds of the constraints in original optimization problem by using the Lagrangian approach, and then convert the corresponding non-convex problem into a convex one with the aid of the rank relaxation technique. Finally, we provide simulation results to illustrate the robustness of the proposed design.
This paper studies the secure beamforming design for simultaneous wireless information and power transfer in a multiple-input single-output broadcast channel with confidential messages and external eavesdroppers, where each receiver adopts the power splitting (PS) scheme to decode information and harvest energy concurrently, and it is also seen as a potential eavesdropper for messages not intended for it. Our objective is to minimize the total transmit power while guaranteeing the individual secrecy rate and energy harvesting constraints at each receiver by jointly optimizing transmit beamforming vectors, artificial noise covariance, and receive PS ratios. Both scenarios of perfect and imperfect channel state information (CSI) at the transmitter are considered. For the perfect CSI case, we propose a two-stage optimization approach to solve the original non-convex problem global optimality, and also provide a low-complexity suboptimal solution based on the particle swarm optimization algorithm. Furthermore, we also extend the above result to the colluding eavesdroppers scenario. For the imperfect CSI case, we propose a worst-case-based robust formulation, where the CSI errors are norm-bounded. With the aid of S-Procedure, we derive the equivalent forms for constraints and then transform the non-convex robust design into a convex optimization problem. Simulation results are finally presented to demonstrate the performance of our proposed schemes.
In this paper, we consider a multiple-input-multiple-output (MIMO) simultaneous wireless information and power transfer (SWIPT) system, which consists of a transmitter, a full-duplex (FD) desired receiver (DR) and multiple energy receivers (ERs), i.e., potential eavesdroppers. The transmitter and DR can send artificial noise (AN) and jamming signals to interfere and carry the energy to the ERs, respectively. Considering the imperfect channel state information (CSI) related to ERs, we aim to maximize the worst-case secrecy rate by jointly optimize the information covariance matrix, AN covariance matrix at the transmitter as well as the jamming covariance matrix at the DR, subject to their individual transmit power constraints and the minimum required power transferred to the ERs. In order to solve this non-convex and semi-infinite problem, we employ the S-procedure and propose a successive convex approximation (SCA) scheme based on Taylor series approximation, which can be efficiently solved by the proposed iterative method. Simulation results are finally presented to show the effectiveness of the new robust secrecy design.
This paper considers transmit covariance matrix design for secrecy rate maximization problem in a multiple-input single-output (MISO) multicasting simultaneous wireless information and power transfer (SWIPT) system. In order to enhance the performance of the system, artificial noise (AN) is added to the transmit signal in the design for the following purposes: to reduce the received signal-to-noise ratio (SNR) at the eavesdroppers and increase the harvested energy. We assume that all the channel-state-information (CSI) is perfectly known at the transmitter and all legitimate users are capable of simultaneously receiving information and harvesting energy. In addition, all the eavesdroppers are passive and they can harvest energy only when they are not intercepting or eavesdropping the messages intended for the legitimate users. The original secrecy rate maximization problem is not convex in terms of transmit and artificial covariance matrices as well as the power splitting (PS) ratio. In order to circumvent this non-convexity issue, we exploit the Charnes-Cooper Transformation and semidefinite relaxation (SDR) to convert this original problem into a convex one. However, this convex problem does not always yield the rank-one transmit and AN covariance matrices to obtain the solution of the original problem. Therefore, we analyze the optimal conditions and utilize a Gaussian randomization (GR) method to construct the rank-one solutions from the non-rank one results. Simulation results have been provided to demonstrate the performance of the proposed transmit covariance matrices design for MISO multicasting SWIPT system.