Nelder‐Mead–based power optimization for secrecy enhancement in amplify‐and‐forward cooperative relay networks

Cooperative communication based on relaying nodes has been considered as a promising technique to increase the physical layer security (PLS) performance in wireless communications. In this paper, an optimal power allocation (OPA) scheme based on Nelder‐Mead (NM) algorithm is proposed for improving the secrecy rate of amplify‐and‐forward (AF) cooperative relay networks employing cooperative jamming (CJ) scheme. The proposed hybrid jamming scheme allows the source and selected relay to transmit the jamming signal along with the information to confound the eavesdropper. The path selection probability of ant colony optimization (ACO) algorithm is used for selecting the relay for transmission. The performance based on secrecy rate is evaluated for “n” trusted relays distributed dispersedly between the source and destination. Gradient‐based optimization and three‐dimensional exhaustive search methods are used as benchmark schemes for comparison of the proposed power optimization algorithm. The secrecy performance is also compared with conventional AF scheme and CJ scheme without power optimization (EPA). The impact of single and multiple relays on secrecy performance is also evaluated. Numerical results reveal that, compared with the gradient method and exhaustive search algorithm, the proposed power allocation strategy achieves optimal performance. Also, the derived OPA results show a significantly higher secrecy rate than the EPA strategy for both CJ and AF schemes.     

Artificial noise–aided secure communication in a bidirectional relaying network

An artificial noise strategy is proposed for amplify‐and‐forward bi‐directional relay network where the eavesdropper can wiretap the relay channels in both hops. Artificial noise is used to confuse the eavesdropper and improve its secrecy. Specifically, the source and the relay are allowed to split their available transmit power into 2 parts: a useful information portion and a jamming portion to transmit a jamming signal. The mathematical model is established for 2‐way relay network with an eavesdropper. The secrecy rate achieved by using artificial jamming is derived from the above model. The optimal power allocation with individual power constraint is obtained via sequential quadratic programming to maximize the secrecy sum rate, and 2 special cases are investigated. Furthermore, the benchmark is provided for the purpose of performance comparison. Simulation results show that the proposed strategy can significantly improve the secrecy sum rate by using artificial noise to jam the eavesdropper.     

Achievable rate region with secrecy constraints for secure communication in two‐way relay networks

In this paper, we consider a two‐way relay network consisted of two sources and multiple relays in the presence of an eavesdropper, where the cooperative beamforming strategy is applied to exploit the cooperative diversity to support the secure communication as illustrated in Figure 1. Naturally, we are interested in the beamforming strategy and power allocation to maximize the achievable sum secrecy rate. However, the corresponding problem is equivalent to solve a product of three correlated generalized Rayleigh quotients problem and difficult to solve in general. Because of the openness of wireless medium, the information rate leakage to the eavesdropper cannot be canceled perfectly. To some extent, ‘almost perfect secrecy’, where the rate leakage to the eavesdropper is limited, is more interesting from the practical point of view. In this case, we concern ourself mainly the achievable rate region for general case where the rate at the eavesdropper is regarded as the measurement of secrecy level. Two beamforming approaches, optimal beamforming and null space beamforming, are applied to investigate the achievable rate region with total power constraint and the rate constraint at the eavesdropper, which can be obtained by solving a sequence of the weighted sum inverse‐signal‐to‐noise‐ratio minimization (WSISM) problem. Because of the non‐convexity of WSISM problem, an alternating iteration algorithm is proposed to optimize the relay beamforming vector and two sources' transmit power, where two subproblems need to be solved in each iteration. Meanwhile, we provide the convergence analysis of proposed algorithm. Through the numerical simulations, we verify the effectiveness of proposed algorithm. Copyright © 2013 John Wiley & Sons, Ltd.     

Power allocation-Assisted secrecy analysis for NOMA enabled cooperative network under multiple eavesdroppers

