Improving Secrecy Performance of a Wirelessly Powered network

This paper considers the secrecy communication of a wirelessly powered network, where an energy constrained legitimate transmitter (Alice) sends message to a legitimate receiver (Bob) with the energy harvested from a dedicated power beacon (PB), while an eavesdropper (Eve) intends to intercept the information. A simple time-switching protocol with a time-switching ratio $\alpha$ is used to supply power for the energy constrained legitimate transmitter. To improve the physical layer security, we firstly propose a protocol that combines maximum ratio transmission (MRT) with zero-forcing (ZF) jamming for the case where Eve is passive in the network, so that Alice only has access to the channel state information (CSI) of Bob. Then we propose a protocol that uses a ZF transmitting strategy to minimize the signal-to-noise ratio (SNR) at Eve for the case where Eve is active in the network, so that Alice only has access to the partial CSI of Eve. Closed-form expressions and simple approximations of the connection outage probability and secrecy outage probability are derived for both protocols. Furthermore, the secrecy throughput as well as the diversity orders achieved by our proposed protocols are characterized and the optimal time-switching ratio $\alpha$ and power allocation coefficient $\beta$ for secrecy throughput maximization are derived in the high SNR regime. Finally, numerical results validate the effectiveness of the proposed schemes

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

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 multi-antenna 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 formulate the sum secrecy throughput optimization problem of all the nodes. The optimization variables are the duration of the time slots and the BS beamforming vectors in different time slots. The problem is shown to be non-convex. 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 non-information transmission time slot and the optimal time slots are derived. We then consider fairness among the nodes and propose max-min fair (MMF) and proportional fair (PLF) algorithms. The MMF algorithm maximizes the minimum secrecy throughput of the nodes, while the PLF tries to achieve a good trade-off between the sum secrecy throughput and fairness among the nodes. Through 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 the proposed fair algorithms

Secure Communication with a Wireless-Powered Friendly Jammer

In this paper, we propose to use a wireless-powered friendly jammer to enable secure communication between a source node and destination node, in the presence of an eavesdropper. We consider a two-phase communication protocol with fixed-rate transmission. In the first phase, wireless power transfer is conducted from the source to the jammer. In the second phase, the source transmits the information-bearing signal under the protection of a jamming signal sent by the jammer using the harvested energy in the first phase. We analytically characterize the long-time behavior of the proposed protocol and derive a closed-form expression for the throughput. We further optimize the rate parameters for maximizing the throughput subject to a secrecy outage probability constraint. Our analytical results show that the throughput performance differs significantly between the single-antenna jammer case and the multi-antenna jammer case. For instance, as the source transmit power increases, the throughput quickly reaches an upper bound with single-antenna jammer, while the throughput grows unbounded with multi-antenna jammer. Our numerical results also validate the derived analytical results.Comment: accepted for publication in IEEE Transactions on Wireless Communication

Secure wireless powered and cooperative jamming D2D communications

This paper investigates a secure wireless-powered device-to-device (D2D) communication network in the presence of multiple eavesdroppers, where a hybrid base station (BS) in a cellular network not only provides power wirelessly for the D2D transmitter to guarantee power efficiency for the D2D network, but also serves as a cooperative jammer (CJ) to interfere with the eavesdroppers. The cellular and D2D networks can belong to different service providers, which means that the D2D transmitter would need to pay for the energy service released by the hybrid BS to guarantee secure D2D communication. In order to exploit the hierarchical interaction between the BS and the D2D transmitter, we first formulate a Stackelberg game based energy trading scheme, where the quadratic energy cost model is considered. Then, a non-energy trading based Stackelberg game is investigated to study the reversed roles of the BS and the D2D users. For comparison, we also formulate and resolve the social welfare optimization problem. We derive the closed-form Stackelberg equilibriums of the formulated games and the optimal solutions for the social welfare optimization problem. Simulation results are provided to validate our proposed schemes to highlight the importance of energy trading interaction between cellular and D2D networks