下行链路广播信道能效优化鲁棒波束成形算法

针对多天线广播下行链路通信系统,研究了一种鲁棒能效联合波束成形和功率分配算法。首先,鲁棒能效优化问题描述为满足一定功率约束的系统和速率与系统消耗之比的最大化优化问题。其次,利用分数规划理论及用户速率与最小均方误差之间的关系,把所描述的分数规划优化问题转化成参数化多项式优化问题。然后,利用拉格朗日对偶及单调优化理论,提出了一种有效的鲁棒能效优化算法。数值仿真结果表明,相对于传统的非鲁棒能效优化算法,所提鲁棒能效优化算法可获得明显的能效性能增益。      

AF中继下行链路系统的能效资源分配方案

为最大化放大转发中继系统的下行链路总能效,结合系统的电路功率,提出了一种基于能效的中继选择和功率分配联合方案.为降低复杂度,采用分步式次优化方案,利用虚拟直传信道增益得到中继选择方法,并将中继系统转换为单跳系统;然后利用凸规划得到最优功率分配.此外,为适应不同的用户分布,提出联合小区呼吸机制的分配方案.仿真结果表明,所提次优联合方案逼近最优值,联合小区呼吸的方案可适应不同的用户分布并进一步提升能效.     

有限字符输入下基于截断速率的安全空间调制天线选择算法

针对有限字符输入下人工噪声辅助空间调制系统的安全传输问题,提出了一种基于截断速率的天线选择算法。考虑到保密速率的闭式表达式难以得到,通过引入截断速率作为保密速率的一种近似的有效指标,将最大化保密速率问题转化为最大化截断速率优化问题。同时,为降低算法复杂度,对截断速率算法的搜索进行优化,通过对矩阵范数按列展开,将对应天线组合的矩阵范数问题简化为对应天线的列范数问题。最后,将只对窃听者产生干扰的人工噪声矢量映射在合法信道空间,进一步提升系统保密速率。仿真结果表明,所提出的基于截断速率算法的系统保密速率性能优于基于信漏噪比算法和最大化保密速率算法,并具有更低的复杂度。     

对抗恶意无人机窃听的无人机通信系统三维航迹规划和功率控制

为应对恶意无人机窃听者对无人机通信系统带来的安全挑战,提出了一种基于物理层安全机制的无人机三维航迹规划和功率控制的协同优化方案。将航迹规划与功率控制建模为带约束的用户安全通信速率最大化问题,并将该问题分解为水平航迹规划、高度控制与功率控制三个子问题。采用连续凸逼近法将各个子问题转化为凸优化问题,通过迭代优化方式得到近似解。仿真结果表明,和二维航迹规划方案相比,该协同优化方案能有效提升用户安全通信的性能指标。     

Two-way中继系统协作节点选择及功率分配策略

为了提高Two-way中继系统总速率,该文提出了一种Two-way AF中继系统的双向中继选择(BRS)策略,该策略通过联合考虑中继节点处的接收信噪比和中继节点到目的节点间的信道增益,实现了最优中继选择。进一步,在最优中继基础上提出了Two-way中继系统两种优化功率分配策略：(1)基于凸优化的功率分配策略(OPA-CO);(2)基于信道增益差异的优化功率分配策略(OPA-DCG)。方案(1)提出了总功率受限的条件下最大化Two-way中继系统总速率的优化模型;方案(2)通过考虑链路之间信道增益的不同,提出了一种速率增量最大化的数学优化模型,为降低求解凸优化模型的复杂度,采用一种迭代功率分配算法求解上述优化模型。仿真结果证明两种策略均能提高系统总速率。     

基于速率约束的OFDM中继链路能效最优资源分配策略

该文研究解码转发(DF)模式的OFDM中继链路的能效最大化资源分配问题。与现有典型的固定速率最小化发射功率或无约束最大化能效算法不同,该文考虑电路功率消耗的前提下,将问题建模为以最大化系统能效为目标,同时考虑用户最小速率需求、源节点S和中继节点R各自总发射功率约束下的联合子载波配对和最优功率分配问题。证明了速率和功率联合约束条件下中继链路全局能效最优解的唯一性,在此基础上提出一种低复杂度联合最优资源分配策略。仿真结果表明,该文所提方案能够在最小速率和S/R节点最大发射功率约束下自适应分配功率资源,实现系统能效最优,并能够降低链路的中断概率。     

基于上行多用户大规模MIMO系统能效优化算法

针对上行多用户大规模多输入多输出（MIMO）系统,提出了基于能效优化的资源分配方法。所提方法采用迫零(ZF)接收,以最大化系统能效下界为准则,系统功率消耗考虑电路功率消耗和发射功率消耗2部分,通过联合调整基站端的发射天线数和用户的数据速率来优化能效函数。首先,根据目标函数的性质,证明全局最优速率分配和天线数的存在性和唯一性,然后,根据分数规划的性质,把原始的分数最优化问题转换成减式形式,进而提出一种新的迭代算法。仿真结果表明,所提算法以较少迭代次数取得了接近最优算法的性能。     

异构密集网中一种抗多窃听者的协作安全波束成形方案

为保证异构密集网中多个窃听者联合窃听时宏基站用户的下行通信安全,该文提出一种抗多窃听者的协作安全波束成形方案。该方案通过联合设计宏基站和微基站的最优协作波束成形矢量,使保密信息传输速率提升的同时,其他用户的下行信号进一步干扰窃听者,从而最大化系统安全速率。为获得最优的协作波束成形矢量,在考虑其他合法用户的服务质量及基站功率限制时,对该安全速率最大化问题进行建模。采用半定松弛技术及Lagrange 对偶理论将原始的非凸优化问题转化为一系列的半定规划问题进行求解。仿真结果验证了所提方案的有效性和安全性。     

