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

International Conference on Communications

Secrecy Throughput Maximization for Full-Duplex Wireless Powered Communication Networks

Roohollah Rezaei, Sumei Sun, Xin Kang, Yong Liang Guan, Mohammad Reza Pakravan

Published May 1, 2019• 1 citation
Publisher

Abstract

In this paper, we investigate the secrecy throughput for a full-duplex wireless powered communication network. A multi-antenna base station (BS) transmits energy towards nodes all the time and each node harvests energy prior to its transmission time slot. Nodes sequentially transmit their confidential information to the BS in presence of other nodes which are considered as potential eavesdroppers. We derive the secrecy rate and formulate the sum secrecy throughput optimization of all nodes. The optimization variables are the time slot duration and the BS beamforming during different transmission phases. The problem is non-convex and non-trivial. We propose a suboptimal approach in which the BS focuses its beamforming to blind the potential eavesdroppers (other nodes) during the information transmission phase, with which we then obtain the optimum beamforming in each time slot and its duration. We compare our algorithm with uniform time slot and uniform beamforming in different settings and demonstrate its superior performance.

DOI
10.1109/icc.2019.8761724

Related papers

Secrecy Throughput Maximization for Full-Duplex Wireless Powered IoT Networks Under Fairness Constraints

Roohollah Rezaei, Sumei Sun, Xin Kang +2 more

In this paper, we study the secrecy throughput of a full-duplex wireless powered communication network (WPCN) for Internet of Things (IoT). The WPCN consists of a full-duplex multiantenna base station (BS) and a number of sensor nodes. The BS transmits energy all the time, and each node harvests energy prior to its transmission time slot. The nodes sequentially transmit their confidential information to the BS, and the other nodes are considered as potential eavesdroppers. We first aim to optimize the sum secrecy throughput of the nodes. The optimization variables are the duration of the time slots and the BS beamforming vectors in different time slots. The optimization problem is shown to be nonconvex. To tackle the problem, we propose a suboptimal two stage approach, referred to as sum secrecy throughput maximization (SSTM). In the first stage, the BS focuses its beamforming to blind the potential eavesdroppers (other nodes) during information transmission time slots. Then, the optimal beamforming vector in the initial noninformation transmission time slot and the optimal time slots are derived. We then consider secrecy throughput fairness among the nodes and propose max-min fair (MMF) and proportional fair (PF) algorithms. The MMF algorithm maximizes the minimum secrecy throughput of the nodes, while the PF achieves a good tradeoff between the sum secrecy throughput and fairness among the nodes. Through the numerical simulations, we first demonstrate the superior performance of the SSTM to uniform time slotting and beamforming in different settings. Then, we show the effectiveness of MMF and PF algorithms.

arXiv:1901.09631•IEEE Internet of Things Journal•Apr 25, 2019•28 citations

Secrecy Throughput Maximization for Massive MIMO Wireless Powered Communication Networks

Roohollah Rezaei, Sumei Sun, Xin Kang +2 more

In this paper, we study the secrecy throughput in a massive Multiple-Input-Multiple-Output (MIMO) full-duplex wireless powered communication network (WPCN). The network consists of a massive MIMO base station (BS) and two groups of single-antenna sensor nodes which harvest energy from the BS. The first group, referred to as information transmitters (ITs), use the harvested energy to transmit information back to the BS; the second group, referred to as energy receivers (ERs), use the harvested energy for non-transmission related operations. We consider a two-slot protocol. In the first time slot, all nodes harvest energy from the BS. In the second slot, ITs transmit information to the BS, while BS use one set of its antennas to receive the signals and the other set of antennas to transmit artificial noise (AN) to the ERs. The AN serves two purposes: wireless power transfer to the ERs, and information security for the ITs with ERs, which are considered as potential eavesdroppers. We aim to maximize the total secrecy throughput of ITs subject to the ERs' received energy constraints. The problem is shown to be non-convex. To tackle the problem, we propose a twostage suboptimal approach, referred to as Maximizing Received AN aided Secrecy Throughput Maximization (MRAN-STM). In the first stage, the transmitted AN is optimized to maximize the minimum received AN of all the ERs. Then, in the second stage, the power allocation and time slot duration are optimized to maximize the total secrecy throughput. Numerical results show the improvement of the proposed algorithm.

