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.     

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.     

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.     

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.     

Design of Distributed Beamforming for Dual‐Hop Multiple‐Access Relay Networks

This paper studies a dual‐hop multiple‐access relay network where two independent source nodes transmit information to a common destination node with the aid of multiple single‐antenna amplify‐and‐forward relays. Each relay node is subject to an individual power constraint. We focus on the design of distributed beamforming schemes for the relays to support the transmission rate requirements of the two sources. To this end, we first characterize the achievable rate region for this network via solving a sequence of corner point optimization problems proposed in this paper. We also develop several low‐complexity suboptimal schemes in closed form. Two inner bounds of the achievable rate region are theoretically shown to be approximately optimal in two special scenarios. Finally, numerical results demonstrate the effectiveness of our proposed approaches.     

Performance study of hybrid decode–amplify–forward (HDAF) relaying scheme for physical layer security in wireless cooperative network

In this paper, the secrecy performance and power allocation of the signal‐to‐noise ratio‐based hybrid decode–amplify–forward (HDAF) relaying protocol in wireless cooperative network are investigated to get security at physical layer. The performance metrics considered are secrecy rate and intercept probability. The Ergodic secrecy rate is approximated theoretically. The effect of relay and eavesdropper locations on the secrecy performance of the system is analyzed. It is found that maximum secrecy rate is obtained for the relay close‐to‐destination case and minimum for the relay close‐to‐eavesdropper case. Jamming schemes are superior in secrecy rate performance than without jamming schemes. To enhance the secrecy rate further with the optimized relay and jammer powers, invasive weed optimization (IWO) algorithm‐based power allocation is proposed. Here, maximizing the secrecy rate is defined as the cost function for the proposed IWO algorithm‐based power allocation. Comparative study is done over the conventional equal and proposed power allocation schemes for validation. The proposed power allocation scheme proved to be superior. Copyright © 2016 John Wiley & Sons, Ltd.     

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.     

多组多播集中式大规模MIMO系统的安全性能分析

分析了主动攻击下的多组多播集中式大规模多输入多输出(Multiple-Input Multiple-Output,MIMO)系统的安全性能。基于上行导频训练估计的信道状态信息,系统采用功率限制下的共轭波束成形方案实现下行多播传输。通过分析合法用户安全速率的下界和窃听者信息速率的上界,得到了系统安全速率下界的闭合表达式。进一步,推导出基站天线数趋于无穷大情况下此安全传输系统能获取的极限安全速率。实验仿真验证了所得结果的正确性。     

有限字符输入下AF中继系统安全互信息量分析及功率控制策略

本文针对有限字符输入下多中继通信系统,推导了源和中继节点总功率受限条件下的安全互信息量。在已知理想信道状态信息的条件下,给出了一种基于对窃听节点迫零的波束赋形方案,并设计了一种提高安全互信息量的功率控制策略。针对所提功率控制策略,研究了该策略下目的节点和窃听节点的平均误符号率性能,分析表明该策略在高信噪比下存在误码平层。针对误码平层缺陷,本文提出了一种高信噪比下适当增大源节点发射功率的改进方案。改进方案虽然损失了部分安全互信息量,但换来误符号率的明显改善,消除了功率控制方案的误码平层问题。      

Cooperative beamforming and relay selection in cognitive radio systems

In this paper, a new scheme is suggested for cooperative beamforming (BF) and relay selection in CR networks, where a pair of secondary users communicates with each other assisted by some multiple antenna relay nodes. The goal of the algorithm is to maximize signal to interference plus noise ratio of secondary user receiver subject to limited interference caused for primary user receiver and power constraints of relay nodes. The relay selection and BF optimization problem is solved separately by employing convex semidefinite programming through rank‐one relaxation. It is shown that our proposed algorithm outperforms conventional relay selection and BF schemes. Copyright © 2014 John Wiley & Sons, Ltd.     

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.     

多天线中继系统中人工噪声辅助的安全波束成形

针对放大转发中继系统中转发信息易被窃听者截获的问题,提出了在中继节点处采用人工噪声辅助的安全波束成形方法。该方法以系统的安全速率最大化（SRM, secrecy rate maximization)为目标,在中继节点的总功率和单个天线功率受限情况下,联合设计最优的中继波束成形矩阵和人工噪声协方差矩阵。由于该SRM问题非凸,设计了双层优化算法,其中采用一维搜索解决外层优化问题,采用半定松弛及内点法解决内层优化问题。理论推导证明,内层优化问题总存在秩为1的最优解,即所采用的松弛技术是紧的。仿真结果表明所提的方法可以显著提高系统的安全性能。     

Beamforming for inter‐relay interference reduction in MIMO‐aided two‐path successive relaying

To effectively reduce the inter‐relay interference (IRI) in two‐path successive relaying, two beamforming schemes are proposed in this paper, utilizing multiple‐antenna relay nodes. Specifically, the two cooperation nodes perform receive combining of the source signal and transmit beamforming of the relayed signal alternately in the successive relaying process. As a result, the IRI between them can be effectively suppressed, thanks to the additional degree of freedom provided by the multiple‐input multiple‐output inter‐relay channel. In the first beamforming scheme, the source‐to‐destination signal‐to‐interference‐plus‐noise ratios (SINR) of separate paths are maximized with approximation, leading to a minimum variance distortionless response beamformer under the high SINR condition. To further improve the system performance, noting that the received SINRs of the two paths have impact on each other due to the mutual coupling of the beamformers, the sum of mean squared errors from these two transmission paths is minimized in the second scheme. Based on this performance criterion, a suboptimal beamformer design is developed numerically through cyclic minimization of the sum of mean squared error cost function. Simulation results demonstrate the superiority of both proposed beamforming schemes in terms of symbol error rate and the achievable system rate, in particular, at high IRI levels. Copyright © 2016 John Wiley & Sons, Ltd.     