非对称毫米波大规模MIMO系统信道特性研究

在大规模多输入多输出（multiple-input multiple-output,MIMO）系统中,合理的天线选择、用户调度以及用户功率分配方案,对提升系统能效、节省资源成本有着重要的作用. 针对大规模MIMO下行链路通信场景,基于能效最大化准则,提出了一种联合天线选择、用户调度以及功率分配的低复杂度优化算法. 首先,针对天线选择和用户调度问题,结合递增递减的选择思想,以最大化系统能效为目标,对天线和用户进行双向交替搜索;其次,对于搜索过程中的用户功率分配问题,采用分式规划理论和拉格朗日对偶算法得到最优能效功率的闭式解,三个参数进行迭代优化,从而得到系统最优能效. 仿真结果表明,本文所提算法不仅具有低复杂度而且具有较好性能,能够有效降低大规模MIMO系统的能耗.

     

大规模MIMO OFDMA下行系统能效资源分配算法

针对大规模多输入多输出（MIMO）正交频分多址(OFDMA)下行移动通信系统,提出了一种基于能效最优的资源分配算法。所提算法在采用迫零(ZF)预编码的情况下,以最大化系统能效的下界为准则,同时考虑每个用户的最低速率要求,通过调整带宽分配、功率分配和基站天线数分配来优化能效函数。首先根据优化条件提出了一种迭代算法确定每个用户的带宽分配,然后利用分数规划的性质并采用凸优化方法,通过联合调整基站端的发射天线数和用户的发射功率来优化能效函数。仿真结果表明,所提算法在较少迭代次数的同时能够取得较好的系统能效性能和吞吐量性能。     

Research on energy-efficient physical-layer secure transmission mechanism in decode-and-forward cooperative networks

The maximization problem of secure energy efficiency (EE) in decode-and-forward relay networks was investigated considering the power and energy constraints in physical-layer secure transmission.An iterative algorithm for power allocation was proposed based on fractional programming and DC (difference of convex functions) programming.This algorithm jointly allocated power for source and relay nodes to achieve energy-efficient secure transmission,subject to the peak power constraint of each node and the minimum secrecy rate requirement of the system.Simulation results demonstrate that the propose algorithm can improve the secure EE significantly compared with the conventional secrecy rate maximization strategy.     

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.     

Cooperative Privacy Provisioning for Energy Harvesting Based Cognitive Multi-Relay Networks

In order to provide privacy provisioning for the secondary information,we propose an energy harvesting based secure transmission scheme for the cognitive multi-relay networks.In the proposed scheme,two secondary relays harvest energy to power the secondary transmitter and assist the secondary secure transmission without interfere the secondary transmission.Specifically,the proposed secure transmission policy is implemented into two phases.In the first phase,the secondary transmitter transmits the secrecy information and jamming signal through the power split method.After harvesting energy from a fraction of received radio-frequency signals,one secondary relay adopts the amplify-and-forward relay protocol to assist the secondary secure transmission and the other secondary relay just forwards the new designed jamming signal to protect the secondary privacy information and degrade the jamming interference at the secondary receiver.For the proposed scheme,we first analyze the average secrecy rate,the secondary secrecy outage probability,and the ergodic secrecy rate,and derive their closed-form expressions.Following the above results,we optimally allocate the transmission power such that the secrecy rate is maximized under the secrecy outage probability constraint.For the optimization problem,an AI based simulated annealing algorithm is proposed to allocate the transmit power.Numerical results are presented to validate the performance analytical results and show the performance superiority of the proposed scheme in terms of the average secrecy rate.     

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.     

基于人工噪声辅助的D2D异构蜂窝安全通信方法

A secure communication scheme based on artificial noise assisted from base station(BS)was proposed to improve the system secrecy rate of the D2D underlaying cellular.Firstly,the system secrecy rate was modeled.Then the BS with multi-antennas added artificial noise(AN)in cellular user’s signal as well as designed beam vectors of the desired signal and artificial noise to maximize system secrecy rate.In the end,a joint optimization scheme based on the fairness constraint was introduced to optimize beam vectors of the desired signal,the power allocation for BS’s information signal and AN and the D2D power control.Simulation results show that the system ergodic secrecy rate can be improved 2.7 bit·s^?1·Hz^?1more than the schemes based on SVD and zero-forcing at most.     

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

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

基于非信任中继协作的保密通信联合功率控制

针对多个与基站(BS, base station)无直达链路蜂窝边缘移动站(MS, mobile station)在上行链路具有保密信息传输需求且存在不信任中继（UR, untrusted relay）协作通信场景,引入目的节点（即BS）干扰机制,并研究MS固定传输功率下UR与BS功率分配以最大化系统安全速率问题。分析表明,该联合功率控制问题等价于联合接入控制与功率分配问题因而是NP-难。通过问题松弛,提出一种次优MS接入控制与基于交替优化的功率分配算法,并证明该次优算法具有多项式复杂度且至少收敛到原始问题一个次优解。仿真结果表明,所提次优算法相对于同场景各种参考算法在系统可达安全速率性能上有显著提高。     

基于分布式智能反射面的物理层安全通信研究

智能反射面(IRS)能够实时调整无线传输环境提高通信效率,在后5G和6G研究中得到广泛关注。该文研究分布式IRSs安全速率最大化问题：考虑功率和恒模约束以及IRS链路之间的相关性,以最大化安全传输速率为目标,构建基站波束成形和IRSs相移参数联合优化问题。采用分式规划和流形优化算法求解构建的非凸优化方程。仿真结果表明,相较于传统算法,该文算法具有较高处理效率有效提高系统安全性,也进一步表明分布式部署IRS比集中部署安全性能更优。     

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.     

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.