In this paper, the energy efficiency of secure communication in a wireless decode-and-forward (DF) relay network is studied using friendly jammer. Our objective is to maximize the secure energy efficiency (SEE), measured as the numbers of bits transmitted secretly per unit of energy consumed under power constraint on each node and target secrecy rate constraint. SEE maximization requires the optimal selection of helper nodes as relays and jammer, and then the power allocation among them. The SEE maximization is achieved by joint power allocation between the source, relays and a jammer in global channel state information (CSI) scenario. In this paper, the optimal jammer and relay set is selected iteratively by a simple jammer and relay selection scheme to avoid mix integer formulation of the optimization problem. The resulting problem is solved by a joint application of fractional programming, exact penalty, alternate search, and difference of convex functions programming.
In this paper, the energy efficiency of secure communication in a wireless decode-and-forward (DF) relay network is studied using friendly jammer. Our objective is to maximize the secure energy efficiency (SEE), measured as the numbers of bits transmitted secretly per unit of energy consumed under power constraint on each node and target secrecy rate constraint. SEE maximization requires the optimal selection of helper nodes as relays and jammer, and then the power allocation among them. The SEE maximization is achieved by joint power allocation between the source, relays and a jammer in global channel state information (CSI) scenario. In this paper, the optimal jammer and relay set is selected iteratively by a simple jammer and relay selection scheme to avoid mix integer formulation of the optimization problem. The resulting problem is solved by a joint application of fractional programming, exact penalty, alternate search, and difference of convex functions programming.
In this paper, we raise the concern on energy-efficient secure communication over a decode-and-forward relay network with potential eavesdroppers. Our objective is maximizing the secure energy efficiency (EE), which is defined as the ratio of secrecy rate to total power, subject to the given individual power, relay decoding rate, and target secrecy rate constraints. The problem is formulated as a unified mixed integer nonlinear optimization adapting to different assumptions of channel state information (CSI). To deal with this combinatorial optimization, a suboptimal solution scheme is developed upon some mathematical methods as decoupling of mixed integer programming, fractional programming, dual decomposition, and difference of convex functions programming. The core of the scheme is to transform the primal problem into simple subproblems step by step, and then convex programming can be exploited finally. The proposed scheme for the case with statistical eavesdropper's CSI, may be conditionally extended to the scenario with full CSI in which a local optimal solution may be obtained in certain cases. Finally, the performance and achievable secure EE of the proposed algorithm are demonstrated by simulations where the tradeoff between secure EE and secrecy rate is also revealed.
In this paper, we examine the physical layer security for cooperative wireless networks with multiple intermediate nodes, where the decode-and-forward protocol is considered. We propose a new joint relay and jammer selection (JRJS) scheme for protecting wireless communications against eavesdropping, where an intermediate node is selected as the relay for the sake of forwarding the source signal to the destination and meanwhile, the remaining intermediate nodes are employed to act as friendly jammers, which broadcast the artificial noise for disturbing the eavesdropper. We further investigate the power allocation among the source, relay and friendly jammers for maximizing the secrecy rate of proposed JRJS scheme, and derive a closed-form sub-optimal solution. Specifically, all the intermediate nodes, which successfully decode the source signal, are considered as relay candidates. For each candidate, we derive the sub-optimal closed-form power allocation solution and obtain the secrecy rate result of the corresponding JRJS scheme. Then, the candidate, which is capable of achieving the highest secrecy rate, is selected as the relay. Two assumptions about the channel state information (CSI), namely the full CSI (FCSI) and partial CSI (PCSI), are considered. Simulation results show that the proposed JRJS scheme outperforms the conventional pure relay selection, pure jamming, and generalized singular-value-decomposition-based beamforming schemes in terms of secrecy rate. Additionally, the proposed FCSI-based power allocation and PCSI-based power allocation schemes both achieve higher secrecy rates than the equal power allocation scheme.
In this paper, we propose a new joint relay and jammer selection (JRJS) scheme to enhance the physical layer security for cooperative wireless networks with multiple intermediate nodes, where the decode-and-forward (DF) protocol is considered. In the proposed JRJS scheme, an intermediate node is selected as the relay for data transmission, while the others are used to act as friendly jammers for disrupting the eavesdropper by broadcasting artificial noise. We focus on the power allocation between the relay and jammers to maximize the secrecy rate of proposed JRJS scheme under a total transmit power constraint, and derive a closed-form optimal power allocation solution. For the purpose of comparision, the conventional pure relay selection and pure jammer selection schemes are considered as benchmark schemes. Simulation results show the advantage of the proposed JRJS scheme over conventional pure relay selection and pure jammer selection methods in terms of secrecy rate. Additionally, the derived optimal power allocation solution leads to a significantly higher secrecy rate than the equal power allocation scheme.
This paper investigates secrecy efficiency (SE) optimization in a friendly full-duplex (FD) decode- and-forward (DF) relay network with a passive eavesdropper. Targeting on SE maximization, the power allocation is optimized subject to the total power and minimum secrecy rate constraints adapting to the assumption of unknown eavesdropper's channel state information (CSI). By exploiting the properties of fractional programming (FP) and Difference of Convex functions (DC) programming, the resulting nonconvex optimization problem can be relaxed into a more tractable equivalent problem. Simulation results demonstrate that our proposed scheme can reach a better trade-off between security performance and energy consumption.
In this paper, we examine the physical layer security for cooperative wireless networks with multiple intermediate nodes, where the decode-and-forward (DF) protocol is considered. We propose a new joint cooperative beamforming and jamming (JCBJ) scheme to protect wireless communication against eavesdropping, where the intermediate nodes which successfully decode the source signal are selected as the relays for simultaneously forwarding the source signal by employing a weight vector, and meanwhile, the others are used to act as the friendly jammers for broadcasting artificial noise to disturb the eavesdropper. We further investigate the optimal power allocation among the source, relays and friendly jammers for maximizing the secrecy rate of the proposed JCBJ scheme and derive a closed-form sub-optimal solution. Simulation results show that the proposed JCBJ scheme achieves obviously higher secrecy rate than the conventional generalized singular-value-decomposition (GSVD) based beamforming and pure jamming schemes. Additionally, the proposed optimal power allocation scheme performs much better than the equal power allocation scheme in terms of secrecy rate.
To improve physical (PHY) layer security of a wireless relay system in the presence of an eavesdropper, a two-phase cooperative relaying scheme is investigated in this paper. In phase I, the source transmits confidential message, simultaneously, it cooperates with the friendly jammers and destination to create jamming signal at the eavesdropper without affecting the forwarding relay which is preselected. In phase II, the forwarding relay retransmits the decoded signal, meanwhile, the particular relay cooperates with the friendly jammers to create jamming signal at the eavesdropper without affecting the destination. We focus on the investigation of optimal power allocation for maximizing achievable secrecy rate subject to a total power constraint. Optimal relay selection and suboptimal relay selection schemes are also proposed. It is shown that as the number of relays increases, both secrecy rate and the performance of suboptimal relay selection scheme improve significantly. Numerical results are presented to validate the derived analytical results and compare them to existing work.