基于PSO的D2D蜂窝网络联合信道分配和功率控制

为解决蜂窝用户(Cellular Users, CU)和终端直通(Device to Device, D2D)用户之间的干扰管理问题,提高无线蜂窝网络吞吐量,提出了一种基于粒子群优化的联合信道分配和功率控制方案。提出了具有不同约束条件的2个联合信道分配和功率控制问题,并将离散信道和连续功率联合分配给CU和D2D对,允许任意数量的D2D对与一个CU共享同一信道。通过设计适应度值避免算法陷入局部最优或产生不可行的解决方案,并使算法收敛到全局最优。通过搭建仿真网络模型进行测试验证,并与随机粒子群优化算法进行对比分析。实验结果表明,所提方法可有效提高蜂窝网络中的D2D通信网络吞吐量,且与随机粒子群优化算法相比,所提方法在D2D吞吐量、蜂窝吞吐量以及整体网络吞吐量方面具有明显优势。     

基于粒子群算法的下行CR-NOMA网络资源分配

将非正交多址接入(Non-orthogonal Multiple Access,NOMA)技术应用于认知无线电(Cognitive Radio,CR)次网络,使次用户的信号在功率域叠加,可以进一步提高次网络的吞吐量。为此,将粒子群算法(Particle Swarm Optimization,PSO)应用于底层模式的CR-NOMA网络进行资源分配,并分为子信道分配和功率分配两个步骤。在子信道分配中,使用结合遗传算法思想的粒子群算法提高算法的全局搜索能力。在此基础上,使用基于罚函数的粒子群算法对子信道功率和信道内用户功率进行分配。仿真结果表明,提出的基于粒子群算法的CR-NOMA网络资源分配相比以往算法能获得更高的次网络吞吐量。     

协作系统中基于比例公平的资源分配方法

针对多用户协作中继系统中的资源分配问题,提出了一种在满足用户速率比例公平约束条件下的新算法。该算法先将由2个时隙组成的中继用户传输链路转换为一个等效信道链路,将涉及子载波分配、中继选择和功率分配的组合优化问题转化为分步的次优化问题。该算法在等功率分配情况下,根据各用户速率比例公平系数进行初步子载波数目分配;以瞬时信道增益最佳原则,进行剩余子载波数目分配及具体子载波分配,同时完成中继选择;在速率比例公平约束条件下推导出次优化功率分配的闭式表达式,从而完成各子载波上的功率分配。仿真结果表明,该算法在有效提高系统容量的同时,保证了各用户速率之间的比例公平性。     

基于能量采集的译码转发中继系统功率分配算法

本文针对基于能量采集的译码转发（DF）中继蜂窝异构网络,提出了一种系统容量最大化的功率分配算法。中继和用户节点均采集由基站发送的射频信号的能量;利用采集到的能量,通过时分多址方式,用户节点经中继将信息发送给基站。在满足中继和用户节点采集能量的因果性限制及总功率受限条件下,构建了系统容量的优化模型。利用拉格朗日乘子法和KKT (Karush-Kuhn-Tucker)最优条件,为使系统容量最大化,对中继和用户功率进行分配;通过等效信道增益,将中继功率和用户功率联合优化问题简化为用户功率优化问题,然后通过次梯度算法获得功率最优解。仿真结果表明,与受限于中继和用户采集能量因果性的用户平均功率算法相比较,本文算法可以提高系统平均容量。      

OFDMA中继网络基于效用的资源分配

研究半双工正交频分复用（OFDMA）中继网络的资源分配。解决动态子信道分配,自适应功率分配,传输策略选择和中继选择的联合优化问题。为了公平利用中继用户的资源,把中继用户所能帮助的最大子信道数和每个子信道的功率设为常量。在此基础上,提出贪婪算法以最大化总效用。当算法每次分配资源时,把资源分配给潜在效用增长最大的用户。仿真结果表明所提算法与固定的资源分配策略相比,能更高效地利用资源,并且改善了用户间的公平性。     

认知网络中基于中继的频谱资源分配

根据无线认知中继网络上、下行链路子载波的信道特性,研究认知网络的频谱资源分配,提出一种上、下行链路子载波联合优化的分配算法。该算法根据子信道增益差值因子的大小分配下行链路子载波,以源节点和中继节点功率最小化为优化目标配对上行链路子载波,以用户的实时需求分配子载波的比特和功率,有效降低了系统的发射功率,提高了系统吞吐量。仿真结果表明,与启发—集中式和分布式辅助反馈传输功率分配算法比较,该联合优化算法的单位比特功耗降低了1.5~3 dBμW,误比特率性能提高了1个数量级左右。     