Globecom•Dec 1, 2019•5 citations

Secure Beamforming for Full-Duplex Wireless Powered Communication Systems With Self-Energy Recycling

Wei Qiang Wu, Baoyun Wang, Zhixiang Deng +1 more

In this letter, we study a novel multi-antenna wireless powered communication (WPC) system consisting of an energy source (ES), a full-duplex self-energy recycling information source (IS), an information receiver (IR), and an energy receiver (ER) (potential eavesdropper). The energy-constrained IS, powered by ES, sends the confidential information to IR over the wiretap channel. Our goal is to maximize the secrecy rate for IR by jointly optimizing the energy and information beamforming vectors, under the constraints of the transmit power at ES and IS and the harvested energy at ER. To solve the formulated non-convex problem, a partial Lagrange dual method coupled with two-stage optimization method is proposed, which derives the optimal solution in semi-closed form. Numerical results show the superiority of our proposed design compared with the existing schemes.

IEEE Wireless Communications Letters•Dec 21, 2016•28 citations

Secure Transmission in Wireless Powered Communication Networks with Full-Duplex Receivers

Qun Li, Ding Xu

This letter studies secure communication in a wireless powered communication network with a full-duplex destination node, who applies either power splitting (PS) or time switching (TS) to coordinate energy harvesting and information decoding of received signals and transmits jamming signals to the eavesdropper using the harvested energy. The secrecy rate is maximized by optimizing PS or TS ratio and power allocation. We propose iterative algorithms with power allocation optimized by the successive convex approximation method. Simulation results demonstrate that the proposed algorithms are superior to other benchmark algorithms.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Apr 30, 2019•2 citations

Artificial-noise-aided secure beamforming in full-duplex wireless-powered relay

Myoungjun Ko, Sangseok Yun, Junguk Park +1 more

This paper studies a wireless powered relaying (WPR) system in which a source transmits an information signal to a destination with the help of an energy constrained relay in the presence of an eavesdropper. This work considers a scenario in the full-duplex WPR system where the information transmission/reception and the energy harvesting are performed simultaneously at the relay. We first derive an achievable secrecy rate of the system and formulate a joint optimization problem of artificial-noise-aided secure beamforming to maximize the achievable secrecy rate. Then, an efficient semi-definite relaxation (SDR) based algorithm is proposed to obtain the optimal beamforming. Furthermore, we also propose three suboptimal beamforming but low computational complexity schemes. Comparisons are carried out among the performances of the proposed optimal and suboptimal schemes.

IEEE Wireless Communications and Networking Conference•Apr 1, 2018•1 citation

A High Data Rate Wireless Communication System With Improved Secrecy: Full Duplex Beamforming

Özge Cepheli, Semiha Tedik Başaran, Güneş Karabulut Kurt

We formulate a joint beamforming vector and power optimization problem for multi-antenna full duplex transmission systems and show that simultaneous transmissions of information bearing signals of legitimate nodes can be optimized to act as artificial noise against eavesdroppers. The proposed system improves the overall throughput, while maintaining secrecy and QoS levels within desired signal-to-interference-plus-noise ratio bounds, without additional power, as verified via simulations.