In this work, the secrecy of a typical wireless cooperative dual-hop non-orthogonal multiple access (NOMA)-enabled decode-and-forward (DF) relay network is investigated with the impact of collaborative and non-collaborative eavesdropping. The system model consists of a source that broadcasts the multiplexed signal to two NOMA users via a DF relay, and information security against the eavesdropper nodes is provided by a helpful jammer. The performance metric is secrecy rate and ergodic secrecy capacity is approximated analytically. In addition, a differential evolution algorithm-based power allocation scheme is proposed to find the optimal power allocation factors for relay, jammer, and NOMA users by employing different jamming schemes. Furthermore, the secrecy rate analysis is validated at the NOMA users by adopting different jamming schemes such as without jamming (WJ) or conventional relaying, jamming (J), and with control jamming (CJ). Simulation results demonstrate the superiority of CJ over the J and WJ schemes. Finally, the proposed power allocation outperforms the fixed power allocation under all conditions considered in this work.     

Amplify‐and‐forward‐based cooperative jamming strategy with power allocation for secure communication

This paper deals with the use of jamming transmission for secure amplify‐and‐forward‐based relay networks with total power constraints. An approach that the source and the relay use some of their available power to transmit jamming signals in order to create interference at the eavesdropper is investigated. Assume that the relay and destination have an a priori knowledge of the jamming signals. A power allocation policy that defines how the available power is distributed between the message signal and that of the jamming signal is presented. The results show that the proposed approach can increase the secrecy level and that a positive secrecy rate can be achieved even when the eavesdropper may be near the source. Copyright © 2014 John Wiley & Sons, Ltd.     

Enhancing secrecy capacity of multi‐relay wiretap systems with partial channel state information

Distributed precoding has provento be capable of enhancing the secrecy capacity of the multi‐relay wiretap system. An iterative distributed precoding and channel state information (CSI) sharing scheme can be used to reduce the CSI overhead at each relay node. However, in practical applications, the CSI of each relay node cannot be perfectly known to themselves, especially that of the relay‐eavesdropper channels. Thus, partial CSI for the relay‐eavesdropper links is assumed, and the corresponding distributed precoding and CSI sharing schemes are investigated. Under the assumption that the average value of the relay‐eavesdropper channel is known at each relay node, an extended iterative distributed precoding and CSI sharing scheme is proposed. Simulation results demonstrate that with the increase of the power ratio of the constant part to the random part of the relay‐eavesdropper channels, the proposed scheme with partial CSI performs increasingly close to the one with perfect CSI in secrecy capacity. Copyright © 2014 John Wiley & Sons, Ltd.     

Enhanced Physical Layer Security for Cooperative NOMA Network with Hybrid-Decode-Amplify-Forward Relaying via Power Allocation Assisted Control Jamming

This paper introduces the hybrid-decode-amplify-forward (HDAF) cooperative relaying into a control jamming aided NOMA network under Rayleigh-flat-fading channel conditions. In HDAF, the relay switches between AF and DF modes based on SNR threshold to forward the information signal to the corresponding NOMA users in the existence of an eavesdropper. We first characterize the secrecy performance of the considered network in terms of secrecy rate at both NOMA users analytically under different jamming scenarios. Further, to improve the secrecy rate, Differential Evolution (DE) algorithm-based power allocation is adopted to optimize the powers of jammer, relay, and NOMA users for which maximization of secrecy rate is chosen as the cost function. Moreover, the impact of different numerical parameters such as signal-to-noise ratio (SNR), jammer-to-eavesdropper distance, and relay-to-eavesdropper distance on the secrecy rate is investigated at both NOMA users by employing different jamming schemes. The MATLAB based simulation results validate the efficacy of proposed power allocation over fixed power allocation, CJ over other jamming schemes, and application of HDAF relaying for physical layer security enhancement of NOMA enabled cooperative network.

     

Cooperative Decode‐and‐Forward Relaying for Secure Multicasting

In this paper, secure multicasting with the help of cooperative decode‐and‐forward relays is considered for the case in which a source securely sends a common message to multiple destinations in the presence of a single eavesdropper. We show that the secrecy rate maximization problem in the secure multicasting scenario under an overall power constraint can be solved using semidefinite programing with semidefinite relaxation and a bisection technique. Further, a suboptimal approach using zero‐forcing beamforming and linear programming based power allocation is also proposed. Numerical results illustrate the secrecy rates achieved by the proposed schemes under secure multicasting scenarios.     

Secure AF relaying with efficient partial relay selection scheme