基于比例速率保证的信道误差OFDMA中继系统资源分配

针对存在有信道估计误差的正交频分多址( OFDMA)中继系统,在考虑用户传输中断概率的同时,提出了满足不同用户最小服务质量( QoS)需求和比例公平性约束条件下的中继选择、子载波分配和功率分配的联合优化问题,建立了以最大化系统总容量为目标的优化模型。在此基础上以速率最大化为目标进行最佳中继选择,并通过动态子载波分配来满足用户的最小QoS需求和比例公平性,最后采用拉格朗日乘子法来得到最优功率分配方案。仿真结果表明,此算法在降低用户中断概率的同时,提高了系统吞吐量并保证了用户速率的比例公平性。     

基于两跳匹配的OFDMA中继网络联合资源分配算法

针对OFDMA中继网络的两跳特性,提出一种基于两跳匹配的中继网络联合资源分配算法。首先根据中继网络的两跳性建立两跳速率匹配模型,然后利用对偶分解理论将中继网络资源分配的主问题分解为：中继选择、子载波分配和功率分配三个主要的子问题并进行联合优化,同时基于中继网络两跳性在子载波分配的过程中考虑两跳子载波配对,以逼近系统最优解。最后为了保证算法的公平性,考虑子载波分配因子约束以优化子载波分配。仿真结果表明：所提算法将中继选择、两跳子载波配对与功率分配联合优化以进一步提升系统吞吐量,同时引入子载波分配因子约束,保证了算法的公平性。     

认知型飞蜂窝网络中的子信道分配与功率控制

为了解决宏蜂窝与飞蜂窝构成的两层异构网络上行干扰与资源分配问题,提出了一种在认知型飞蜂窝的双层异构网中结合子信道分配和功率控制进行资源分配的框架。通过对异构网中跨层干扰问题进行分析与建模,将求解最优子信道分配矩阵和用户发射功率矩阵作为干扰管理问题的解决方法。模型中认知型飞蜂窝网络子信道和飞蜂窝网络用户构成非合作博弈,双方利用效用函数最优值进行匹配,构成初始信道分配矩阵;再由接入控制器根据接入条件从初始信道分配矩阵中筛选用户,并优化接入用户的发射功率矩阵,得到最优子信道分配矩阵和功率矩阵。仿真结果表明,优化框架提高了双层异构网络中飞蜂窝网络用户的吞吐量和接入率,降低了异构网中跨层干扰。     

分布式Alamouti空时码的信道容量及最优资源分配方案

该文针对基于译码转发协议的分布式Alamouti空时码(DF-DASTC)系统的信道容量以及最优资源分配策略问题。利用退化中继信道模型,推导得到了DF-DASTC系统在衰落信道下的信道容量闭式解。以DF-DASTC信道容量最大化为目标,对该系统在固定带宽分配时,中继及信源节点的最优功率分配方案进行了研究,推导得到了DF-DASTC系统的最优功率分配方案的闭式解。利用凸优化理论,将以DF-DASTC信道容量最大化为目标函数的多目标优化问题转换为非线性不等式约束的单目标凸优化问题,进一步得到了可变带宽分配时的DF-DASTC系统的最优带宽和功率分配策略。理论分析和系统仿真表明,该文所提出的资源分配策略,比平均分配的资源方案具有更大的信道容量。另外,该文的最优资源分配策略适用于具有多个中继节点的无线中继网络,具有普适性。     

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.     

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.     

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.     

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.     

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.

     

Adaptive resource allocation in multiuser OFDM systems with proportional rate constraints

Multiuser orthogonal frequency division multiplexing (MU-OFDM) is a promising technique for achieving high downlink capacities in future cellular and wireless local area network (LAN) systems. The sum capacity of MU-OFDM is maximized when each subchannel is assigned to the user with the best channel-to-noise ratio for that subchannel, with power subsequently distributed by water-filling. However, fairness among the users cannot generally be achieved with such a scheme. In this paper, a set of proportional fairness constraints is imposed to assure that each user can achieve a required data rate, as in a system with quality of service guarantees. Since the optimal solution to the constrained fairness problem is extremely computationally complex to obtain, a low-complexity suboptimal algorithm that separates subchannel allocation and power allocation is proposed. In the proposed algorithm, subchannel allocation is first performed by assuming an equal power distribution. An optimal power allocation algorithm then maximizes the sum capacity while maintaining proportional fairness. The proposed algorithm is shown to achieve about 95% of the optimal capacity in a two-user system, while reducing the complexity from exponential to linear in the number of subchannels. It is also shown that with the proposed resource allocation algorithm, the sum capacity is distributed more fairly and flexibly among users than the sum capacity maximization method.     

