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 Transactions on Communications

Cooperative Jamming Aided Robust Secure Transmission for Wireless Information and Power Transfer in MISO Channels

Qi Zhang, Xiaobin Huang, Quanzhong Li, Jiayin Qin

Published Feb 20, 2015• 81 citations
Publisher

Abstract

Considering simultaneous wireless information and power transfer (SWIPT), we investigate cooperative-jamming (CJ) aided robust secure transmission design in multiple-input-single-output channels, where a cooperative jammer introduces jamming interferences and assists a source to supply wireless power for both an energy receiver and a legitimate destination. The destination employs a power splitting (PS) scheme to split the received signals for both information decoding and energy harvesting (EH). Compared with conventional transmission without SWIPT, the transmission with SWIPT should satisfy additional worst-case EH constraints. Furthermore, the PS scheme introduces an additional multiplicative optimization variable, i.e., the PS factor. Our objective is to maximize worst-case secrecy rate under transmit power constraints and worst-case EH constraints. We propose to decouple the problem into three optimization problems and employ alternating optimization algorithm to obtain the locally optimal solution. For the optimization of transmit covariance matrices and PS factor, we propose to employ the S-procedure and its extension to reformulate it as a convex semidefinite programming. It is shown through the simulation results that our proposed CJ aided robust secure transmission scheme outperforms the robust direct transmission scheme without CJ and the CJ aided non-robust scheme.

DOI
10.1109/tcomm.2015.2405063

Related papers

Robust Design for MISO SWIPT System with Artificial Noise and Cooperative Jamming

Zheng Chu, Tuan Anh Le, Huan Xuan Nguyen +5 more

Considering simultaneous wireless information and power transfer (SWIPT), we study a multiple-input- single-output (MISO) secrecy channel which consists of a multi-antenna trans- mitter and a cooperative jammer (CJ), multiple multi-antenna energy receivers (ERs), i.e., potential eavesdroppers, and multiple single-antenna co-located receivers (CRs). Both transmitter and CJ send the intend signal with artificial noise (AN) and jamming signal to interfere with the ERs. All receivers (CRs and ERs) adopt a power splitter to decode information and harvest power simultaneously. We exploit AN and CJ to facilitate efficient wireless energy transfer and secure transmission. Our aim is to maximize the minimum harvested energy among all ERs and CRs subject to the total power constraints at the transmitter and CJ while guaranteeing the minimum secrecy rate for each CR above its requirement. By incorporating norm-bounded channel uncertainty model, we propose a joint design of robust secure transmission. The original problem is solved by a two- step approach. In the first step, the proposed problem is reformulated as a sequence of semidefinite programs (SDPs). In the second step, the proposed problem can be handled by one-dimensional search to attain the optimal solution. Simulation results indicate that the performance of the proposed scheme outperforms that of separated AN-aided or CJ-aided scheme.

Globecom•Dec 1, 2017•13 citations

Joint Optimization of AN-Aided Transmission and Power Splitting for MISO Secure Communications With SWIPT

Xin Zhao, Jian Xiao, Quanzhong Li +2 more

For simultaneous wireless information and power transfer (SWIPT), secure communication is an important issue. In this letter, we consider a wireless multiple-input-single-output secure communication system with SWIPT overheard by multiple multi-antenna eavesdroppers. In the system, a transmitter employs artificial noise (AN)-aided transmission and a legitimate receiver employs power splitting (PS) to harvest energy. Our objective is to jointly design AN-aided transmission and PS scheme which maximizes achievable secrecy rate under transmit power constraint and energy harvesting constraint. We propose to include an equality constraint to convert the constraint on information rate from transmitter to eavesdroppers into linear matrix inequalities. Replacing the equality constraint with a convex constraint and a concave constraint, we propose to employ constrained concave convex procedure based algorithm to find a local optimum of the problem. Simulation results demonstrate that the proposed joint optimization of AN-aided transmission and PS scheme outperforms the non-AN-aided one.

IEEE Communications Letters•Sep 10, 2015•30 citations

Robust Optimization for AN-Aided Transmission and Power Splitting for Secure MISO SWIPT System

Zheng Chu, Zhengyu Zhu, Jamal Ahmed Hussein

This letter investigates a multiple-input single-output secrecy channel, where the legitimate user and the eavesdroppers employ a power splitting scheme for information decoding and energy harvesting (EH), simultaneously. An artificial noise is embedded to the information bearing signal to interfere the eavesdroppers and to harvest power by all receivers (i.e., legitimate user and eavesdroppers). We consider the robust secrecy rate maximization problem subject to the transmit power and the EH constraints by incorporating the norm-bounded channel uncertainty. This robust optimization problem is not convex, and thus, it can be reformulated as a convex one along with matrix transformations and convex conic optimization techniques, which is iteratively solved based on constrained concave-convex procedure-based algorithm. Finally, numerical results are provided to validate our proposed algorithm.

IEEE Communications Letters•May 24, 2016•55 citations

Robust AN-Aided Secure Transmission Scheme in MISO Channels with Simultaneous Wireless Information and Power Transfer