This paper evaluates the secrecy performance for the amplify‐and‐forward (AF) protocol with partial relay selection (PRS) schemes in the scenario of multiple independent but not necessarily identically distributed eavesdroppers. The secrecy performances of the first‐hop and second‐hop PRS schemes are revisited. Given the secrecy data rate, an efficient PRS scheme is presented, which selects the relay based on the instantaneous channel state information (CSI) of either the first or second hop according to the statistical CSI of two hops. The proposed PRS scheme provides the trade‐off between the two‐hop and one‐hop PRS criteria. Results show that the secrecy outage probability (SOP) performance of the proposed scheme is close to that of the conventional opportunistic relaying in the medium main‐to‐eavesdropper ratio (MER) regions. As for the intercept probability, the second‐hop scheme achieves the highest diversity order among PRS schemes and its performance depends on the overall eavesdroppers' behavior not on individual effects of the specific relay. The proposed criterion also outperforms the first‐hop PRS scheme. Simulation results finally substantiate the accuracy of the theoretical analysis.     

A novel relay selection algorithm using ant colony optimization with artificial noise for secrecy enhancement in cooperative networks

Cooperative communication is one of the fastest growing research areas of today. It can efficiently mitigate the effect of shadowing and fading with the help of relays and proper relay selection technique. In this paper, a novel relay selection scheme combined with artificial noise (AN) is devised to enhance the secrecy of cooperative networks with amplify‐and‐forward scheme, over Rayleigh fading channels in the presence of a passive eavesdropper. The probability of path selection of ant colony optimization algorithm is used for selecting the best relay with high end‐to‐end signal‐to‐noise ratio. The probability of choosing a path depends on the significance of channel gain (G) and fading coefficients (h). The proposed algorithm finds the best relay in the following wireless scenarios: when (i) both channel gain and fading coefficients are significant; (ii) only fading coefficients are significant; and (iii) only channel gain is significant. Because the direct links between source and destination and source and eavesdropper are considered, AN along with the information is sent by both the source and the selected relay. The performance is evaluated based on secrecy rate (R_s); for the relays randomly placed between the source and destination and for different eavesdropper's location. The results show that the proposed relay selection scheme achieves better secrecy for different wireless scenarios compared with traditional schemes. With the help of AN, the secrecy rate can be made positive even when the eavesdropper lies near to source.     

Joint power allocation and relay selection for decode-and-forward cooperative relay in secure communication

In this paper, we investigate the cooperative strategy with total power constraint in decode-and-forward (DF) relaying scenario, in the presence of an eavesdropper. Due to the difference of channel for each source-relay link, not all relay nodes have constructive impacts on the achievable secrecy rate. Besides, the final achieved secrecy rate depends on both source-relay and relay-destination links in DF relaying scenario. Therefore, the principal question here is how to select cooperative strategy among relays with proper power allocation to maximize the secrecy rate. Three strategies are considered in this paper. First, we investigate the cooperative jamming (CJ) strategy, where one relay with achieved target transmission rate is selected as a conventional relay forwarding signal, and remaining relays generate artificial noise via CJ strategy to disrupt the eavesdropper. Two CJ schemes with closed-form solutions, optimal cooperative jamming (OCJ) and null space cooperative jamming (NSCJ), are proposed. With these solutions, the corresponding power allocation is formulated as a geometric programming (GP) problem and solved efficiently by convex programming technique. Then, to exploit the cooperative diversity, we investigate the cooperative relaying (CR) strategy. An iterative algorithm using semi-definite programming (SDP) and GP together with bisection search method is proposed to optimize the cooperative relaying weight and power allocated to the source and relays. Furthermore, to exploit the advantages of both CR and CJ, we propose an adaptive strategy to enhance the security. Simulation results demonstrate that the efficiency of the proposed cooperative strategies in terms of secrecy rate.     

Cooperative beamforming of full‐duplex relays for improving physical layer security

In this paper, we consider secure communications of one source‐destination pair in the presence of one eavesdropper, when full‐duplex decode‐and‐forward cooperative relays operate to enhance physical layer security. While the conventional half‐duplex relay receives the signal from the source and forwards the re‐encoded signal to the destination in two separated time slots, the full‐duplex relay (FDR) performs the transmission and reception at the same time, which can ideally double the secrecy capacity. However, because of the simultaneous transmission and reception, each FDR suffers from both its own self‐interference and the interference from the other cooperative FDRs. When the conventional cooperative relaying schemes are used in full‐duplex relaying, it is obviously expected that the self‐interference signals cause severe degradation of the secrecy capacity. Here, we propose an iterative transmit power allocation and relay beamforming weight design scheme for cooperative FDRs to enhance the secrecy rate as well as suppress the self‐interference signals. Numerical results present that the FDRs with the proposed scheme significantly improve the secrecy rate compared with the conventional half‐duplex relays. Copyright © 2015 John Wiley & Sons, Ltd.     

