This paper investigates a secure wireless-powered sensor network (WPSN) with the aid of a cooperative jammer (CJ). A power station (PS) wirelessly charges for a user equipment (UE) and the CJ to securely transmit information to an access point (AP) in the presence of multiple eavesdroppers. Also, the CJ are deployed, which can introduce more interference to degrade the performance of the malicious eavesdroppers. In order to improve the secure performance, we formulate an optimization problem for maximizing the secrecy rate at the AP to jointly design the secure beamformer and the energy time allocation. Since the formulated problem is not convex, we first propose a global optimal solution which employs the semidefinite programming (SDP) relaxation. Also, the tightness of the SDP relaxed solution is evaluated. In addition, we investigate a worst-case scenario, where the energy time allocation is achieved in a closed form. Finally, numerical results are presented to confirm effectiveness of the proposed scheme in comparison to the benchmark scheme.
This paper investigates a secure wireless-powered sensor network (WPSN) with the aid of a cooperative jammer (CJ). A power station (PS) wirelessly charges for a user equipment (UE) and the CJ to securely transmit information to an access point (AP) in the presence of multiple eavesdroppers. Also, the CJ are deployed, which can introduce more interference to degrade the performance of the malicious eavesdroppers. In order to improve the secure performance, we formulate an optimization problem for maximizing the secrecy rate at the AP to jointly design the secure beamformer and the energy time allocation. Since the formulated problem is not convex, we first propose a global optimal solution which employs the semidefinite programming (SDP) relaxation. Also, the tightness of the SDP relaxed solution is evaluated. In addition, we investigate a worst-case scenario, where the energy time allocation is achieved in a closed form. Finally, numerical results are presented to confirm effectiveness of the proposed scheme in comparison to the benchmark scheme.
In this work, we investigate a wireless powered communication network (WPCN) where multiple eavesdroppers attempt to intercept the information between a hybrid access-point (H-AP) and an energy harvesting (EH) user. During the first energy transfer (ET) phase, the EH user and an EH cooperative jammer harvest energy from the transmitted signals of the H- AP. Then, in the next information transfer (IT) phase, the user sends confidential information to the H-AP while the jammer broadcasts artificial noises to the eavesdroppers by utilizing their previously harvested energy. We particularly consider optimization of the time allocation between the ET and the IT phases by which the secrecy rate is maximized. To cut down a computational burden, a low-complexity closed-form solution of the time allocation factor with some interesting behaviors will be proposed by a worst-case approximation. Through simulation results, we evaluate the performance of our proposed scheme and show that a performance gain compared to conventional schemes becomes clearer with the increased number of eavesdroppers.
In this article, we study a robust beamforming design for multiuser multiple-input–multiple-output secrecy networks with simultaneous wireless information and power transfer (SWIPT). In this system, an access point, multiple Internet-of-Things (IoT) devices under the nonlinear energy harvesting (EH) model with a help of one cooperative jammer (CJ). We employ artificial noise (AN) generation to facilitate efficient wireless energy transfer and secure transmission. To achieve EH fairness, we aim to maximize the minimum harvested energy among users subject to secrecy rate constraint and total transmit power constraint in the presence of channel estimation errors. By incorporating a norm-bounded channel uncertainty model, the original robust problem is transformed into a two-layer optimization problem, where the inner layer problem is reformulated as semidefinite programming (SDP) and the outer layer problem is solved by a one-dimensional (1-D) line search algorithm. In addition, in order to reduce computational complexity, we propose an algorithm based on sequential parametric convex approximation (SPCA). Finally, simulation results show that the proposed SPCA method achieves the same performance as the two-layer algorithm with much lower complexity.
Cooperative jamming (CJ) is a promising technique for enhancing the physical-layer security in wireless powered sensor networks. The secrecy performance of CJ-aided wireless powered sensor networks is affected by three issues including disguised eavesdropper as cooperative node, estimation error of the channel between sink node and each sensor node, and distance-related limitation on the transmit power of cooperative nodes. To address the above issues, this paper proposes a CJ-aided secure communication scheme for wireless powered sensor networks with disguised eavesdropper and imperfect channel estimation. Since each cooperative node could be the disguised eavesdropper, the proposed scheme incorporates all possible cases of the eavesdropper disguising itself as unfixed cooperative jamming node. The maximization of secrecy rate over all possible cases is formulated for designing secrecy optimization problem. The imperfect channel estimation and distance-related jamming power limitation are both integrated as constraints into the secrecy rate maximization problem. Since the original optimization problem is complex and non-convex, a two-level optimization algorithm is proposed to solve it. Simulation results show that the proposed scheme achieves significant secrecy rate improvement over typical existing schemes.
In this paper, we consider a wireless powered communication network with an energy harvesting (EH) jammer where eavesdroppers try to wiretap the communication between users and a hybrid access-point (H-AP). In our system, the H-AP first transmits an energy signal to recharge the batteries of the EH users and the EH jammer in the energy transfer (ET) phase. Then, in the subsequent information transfer (IT) phase, each user sends information to the H-AP in a time division multiple access manner, while the jammer generates jamming signals to interfere the eavesdroppers. We adopt two different secrecy performance measurements according to the level of channel state information (CSI) of the eavesdroppers. First, with a single user, we maximize the secrecy rate by optimizing the time allocation between the ET and the IT phase when perfect CSI of the eavesdroppers is available at all nodes. In contrast, when the instantaneous CSI of the eavesdroppers is not available at legitimate nodes, we analyze and minimize the secrecy outage probability. We also extend the single user analysis to a more general multi-user situation with an additional consideration of the transmit power allocation at the jammer. Finally, we evaluate the performance of our proposed solutions through simulations and demonstrate that a performance gain compared to conventional schemes becomes more pronounced with the increased number of eavesdroppers and users.
This paper investigates cooperative security in wireless networks, where a source (Alice) intends to transmit a confidential message to a legitimate destination (Bob), with the help of a cooperative jammer (Charlie), coexisting with multiple passive eavesdroppers (Eves). In particular, by assuming knowledge of Bob's perfect channel state information (CSI) but only Eves’ statistical CSIs, secrecy beamforming with artificial noise (AN) is utilized for secure transmission, and cooperative jamming (CJ) is explored to further enhance secrecy. We first derive an accurate closed-form expression for the secrecy outage probability (SOP), and establish the condition under which positive secrecy rate is achievable. Then, we provide a secure transmit design for maximizing the SOP constrained secrecy rate. Moreover, based on a strict mathematical analysis, we characterize the impact of the main channel quality and the number of Eves on transmit design and secrecy performance. Specifically, optimal power allocation ratio between the information-bearing signal and the AN signal increases as the main channel quality improves, and decreases with the number of Eves. Numerical results confirm that our design achieves performance improvement in terms of both secrecy rate and secure energy efficiency, as compared to the approach without CJ.
This paper investigates a wireless powered secure communication network (WPSCN), in which the legitimate users have no constant energy supply and need to be wireless powered for information transmitting. The harvest-then-transmit protocol is adopted in the WPSCN, i.e., the energy access point (EAP) first transfers energy to legitimate users through energy beamforming, and then, the legitimate users transmit their data to the information access point (IAP) by time-division multiple access. Since an eavesdropper intercepts users’ uplink information, the EAP creates artificial noise to cripple the interception capability of the eavesdropper. For providing a secrecy throughput balancing across different legitimate users, we aim to maximize the minimum secrecy throughput of all users via time allocation, energy beamforming, and artificial noise design. To this end, a low-complexity two-stage algorithm is proposed. In the first stage, without taking into account the eavesdropper's wiretapping, we design time allocation and energy beamforming by solving the problem of minimum throughput maximization, which is convex and can be easily solved. In the second stage, two easily implementable strategies are proposed for artificial noise design so as to strengthen the noise power at the eavesdropper and simultaneously reduce the noise power at the IAP. Simulation results show that the performance of the proposed approach is close to the upper bound and not sensitive to scenario settings, which confirms the effectiveness of the proposed method.