Secure resource allocation in hybrid energy-harvesting relay and full-duplex receiver

Taking into account the wireless physical layer security in energy-constrained relaying systems,a secure resource allocation scheme was proposed under simultaneous wireless information and power transfer (SWIPT) protocol.The utility optimization problem was considered aiming to maximize the secrecy rate by jointly optimizing the power splitting (PS) ratio and the transmit powers under the constraint of the transmit powers of the nodes and the harvested energy of the relay.The objective problem,which is non-convex,was decoupled into two subproblems.One was to optimize the PS ratio,another was to optimize the transmit powers.The optimal solution of the subproblems can be obtained in the closed-form.Then,the suboptimal solution is obtained with the proposed convergent iterative algorithm.Simulation results show the effects of artificial noise signal,residual self-interference signal,transmit power of nodes,amplification factor of relay and other factors on the security performance.Compared with the traditional gradient descent algorithm,the proposed algorithm can reduce more than 80% of the computational load,while the algorithm has the slightly better performance.     

Asymptotic performance analysis of untrusted relay system with full-duplex jamming destination

The cooperative relay technique in the field of physical layer security is widely concerned by the academic community,due to the advantages of increasing the network capacity and expanding the network coverage.However,cooperative relays may play as untrusted nodes in some certain circumstances.Based on this,to enhance the secrecy performance of untrusted relay systems,a novel full-duplex destination jamming (FDJ) scheme was proposed in the Rayleigh fading channel.In order to maximize the system’s secrecy capacity,a switchable split-optimal antenna selection (OAS) scheme was proposed for a multiple-antenna destination,the power allocation optimization scheme between the source and destination was designed,and the corresponding closed-form expressions of secrecy performance were given.In the large-scale antennas analysis,the closed-form expressions of the ergodic achievable secrecy rate and the optimal power allocation factor of instantaneous secrecy capacity for the FDJ-OAS scheme were derived.Furthermore,based on different asymptotic cases,the asymptotic analyses of secrecy outage probability for the FDJ-OAS scheme were significantly analyzed.Simulation results show that the analytical curves match well with the Monte-Carlo simulation results.It is concluded that the diversity order of the FDJ-OAS scheme is proportional to the number of antennas and antenna diversity can be achieved,which reveals the advantages of the proposed FDJ-OAS scheme.     

Dynamic Resource Allocation in OFDMA-Based DF Cooperative Relay Networks

This paper investigates the Resource allocation problem in OFDMA-based decode-and-forward cooperative communication systems. The objective is to maximize the sum throughput under the constraints of joint total transmission power and subchannels occupation, while maintaining the maximum fairness among multiple relay nodes. Since the optimal solution to this combinatorial problem is extremely computationally complex to obtain, we propose a low-complexity suboptimal algorithm that allocates subchannel and power separately. In the proposed algorithm, subchannel allocation over the relay nodes is first performed under the assumption of equal power distribution. Then, an optimal power allocation algorithm named multi-level water-filling is used to maximize the sum rate. The simulation results show that the performance of the proposed algorithm can approach asymptotically to that of the optimal algorithm while enhancing the fairness among all relay nodes and reducing computational complexity from exponential to linear with the number of subchannels. It is also shown that the proposed equal power distribution algorithm with subchannel permutation (SP) outperforms the one without SP.     

能量收集系统中基于能量协同和协同干扰的保密传输方案

研究节点具备能量收集能力的中继窃听信道保密速率的优化问题,提出一种基于人工噪声协同干扰和节点间能量协同的物理层安全传输策略.各节点采用储能-发送模式工作,即先收集能量,再用于数据传输.中继节点采用放大转发方式,目的节点发送人工噪声进行协同干扰.由于中继节点所需功耗较高,目的节点将用于发送干扰之外的剩余能量转移给中继节点.给出以最大化保密速率为目标函数,优化能量吸收时间比例系数和干扰功率分配因子的两步优化算法.仿真结果表明人工噪声和能量协同的引入能有效提高系统的保密传输速率.