This letter studies the secure communication between a wireless powered source node and a destination node in the presence of multiple eavesdroppers. We propose a hybrid base station (BS) scheme where the hybrid BS first transfers wireless power to the source and then performs cooperative jamming while the source transmits the information signal using the harvested energy. We maximize the secrecy throughput by jointly optimizing the time allocation, source transmit power, and redundancy rate under the secrecy constraint and transmit power constraint. We transform the secrecy throughput maximization problem into a convex optimization problem and obtain the optimal solutions efficiently. Numerical results illustrate that our solution is superior to other benchmark schemes.
This letter studies the secure communication between a wireless powered source node and a destination node in the presence of multiple eavesdroppers. We propose a hybrid base station (BS) scheme where the hybrid BS first transfers wireless power to the source and then performs cooperative jamming while the source transmits the information signal using the harvested energy. We maximize the secrecy throughput by jointly optimizing the time allocation, source transmit power, and redundancy rate under the secrecy constraint and transmit power constraint. We transform the secrecy throughput maximization problem into a convex optimization problem and obtain the optimal solutions efficiently. Numerical results illustrate that our solution is superior to other benchmark schemes.
This letter considers wireless-powered cooperative jamming to secure communication between a transmitter (Tx) and an information receiver, in the presence of an energy receiver (ER), which is termed a potential eavesdropper. The full-duplex jammer harvests energy from the Tx's information signal and transmits jamming signal at the same time, where the jamming signal not only confounds the ER (potential eavesdropper) but also charges the ER. Our goal is to maximize the secrecy information rate by jointly optimizing the power allocation at the Tx and jammer, while maintaining the harvested energy requirement of the ER. The studied problem is non-convex and we propose the optimal solution based on the Lagrange method. Simulation results show that the proposed scheme significantly outperforms the benchmark schemes.
This paper investigates secure communication from a wireless-powered transmitter to a desired receiver with multiple eavesdroppers in the wireless powered communication networks (WPCNs). Considering the non-linear energy harvesting (EH) model, we propose a secure two-phase communication protocol with the help of a hybrid base station (HBS). First, in the power transfer (PT) phase, the HBS transfers wireless power to the transmitter. Then in the subsequent secure information transmission (SIT) phase, the transmitter sends the secret information using the energy harvested in the PT, under the protection of artificial noise (AN) generated by the HBS. First, based on this communication protocol, we maximize the secrecy throughput with perfect channel information state (CSI) under the transmit power constraint at the HBS. The secrecy throughput maximization (STM) problem is non-convex, and hence we reformulate it by exploiting the primal decomposition method (PDM) to obtain tractable forms. The PDM-based transmit scheme (PDM-TS) is proposed for the STM. In addition, considering the imperfect CSI of wiretap channel, we further design the robust transmit scheme for the worst-case secrecy throughput maximization (wSTM) problem. Since the wSTM shows high non-convexity, we extend the PDM by combining it with the S -procedure, and the PDM-based robust transmit scheme (PDM-RTS) is proposed for the wSTM. Finally, the numerical simulations are provided to show the effectiveness of the proposed transmit schemes.
This paper studies the secrecy communication in an orthogonal frequency division multiplexing system, where a source sends confidential information to a destination in the presence of a potential eavesdropper. We employ wireless powered cooperative jamming to improve the secrecy rate of this system with the assistance of a cooperative jammer, which works in the harvest-then-jam protocol over two time slots. In the first slot, the source sends dedicated energy signals to power the jammer; in the second slot, the jammer uses the harvested energy to jam the eavesdropper, in order to protect the simultaneous secrecy communication from the source to the destination. In particular, we consider two types of receivers at the destination, namely Type-I and Type-II receivers, which do not have and have the capability of canceling the (a priori known) jamming signals, respectively. For both types of receivers, we maximize the secrecy rate at the destination by jointly optimizing the transmit power allocation at the source and the jammer over sub-carriers, as well as the time allocation between the two time slots. First, we present the globally optimal solution to this problem via the Lagrange dual method, which, however, is of high implementation complexity. Next, to balance the tradeoff between the algorithm complexity and performance, we propose alternative low-complexity solutions based on the minorization maximization and heuristic successive optimization, respectively. Simulation results show that the proposed approaches significantly improve the secrecy rate, as compared to benchmark schemes without joint power and time allocation.
We consider wireless secure communications between a source and a destination aided by a multi-antenna relay, in the presence of an eavesdropper. In particular, two cooperation schemes of the relay are explored: cooperative relaying (CR) and cooperative jamming (CJ). We first investigate the transmit weight optimization of CR and CJ, for both cases with and without the eavesdropper's channel state information (ECSI). Then, for the case with ECSI, we derive the conditions under which CR achieves a higher secrecy rate than CJ; for the case without ECSI, we compare the secrecy rates of CR and CJ in high transmit power regimes. Building on this, we propose a novel hybrid scheme in which the relay utilizes both CR and CJ, and study the power allocation of the relay between CR and CJ for maximizing the secrecy rate under individual power constraints. Further, we study the case with imperfect channel state information (CSI) for both CR and CJ. At last, extensive numerical results are provided.
In this paper, we consider a secrecy wireless powered communication network, where an information source (IS) transmits message to a legitimate information receiver (IR) with the energy it harvests from the energy source (ES) and a full-duplex (FD) active eavesdropper (AE) performs eavesdropping and jamming simultaneously with the energy it harvests from the ES. With a goal to maximize the achievable secrecy rate, we jointly optimize the energy beamforming and the artificial noise (AN) beamforming at the ES, the information beamforming at the IS and the energy transfer time at the ES. Numerical results are given to show the superiority of our proposed scheme.
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.