On the secrecy performance of integrated satellite‐aerial‐terrestrial networks

This paper investigates secure transmission of an integrated satellite‐aerial‐terrestrial network (ISATN), where multiple eavesdroppers (Eves) attempt to overhear the satellite signals cooperatively. The ISATN adopts an unmanned aerial vehicle (UAV) equipped with multiple antennas as a relay with threshold‐based decode‐and‐forward (DF) protocol. By assuming that perfect instantaneous channel state information (CSI) of the satellite‐UAV link and the statistical CSI of the UAV‐user link are available, we first propose a beamforming (BF) scheme for maximizing the achievable secrecy rate (ASR) of the considered network. Then, we derive the analytical expressions of the secrecy outage probability (SOP) and ergodic secrecy rate (ESR) of the considered system with the BF strategy under an assumption that the satellite‐UAV link undergoes the shadowed‐Rician fading, while the UAV‐user link experiences the correlated Rayleigh fading. Finally, numerical results are given to demonstrate the superiority of the proposed BF scheme against zero forcing (ZF) and maximal ratio transmission (MRT) schemes and the validity of the secrecy performance analysis.     

Security enhancement with joint transmit antenna selection and transmit beamforming under energy harvesting constraints

This paper considers a multiuser multiple‐input single‐output (MISO) broadcasting system with simultaneous wireless information and power transfer (SWIPT), which consists of one information receiver (IR) and several energy harvesting receivers (ERs) which are capable of eavesdropping the legitimate signals. For reducing cost and hardware complexity, transmit antenna selection (TAS) is applied in the transmitter. We aim to maximize the achievable secrecy rate under the individual energy harvesting constraint at the ERs and the transmit power constraint at the transmitter by jointly optimizing TAS, transmit beamforming, and artificial noise (AN). The joint optimization problem is a non‐convex mixed integer programming problem. We apply variable replacements to decouple the variable couplings and relax and approach the binary constraint by the difference of two convex constraints. Afterwards, penalty method and constrained concave convex procedure (CCCP) are applied to transform the relaxed problem into a sequence of semi‐definiteness programming (SDP) problems. Simulation results shows that our proposed joint optimization scheme is superior over existing non‐joint optimization schemes. This paper studies the joint transmit antenna selection (TAS), transmit beamforming, and artificial noise (AN) optimization in a multiple‐input multiple‐output (MISO) wiretap system with simultaneous wireless information and power transfer (SWIPT). The joint optimization problem is nonconvex and we propose a penalty method based scheme to solve it. The simulation results show that our joint optimization scheme is superior to other non‐joint optimization schemes.     

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.     

Underlay协同频谱共享系统中基于SDF-DZFB的物理层安全传输

协同中继传输不仅能改善认知用户的传输可靠性,而且也能增强认知用户物理层安全性。针对Underlay模式下多中继协同频谱共享认知无线网络,本文设计了基于选择译码转发和分布式迫零波束成形（SDF-DZFB）的物理层安全传输方案,其中,假设存在单个被动窃听节点窃听中继节点的发送信号,在认知用户发送端同时考虑峰值干扰温度约束和最大发射功率约束,中继和认知用户目的端都受到主用户干扰。在此情况下,分析了认知用户发送端分别到目的端（称为主链路）和到窃听节点（称为窃听链路）的等效信干噪比的统计特性,进而推导出系统安全中断概率性能的闭式表达式。为了揭示所提物理层安全传输方案的安全分集度性能,本文进一步分析了高信噪比条件下安全中断概率的渐近表达式。计算机仿真验证了本文的理论分析结果。      

窃听信道下认知多小区中的协同波束赋形算法

小区之间优化变量耦合使多小区联合优化问题为非线性非凸问题,通过约束泄露干扰提出了基于半正定松弛的中心式协同波束成形算法,在此基础上,采用部分对偶分解方法将中心式联合优化问题分解为一组单小区优化问题,提出了一种分布式迭代求解算法。结果表明,所提算法在保证系统安全速率需求和认知干扰约束的条件下实现了系统功耗的降低,此外,分布式算法不仅能降低实现复杂度,而且能达到中心式算法的性能。     

储能-发送模式的单天线两跳中继系统保密速率的优化

该文研究节点具有能量收集能力的两跳中继系统的物理层安全传输方案。考虑窃听节点与源和中继节点间都有直接链路的情况。每个数据传输时隙分为能量收集和数据传输两个阶段,各节点用收集的能量发送信号。中继采用放大转发方式,目的节点发送人工噪声进行协作干扰,保护在两跳传输中传输的保密信息。以最大化保密速率为目标,采用迭代算法优化能量吸收和数据传输两阶段的时间分配比例系数和协作干扰功率分配因子。仿真结果表明优化算法准确,优化后的协作干扰方案能显著提高系统的保密传输速率。由于考虑了窃听节点在两跳传输中都能接收到信号的可能性,文中方案更贴近实际,并解决了一个复杂的优化问题。     

存在辅助节点的MIMO窃听信道安全性能研究

为了提高MIMO窃听信道的可达安全速率,提出了基于广义奇异值分解的合作干扰策略。该策略中源节点和辅助节点同时采用基于广义奇异值分解的波束形成技术,源节点发送消息信号,辅助节点发送独立于消息信号的噪声信号,噪声信号对目的节点和窃听节点都产生干扰。此外设计了源节点和辅助节点采用合作干扰策略时的联合最优功率分配算法。该算法可以实现源节点和辅助节点在总功率受限时的可达安全速率最大化。仿真结果表明,与现有的非合作最优功率分配算法相比,本文提出的合作干扰策略在大信噪比时可以显著提高系统的可达安全速率。