基于保密度的OFDMA中继网络资源分配研究

考虑到异构双向中继网络中存在窃听者的安全资源分配问题,为了提高中继安全性,该文研究了受限于子信道分配和功率约束的用户安全保密度问题模型,与传统的保密容量模型相比,安全保密度模型更侧重于反映用户本身的安全程度。基于此保密度模型,该文进一步考虑了不同用户的安全服务质量(Quality of Service, QoS)需求和网络公平性,联合优化功率分配、子信道分配、子载波配对,并分别通过约束型粒子群、二进制约束型粒子群优化算法和经典的匈牙利算法找到最优解,实现资源的最优分配,提高网络中合法用户的保密度。仿真结果验证了所提算法的有效性。     

Minimized SER and QOS Based Power Allocation Strategies for Multi HDAF Relay Cooperative Network

In this paper, a multi hybrid decode-amplify-forward relay cooperative network with perfect CSI in flat Rayleigh fading channel is considered. Using moment generating function based approach, the closed form of symbol error rate (SER) with asymptotic approximation is derived. Based on the lower bound of SER (Olfat and Olfat in IET Commun 5(4):2018–2027, 2011), Lagrange multiplier method and differential evolution (DE) algorithm based power allocation schemes are proposed. With fixed source power, the relay powers are optimized with the proposed schemes by the power allocation factor. Further the SER performance of proposed power allocation schemes is investigated by varying the location of the relays. The performance gain of proposed power allocation schemes depends on the channel quality of source to relay and relay to destination links. It is observed that the proposed power allocation schemes outperform the equal power allocation scheme and DE based power allocation provides SER response close to power allocation with Lagrange multiplier method. In order to achieve the target SER (quality of service) minimum power allocation is introduced as minimum relay power allocation and minimum source and relay power allocation.

     

基于AF策略的高斯正交不信任中继信道的最优资源分配

本文研究了高斯正交中继窃听信道,中继节点同时作为窃听者的情况,源节点同中继节点和目的节点在信道1上传输信号,中继节点同目的节点在信道2上传输信号,信道1和信道2在频率上是正交的。通过分析,在总的信道资源受限的情况下,通过优化功率及信道带宽获得最大的安全速率。本文给出了在高斯正交信道下,当只考虑功率或带宽时,存在唯一的功率或带宽使得安全速率达到最大,并且通过仿真结果说明了采用最优资源分配可得到比等资源分配更大的安全速率。     

Secrecy sum rate optimization in MISO nonorthogonal multiple access systems with orthogonal space‐time block coding

In this paper, we investigate the secrecy sum rate optimization problem for a multiple‐input single‐output (MISO) nonorthogonal multiple access (NOMA) system with orthogonal space‐time block codes (OSTBC). This system consists of a transmitter, two users, and a potential eavesdropper. The transmitter sends information by orthogonal space‐time block codes. The transmitter's precoder and the power allocation scheme are designed to maximize achievable secrecy sum rate subject to the power constraint at the transmitter and the minimum transmission rate requirement of the weak user. We consider two cases of the eavesdropper's channel condition to obtain positive secrecy sum rate. The first case is the eavesdropper's equivalent channel is the weakest, and the other is the eavesdropper's equivalent channel between the strong user and weak user. For the former case, we employ the constrained concave convex procedure (CCCP)‐based iterative algorithm with one‐dimensional search. While for the latter, we adopt the method of alternating optimization (AO) between precoder and power allocation. We solve a semidefinite programming to optimize the precoder and drive a closed‐form expression of power allocation. The simulation results obtained by our method demonstrate the superiority of our proposed scheme.     

Secure Relay Selection of Cognitive Two-Way Denoise-and-Forward Relaying Networks