IEEE Communications Letters•Apr 30, 2014•27 citations
In this paper, we investigate the secrecy throughput for a full-duplex wireless powered communication network. A multi-antenna base station (BS) transmits energy towards nodes all the time and each node harvests energy prior to its transmission time slot. Nodes sequentially transmit their confidential information to the BS in presence of other nodes which are considered as potential eavesdroppers. We derive the secrecy rate and formulate the sum secrecy throughput optimization of all nodes. The optimization variables are the time slot duration and the BS beamforming during different transmission phases. The problem is non-convex and non-trivial. We propose a suboptimal approach in which the BS focuses its beamforming to blind the potential eavesdroppers (other nodes) during the information transmission phase, with which we then obtain the optimum beamforming in each time slot and its duration. We compare our algorithm with uniform time slot and uniform beamforming in different settings and demonstrate its superior performance.
In this paper, we study the secrecy throughput of a full-duplex wireless powered communication network (WPCN) for Internet of Things (IoT). The WPCN consists of a full-duplex multiantenna base station (BS) and a number of sensor nodes. The BS transmits energy all the time, and each node harvests energy prior to its transmission time slot. The nodes sequentially transmit their confidential information to the BS, and the other nodes are considered as potential eavesdroppers. We first aim to optimize the sum secrecy throughput of the nodes. The optimization variables are the duration of the time slots and the BS beamforming vectors in different time slots. The optimization problem is shown to be nonconvex. To tackle the problem, we propose a suboptimal two stage approach, referred to as sum secrecy throughput maximization (SSTM). In the first stage, the BS focuses its beamforming to blind the potential eavesdroppers (other nodes) during information transmission time slots. Then, the optimal beamforming vector in the initial noninformation transmission time slot and the optimal time slots are derived. We then consider secrecy throughput fairness among the nodes and propose max-min fair (MMF) and proportional fair (PF) algorithms. The MMF algorithm maximizes the minimum secrecy throughput of the nodes, while the PF achieves a good tradeoff between the sum secrecy throughput and fairness among the nodes. Through the numerical simulations, we first demonstrate the superior performance of the SSTM to uniform time slotting and beamforming in different settings. Then, we show the effectiveness of MMF and PF algorithms.
In this paper, we study the secrecy throughput in a massive Multiple-Input-Multiple-Output (MIMO) full-duplex wireless powered communication network (WPCN). The network consists of a massive MIMO base station (BS) and two groups of single-antenna sensor nodes which harvest energy from the BS. The first group, referred to as information transmitters (ITs), use the harvested energy to transmit information back to the BS; the second group, referred to as energy receivers (ERs), use the harvested energy for non-transmission related operations. We consider a two-slot protocol. In the first time slot, all nodes harvest energy from the BS. In the second slot, ITs transmit information to the BS, while BS use one set of its antennas to receive the signals and the other set of antennas to transmit artificial noise (AN) to the ERs. The AN serves two purposes: wireless power transfer to the ERs, and information security for the ITs with ERs, which are considered as potential eavesdroppers. We aim to maximize the total secrecy throughput of ITs subject to the ERs' received energy constraints. The problem is shown to be non-convex. To tackle the problem, we propose a twostage suboptimal approach, referred to as Maximizing Received AN aided Secrecy Throughput Maximization (MRAN-STM). In the first stage, the transmitted AN is optimized to maximize the minimum received AN of all the ERs. Then, in the second stage, the power allocation and time slot duration are optimized to maximize the total secrecy throughput. Numerical results show the improvement of the proposed algorithm.
In this letter, we study a novel multi-antenna wireless powered communication (WPC) system consisting of an energy source (ES), a full-duplex self-energy recycling information source (IS), an information receiver (IR), and an energy receiver (ER) (potential eavesdropper). The energy-constrained IS, powered by ES, sends the confidential information to IR over the wiretap channel. Our goal is to maximize the secrecy rate for IR by jointly optimizing the energy and information beamforming vectors, under the constraints of the transmit power at ES and IS and the harvested energy at ER. To solve the formulated non-convex problem, a partial Lagrange dual method coupled with two-stage optimization method is proposed, which derives the optimal solution in semi-closed form. Numerical results show the superiority of our proposed design compared with the existing schemes.
This letter studies secure communication in a wireless powered communication network with a full-duplex destination node, who applies either power splitting (PS) or time switching (TS) to coordinate energy harvesting and information decoding of received signals and transmits jamming signals to the eavesdropper using the harvested energy. The secrecy rate is maximized by optimizing PS or TS ratio and power allocation. We propose iterative algorithms with power allocation optimized by the successive convex approximation method. Simulation results demonstrate that the proposed algorithms are superior to other benchmark algorithms.
This paper studies a wireless powered relaying (WPR) system in which a source transmits an information signal to a destination with the help of an energy constrained relay in the presence of an eavesdropper. This work considers a scenario in the full-duplex WPR system where the information transmission/reception and the energy harvesting are performed simultaneously at the relay. We first derive an achievable secrecy rate of the system and formulate a joint optimization problem of artificial-noise-aided secure beamforming to maximize the achievable secrecy rate. Then, an efficient semi-definite relaxation (SDR) based algorithm is proposed to obtain the optimal beamforming. Furthermore, we also propose three suboptimal beamforming but low computational complexity schemes. Comparisons are carried out among the performances of the proposed optimal and suboptimal schemes.