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.
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 investigate 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 node (Charlie), in the presence of multiple independent eavesdroppers (Eves). In particular, cooperative jamming (CJ) is explored to enhance secure communication between Alice and Bob. We provide a transmit design to maximize the secrecy rate, subject to a secrecy outage probability (SOP) constraint. Specifically, we establish a condition under which positive secrecy rate can be guaranteed. In addition to secrecy rate performance, we also pay attention to the secure energy efficiency, defined as the ratio of secrecy rate to total power consumption. Numerical results validate the effectiveness and energy efficiency of our proposed CJ 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.
Physical (PHY) layer security approaches for wireless communications can prevent eavesdropping without upper layer data encryption. However, they are hampered by wireless channel conditions: absent feedback, they are typically feasible only when the source-destination channel is better than the source-eavesdropper channel. Node cooperation is a means to overcome this challenge and improve the performance of secure wireless communications. This paper addresses secure communications of one source-destination pair with the help of multiple cooperating relays in the presence of one or more eavesdroppers. Three cooperative schemes are considered: decode-and-forward (DF), amplify-and-forward (AF), and cooperative jamming (CJ). For these schemes, the relays transmit a weighted version of a reencoded noise-free message signal (for DF), a received noisy source signal (for AF), or a common jamming signal (for CJ). Novel system designs are proposed, consisting of the determination of relay weights and the allocation of transmit power, that maximize the achievable secrecy rate subject to a transmit power constraint, or, minimize the transmit power subject to a secrecy rate constraint. For DF in the presence of one eavesdropper, closed-form optimal solutions are derived for the relay weights. For other problems, since the optimal relay weights are difficult to obtain, several criteria are considered leading to suboptimal but simple solutions, i.e., the complete nulling of the message signals at all eavesdroppers (for DF and AF), or the complete nulling of jamming signal at the destination (for CJ). Based on the designed relay weights, for DF in the presence of multiple eavesdroppers, and for CJ in the presence of one eavesdropper, the optimal power allocation is obtained in closed-form; in all other cases the optimal power allocation is obtained via iterative algorithms. Numerical evaluation of the obtained secrecy rate and transmit power results show that the proposed design can significantly improve the performance of secure wireless communications.
We consider a cooperative wireless network, and exploit node cooperation for achieving physical layer based security. The case of one source, multiple cooperating nodes and one eavesdropper is considered. Two different cooperation schemes are considered. In the first scheme, cooperating nodes transmit a weighted version of the source signal in a decode and forward fashion (DF). In the second scheme, while the source is transmitting, cooperating nodes transmit weighted noise to confound the eavesdropper (cooperative jamming (CJ)). The objective is to select the node weights and the source transmit power so that the total transmit power (source transmission power plus cooperating nodes power) under a secrecy capacity constraint is minimized. Previous works related to this problem introduced additional constraints in order to reduce the degree of difficulty, thus resulting in suboptimal solutions. In this paper, the optimal solution is considered. In particular, the closed form solution is obtained for the DF scheme, while for the CJ scheme, the problem is reduced to a univariate optimization one. For the latter problem a convergent algorithm for obtaining the solution is provided.
We consider a cooperative wireless network in the presence of one or more eavesdroppers, and exploit node cooperation for achieving physical (PHY) layer based security. Two different cooperation schemes are considered. In the first scheme, cooperating nodes retransmit a weighted version of the source signal in a decode-and-forward (DF) fashion. In the second scheme, referred to as cooperative jamming (CJ), while the source is transmitting, cooperating nodes transmit weighted noise to confound the eavesdropper. We investigate two objectives: i) maximization of the achievable secrecy rate subject to a total power constraint and ii) minimization of the total power transmit power under a secrecy rate constraint. For the first design objective, we obtain the exact solution for the DF scheme for the case of a single or multiple eavasdroppers, while for the CJ scheme with a single eavesdropper we reduce the multivariate problem to a problem of one variable. For the second design objective, existing work introduces additional constraints in order to reduce the degree of difficulty, thus resulting in suboptimal solutions. Our work raises those constraints, and obtains either an analytical solution for the DF scheme with a single eavesdropper, or reduces the multivariate problem to a problem of one variable for the CJ scheme with a single eavesdropper. Numerical results are presented to illustrate the proposed results and compare them to existing work.
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.