Maoxin Tian, Xiaobin Huang, Qi Zhang +1 more

In this letter, considering the simultaneous wireless information and power transfer scheme, we study the robust artificial noise (AN)-aided secure transmission design in multiple-input-single-output channels where the channel uncertainties are modeled by worst-case model. Our objective is to maximize the worst-case secrecy rate with respect to both the worst-case channel uncertainties and the worst-case eavesdropper among multiple eavesdroppers, under the transmit power constraint and the worst-case energy harvesting constraint. The optimal solution to the problem can be found by two-dimensional (2-D) search. Since the 2-D search algorithm has high computational complexity, we propose to neglect the correlation of the channel uncertainties from the transmitter to the information-decoding receiver and reformulate the problem as a sequence of convex semidefinite programming (SDP) which is solved efficiently by SDP based one-dimensional line search method. It is shown through computer simulations that the proposed robust AN-aided secure transmission schemes have significant performance gain over the non-robust AN-aided secure transmission scheme and the robust secure transmission scheme without the aid of AN.

IEEE Signal Processing Letters•Nov 7, 2014•63 citations

Both Worst-Case and Chance-Constrained Robust Secure SWIPT in MISO Interference Channels

Donghua Chen, Yucheng He, Xiaodan Lin +1 more

This paper addresses robust designs of secure simultaneous wireless information and power transfer for multiple-input single-output (MISO) multiuser systems. By using a bounded uncertainty model for the channel state information (CSI) from transmitters to legitimate receivers and under the assumption of only available statistic knowledge of the CSI to eavesdroppers, we consider the robust designs with both worst-case and chance-constrained optimizations. To jointly optimize transmit beamforming vectors and power splitting factors, we formulate three problems aiming at minimizing the system power, maximizing the sum secrecy rate, and maximizing the minimal secrecy rate, respectively, subject to both energy harvesting and secrecy outage constraints. These problems are intractable in their original forms due to the CSI models and their non-convexity. To reach computationally efficient solutions, we first rewrite the original problems by semi-definite relaxation, then transform the CSI uncertainty related constraints by S-procedure, and finally approximate the non-convex constraints by the first-order Taylor expansion. By the reformulations, we present iterative successive convex approximation algorithm for approaching the optimized solutions. Simulation results under various setups of system parameters are provided to examine the system performance and validate the effectiveness of the proposed schemes.

IEEE Transactions on Information Forensics and Security•Aug 28, 2017•26 citations

Joint design for AN-aided transmission and power splitting in secrecy MIMO SWIPT channel using alternating optimization

Hehao Niu, Bangning Zhang, Daoxing Guo +1 more

In this paper, we investigate the secure transmission in multiple-input multiple-output (MIMO) communication systems with simultaneous wireless information and power transfer (SWIPT), where the energy receivers (ERs) may eavesdrop the confidential information send to the desired receiver (DR). By taking into account both artificial noise (AN) and power splitting (PS), we aim to maximize the secrecy rate at the DR by jointly designing the precoding matrix, AN covariance matrix and PS ratio at the desired receiver, under the transmit power constraint and the energy harvesting (EH) constraints at all the receivers. To solve the formulated non-convex problem, we propose an alternating optimization (AO) algorithm through a judicious reformulation, wherein the problem is handled by solving a series of convex problems in an alternating method. Finally, numerical results are provided to validate our proposed algorithm.