In this paper, secrecy performance of a cognitive two-way denoise-and-forward relaying network consisting of two primary user (PT and PD) nodes, two secondary source (SA and SB) nodes, multiple secondary relay (\({\textit{SR}}_i\)) nodes and an eavesdropper (E) node is considered, where SA and SB exchange their messages with the help of one of the relays using a two-way relaying scheme. The eavesdropper tries to wiretap the information transmitted between SA and SB. To improve secrecy performance of the network, two relay selection schemes called maximum sum rate and maximum secrecy capacity based relay selection (MSRRS and MSCRS) are proposed and analyzed in terms of intercept probability. It is proved that the MSRRS and MSCRS schemes have the same secrecy performance. Two parameters called average number gain and average cost gain are proposed to show the performance of the proposed relay selection schemes. Numerical results demonstrated that with 10 relay nodes, the proposed relay selection schemes can achieve, respectively, 3.7 dB and 1.9 dB’s improvements in terms of the reduced intercept probability and the enhanced secrecy capacity compared to the traditional round-robin scheme.     

Evaluating secrecy performance of cooperative NOMA networks under existence of relay link and direct link

The secrecy performance of a nonorthogonal multiple access (NOMA) system is examined in this study by employment of a dual‐hop decode‐and‐forward (DF) relay under existence of eavesdropper. Due to the fact that the relay is trusted or untrusted device and thus eavesdropper may wiretap information from the base station or the relay. In this regard, three scenarios related to trusted and untrusted relays are proposed, with different assumptions on the information overhearing ability of the eavesdropper; ie, the first scenario is that an eavesdropper overhears signal from the relay while the BS is overheard by eavesdropper in the second scenarios. More specifically, we derive closed‐form expressions for the secure probability metrics when the direct and relay links experience independent Rayleigh fading. There metrics include strictly positive secrecy capacity (SPSC) and the secure outage probability (SOP). Furthermore, secure performance of traditional orthogonal multiple access (OMA) is also provided as further comparison with NOMA counterpart. We analyze the influence of main coefficients such as the target rates and the transmit SNR factors on the secrecy performance. Our results specify that for reasonable selection of such parameters, secrecy performance can be enhanced remarkably. Numerical results are delivered to corroborate the derived results.     

恶意导频干扰对采用人工噪声方案系统的安全性能影响分析

针对窃听方发送恶意导频干扰破坏系统安全性能的问题,本文将研究场景扩展到三节点MIMO(Multple-Input Multiple-Output)网络,首先分析存在恶意导频干扰时最小二乘和最小均方误差准则下的信道估计结果,并推导基于人工噪声的系统安全速率公式,得出当窃听方到达发送方的导频干扰功率大于合法接收方达到的功率时,安全速率值只能为零.然后,进一步分别研究半双工窃听方和全双工窃听方场景下的最优功率分配方案.最后,通过数值仿真分析窃听者位置、窃听者类型和干扰功率等因素对安全性能的影响.     

Improving physical layer security via cooperative diversity in energy‐constrained cognitive radio networks with multiple eavesdroppers

In this paper, a scheme that exploits cooperative diversity of multiple relays to provide physical layer security against an eavesdropping attack is concerned. Relay‐based cognitive radio network (CRN) faces issues multiple issues other than the same as faced by conventional wireless communications. If the nodes in a CRN are able to harvest energy and then spend less energy than the total energy available, we can ensure a perpetual lifetime for the network. In this paper, an energy‐constrained CRN is considered where relay nodes are able to harvest energy. A cooperative diversity‐based relay and subchannel‐selection algorithm is proposed, which selects a relay and a subchannel to achieve the maximum secrecy rate while keeping the energy consumed under a certain limit. A transmission power factor is also selected by the algorithm, which ensures long‐term operation of the network. The power allocation problem at the selected relay and at the source also satisfies the maximum‐interference constraint with the primary user (PU). The proposed scheme is compared with a variant of the proposed scheme where the relays are assumed to have an infinite battery capacity (so maximum transmission power is available in every time slot) and is compared with a scheme that uses jamming for physical layer security. The simulation results show that the infinite battery‐capacity scheme outperforms the jamming‐based physical layer security scheme, thus validating that cooperative diversity‐based schemes are suitable to use when channel conditions are better employed, instead of jamming for physical layer security.