This letter considers cooperative jamming to secure communication in the presence of multiple eavesdroppers with finite alphabet inputs. Considering the global constraint, the joint design of artificial noise covariance matrices and power allocation between the source and the relays is studied. Specifically, we transformed the problem of artificial noise design into a semi-definite programming problem, which is efficiently solved by standard optimization method. Besides, the power allocation between the source and relays is derived by utilizing the relationship between mutual information and minimum mean square error. Furthermore, a two-step algorithm is developed to enhance the achievable secrecy rate of cooperative jamming wireless network. Numerical examples demonstrate the proposed algorithm achieves a significant gain over the conventional counterparts in terms of secrecy rate.
This letter considers cooperative jamming to secure communication in the presence of multiple eavesdroppers with finite alphabet inputs. Considering the global constraint, the joint design of artificial noise covariance matrices and power allocation between the source and the relays is studied. Specifically, we transformed the problem of artificial noise design into a semi-definite programming problem, which is efficiently solved by standard optimization method. Besides, the power allocation between the source and relays is derived by utilizing the relationship between mutual information and minimum mean square error. Furthermore, a two-step algorithm is developed to enhance the achievable secrecy rate of cooperative jamming wireless network. Numerical examples demonstrate the proposed algorithm achieves a significant gain over the conventional counterparts in terms of secrecy rate.
This letter studies secure transmission design with finite alphabet input for cooperative jamming network under individual power constraint. By adopting the zero-force scheme, where the jamming signal is fully laid in the null space of the relay-destination channel, the problem of enhancing the achievable secrecy rate is decomposed into two independent subproblems: relay weights design and power control. We reveal that the problem of relay weights design is identical to the problem of minimizing the maximal equivalent source-eavesdropper channel gain, which can be transformed into a semi-definite programming (SDP) problem and thus is tackled using interior point method. Besides, the problem of power control is solved with the fundamental relation between mutual information and minimum mean square error (MMSE). Numerical results show that the proposed scheme achieves significant performance gains compared to the conventional Gaussian design.
Cooperative beamforming and jamming are two efficient schemes to improve the physical-layer security of a wireless relay system in the presence of passive eavesdroppers. However, in most works these two techniques are adopted separately. In this letter, we propose a joint cooperative beamforming and jamming scheme to enhance the security of a cooperative relay network, where a part of intermediate nodes adopt distributed beamforming while others jam the eavesdropper, simultaneously. Since the instantaneous channel state information (CSI) of the eavesdropper may not be known, we propose a cooperative artificial noise transmission based secrecy strategy, subjected to the individual power constraint of each node. The beamformer weights and power allocation can be obtained by solving a second-order convex cone programming (SOCP) together with a linear programming problem. Simulations show the joint scheme greatly improves the security.
This paper studies the secrecy rate maximization problem of a secure wireless communication system in the presence of multiple eavesdroppers. The security of the communication link is enhanced through cooperative jamming with the help of multiple jammers. First, a feasibility condition is derived to achieve a positive secrecy rate at the destination. Then, we solve the original secrecy rate maximization problem, which is not convex in terms of power allocation at the jammers. To circumvent this nonconvexity, the achievable secrecy rate is approximated for a given power allocation at the jammers, and the approximated problem is formulated into a geometric programming one. Based on this approximation, an iterative algorithm has been developed to obtain the optimal power allocation at the jammers. Next, we provide a bisection approach, based on 1-D search, to validate the optimality of the proposed algorithm. In addition, by assuming Rayleigh fading, the secrecy outage probability (SOP) of the proposed cooperative jamming scheme is analyzed. More specifically, a single-integral form expression for the SOP is derived for the most general case, as well as a closed-form expression for the special case of two cooperative jammers and one eavesdropper. Simulation results have been provided to validate the convergence and the optimality of the proposed algorithm, as well as the theoretical derivations of the presented SOP analysis.
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 proposes a new joint cooperative beamforming and jamming (JCBJ) scheme for improving the physical layer security of decode-and-forward wireless networks where a source node transmits to its destination with the aid of multiple intermediate nodes in the presence of an eavesdropper. In the proposed JCBJ scheme, we select the intermediate nodes succeeding in source decoding as the relays to forward the source transmission simultaneously by employing a beamforming weight vector, and meanwhile, use the remaining ones as the friendly jammers to disturb the eavesdropper by sending artificial noise. In order to achieve the secrecy rate maximum, we further study on the power allocation among the source, relays, and jammers under two assumptions of the wiretap link's channel state information. We derive the closed-form optimal solutions by first allocating the transmit power at the source within different ranges to consider all the possible relay selection schemes in which different numbers of relays are employed, and then transforming the multivariable power allocation problem to a set of single-variable optimization subproblems. Our numerical results show the superiority of the proposed JCBJ scheme and the proposed power allocation strategies.
Cooperative relaying and jamming are two efficient schemes to improve the physical-layer security of a wireless transmission in the presence of an eavesdropper. In this paper, we propose a hybrid cooperative relaying and jamming mechanism to enhance the security of a two-way relay network, where some intermediate nodes adopt distributed beamforming to improve the channel quality to legitimate terminals and others jam the eavesdropper, simultaneously. Subjected to the more practical per-node power constraint of each cooperative node, we propose a secrecy scheme to maximize the secrecy sum rate of the two terminals. It is shown that the problem can be transformed into a semi-definite programming (SDP) problem with an additional rank-1 constraint. We then propose a penalty function method and an iterative algorithm to solve such a problem efficiently, instead of the popular semi-definite relaxation (SDR) and randomization technique in the previous literature. Simulations show that the proposed hybrid schemes greatly improve the security of the two-way relay networks.