IEEE International Conference on Signal Processing, Communications and Computing (ICSPCC)•Oct 1, 2017•1 citation
Considering simultaneous wireless information and power transfer (SWIPT), we investigate cooperative-jamming (CJ) aided robust secure transmission design in multiple-input-single-output channels, where a cooperative jammer introduces jamming interferences and assists a source to supply wireless power for both an energy receiver and a legitimate destination. The destination employs a power splitting (PS) scheme to split the received signals for both information decoding and energy harvesting (EH). Compared with conventional transmission without SWIPT, the transmission with SWIPT should satisfy additional worst-case EH constraints. Furthermore, the PS scheme introduces an additional multiplicative optimization variable, i.e., the PS factor. Our objective is to maximize worst-case secrecy rate under transmit power constraints and worst-case EH constraints. We propose to decouple the problem into three optimization problems and employ alternating optimization algorithm to obtain the locally optimal solution. For the optimization of transmit covariance matrices and PS factor, we propose to employ the S-procedure and its extension to reformulate it as a convex semidefinite programming. It is shown through the simulation results that our proposed CJ aided robust secure transmission scheme outperforms the robust direct transmission scheme without CJ and the CJ aided non-robust scheme.
Considering simultaneous wireless information and power transfer (SWIPT), we study a multiple-input- single-output (MISO) secrecy channel which consists of a multi-antenna trans- mitter and a cooperative jammer (CJ), multiple multi-antenna energy receivers (ERs), i.e., potential eavesdroppers, and multiple single-antenna co-located receivers (CRs). Both transmitter and CJ send the intend signal with artificial noise (AN) and jamming signal to interfere with the ERs. All receivers (CRs and ERs) adopt a power splitter to decode information and harvest power simultaneously. We exploit AN and CJ to facilitate efficient wireless energy transfer and secure transmission. Our aim is to maximize the minimum harvested energy among all ERs and CRs subject to the total power constraints at the transmitter and CJ while guaranteeing the minimum secrecy rate for each CR above its requirement. By incorporating norm-bounded channel uncertainty model, we propose a joint design of robust secure transmission. The original problem is solved by a two- step approach. In the first step, the proposed problem is reformulated as a sequence of semidefinite programs (SDPs). In the second step, the proposed problem can be handled by one-dimensional search to attain the optimal solution. Simulation results indicate that the performance of the proposed scheme outperforms that of separated AN-aided or CJ-aided scheme.
For simultaneous wireless information and power transfer (SWIPT), secure communication is an important issue. In this letter, we consider a wireless multiple-input-single-output secure communication system with SWIPT overheard by multiple multi-antenna eavesdroppers. In the system, a transmitter employs artificial noise (AN)-aided transmission and a legitimate receiver employs power splitting (PS) to harvest energy. Our objective is to jointly design AN-aided transmission and PS scheme which maximizes achievable secrecy rate under transmit power constraint and energy harvesting constraint. We propose to include an equality constraint to convert the constraint on information rate from transmitter to eavesdroppers into linear matrix inequalities. Replacing the equality constraint with a convex constraint and a concave constraint, we propose to employ constrained concave convex procedure based algorithm to find a local optimum of the problem. Simulation results demonstrate that the proposed joint optimization of AN-aided transmission and PS scheme outperforms the non-AN-aided one.
This letter investigates a multiple-input single-output secrecy channel, where the legitimate user and the eavesdroppers employ a power splitting scheme for information decoding and energy harvesting (EH), simultaneously. An artificial noise is embedded to the information bearing signal to interfere the eavesdroppers and to harvest power by all receivers (i.e., legitimate user and eavesdroppers). We consider the robust secrecy rate maximization problem subject to the transmit power and the EH constraints by incorporating the norm-bounded channel uncertainty. This robust optimization problem is not convex, and thus, it can be reformulated as a convex one along with matrix transformations and convex conic optimization techniques, which is iteratively solved based on constrained concave-convex procedure-based algorithm. Finally, numerical results are provided to validate our proposed algorithm.
In this letter, considering the simultaneous wireless information and power transfer scheme, we study the robust artificial noise (AN)-aided secure transmission design in multiple-input-single-output channels where the channel uncertainties are modeled by worst-case model. Our objective is to maximize the worst-case secrecy rate with respect to both the worst-case channel uncertainties and the worst-case eavesdropper among multiple eavesdroppers, under the transmit power constraint and the worst-case energy harvesting constraint. The optimal solution to the problem can be found by two-dimensional (2-D) search. Since the 2-D search algorithm has high computational complexity, we propose to neglect the correlation of the channel uncertainties from the transmitter to the information-decoding receiver and reformulate the problem as a sequence of convex semidefinite programming (SDP) which is solved efficiently by SDP based one-dimensional line search method. It is shown through computer simulations that the proposed robust AN-aided secure transmission schemes have significant performance gain over the non-robust AN-aided secure transmission scheme and the robust secure transmission scheme without the aid of AN.
This paper addresses robust designs of secure simultaneous wireless information and power transfer for multiple-input single-output (MISO) multiuser systems. By using a bounded uncertainty model for the channel state information (CSI) from transmitters to legitimate receivers and under the assumption of only available statistic knowledge of the CSI to eavesdroppers, we consider the robust designs with both worst-case and chance-constrained optimizations. To jointly optimize transmit beamforming vectors and power splitting factors, we formulate three problems aiming at minimizing the system power, maximizing the sum secrecy rate, and maximizing the minimal secrecy rate, respectively, subject to both energy harvesting and secrecy outage constraints. These problems are intractable in their original forms due to the CSI models and their non-convexity. To reach computationally efficient solutions, we first rewrite the original problems by semi-definite relaxation, then transform the CSI uncertainty related constraints by S-procedure, and finally approximate the non-convex constraints by the first-order Taylor expansion. By the reformulations, we present iterative successive convex approximation algorithm for approaching the optimized solutions. Simulation results under various setups of system parameters are provided to examine the system performance and validate the effectiveness of the proposed schemes.
In this paper, we investigate the secure transmission in multiple-input multiple-output (MIMO) communication systems with simultaneous wireless information and power transfer (SWIPT), where the energy receivers (ERs) may eavesdrop the confidential information send to the desired receiver (DR). By taking into account both artificial noise (AN) and power splitting (PS), we aim to maximize the secrecy rate at the DR by jointly designing the precoding matrix, AN covariance matrix and PS ratio at the desired receiver, under the transmit power constraint and the energy harvesting (EH) constraints at all the receivers. To solve the formulated non-convex problem, we propose an alternating optimization (AO) algorithm through a judicious reformulation, wherein the problem is handled by solving a series of convex problems in an alternating method. Finally, numerical results are provided to validate our proposed algorithm.