无线传感器网络中支持并行传输的信道与功率联合优化博弈算法

针对无线传感器网络中干扰日益增大引起网络容量下降、能耗增加的问题,该文建立了信道分配与功率控制联合优化博弈模型。在该模型中链路将既能保持自身成功传输又不影响其它链路传输的信道作为可选信道,以实现链路的并行传输。继而基于该模型设计了一种支持并行传输的信道分配与功率控制联合优化博弈算法(JCPGC)。该算法利用最佳响应策略对模型求解,并通过超模博弈等理论证明了JCPGC能够收敛到纳什均衡。此外,该算法充分考虑信道分配和功率控制之间独立又相互影响的关系提高了网络容量。仿真实验结果表明,JCPGC具有大容量、低干扰和低能耗的特性。     

多用户多载波无线携能通信系统的上下行联合资源分配

无线携能通信(SWIPT)技术是解决无线网络能量受限问题的有效方法,该文研究一个由基站(BS)和多用户组成的多载波SWIPT系统,其上行和下行链路均采用正交频分复用(OFDM)技术。在下行链路中,基站向用户同时进行信息与能量传输;在上行链路中,用户利用从基站接收的能量向基站回传信息。该文以最大化上下行加权和速率为目标,联合优化上行和下行的子载波分配和功率分配,提出基于拉格朗日对偶法和椭球法的最优联合资源分配算法。计算机仿真结果证实了该算法的有效性。     

无线传感器网络基于容量和传输能耗的功率与信道联合博弈算法

针对无线传感器网络(WSNs)日益增大的干扰导致网络容量下降的问题,同时考虑到网络能量有限性,该文综合网络容量和链路传输能耗,构建了高容量低传输能耗的功率控制与信道分配联合博弈模型,并通过理论分析证明该模型存在最优功率和最优信道。继而采用最佳响应策略,在该博弈模型基础上提出了一种功率控制与信道分配联合优化算法(PCOA),理论证明其能收敛到纳什均衡状态,且具有较小的信息复杂度。最后,仿真结果表明,PCOA算法能够达到降低网络干扰和链路能耗,增大网络容量的目的。     

基于非正交多址接入的网络切片联合用户关联和功率分配算法

为了满足网络切片多样化需求,实现无线虚拟资源的动态分配,该文提出在C-RAN架构中基于非正交多址接入的联合用户关联和功率资源分配算法。首先,该算法考虑在不完美信道条件下,以切片和用户最小速率需求及时延QoS要求、系统中断概率、前传容量为约束,建立在C-RAN场景中最大化长时平均网络切片总吞吐量的联合用户关联和功率分配模型。其次,将概率混合优化问题转换为非概率优化问题,并利用Lyapunov优化理论设计一种基于当前时隙的联合用户调度和功率分配的算法。最后采用贪婪算法求得用户关联问题次优解;基于用户关联的策略,将功率分配的问题利用连续凸逼近方法将其转换为凸优化问题并采用拉格朗日对偶分解方法获得功率分配策略。仿真结果表明,该算法能满足各网络切片和用户需求的同时有效提升系统时间平均切片总吞吐量。     

接入与回传一体化小基站的接入控制与资源分配联合优化算法

针对全双工无线接入与回传一体化小基站场景下长期的频谱效率和能效同时最大化问题,该文提出一种基于近似动态规划理论的接入与回传一体化小基站接入控制与资源分配联合优化算法。该算法首先联合考虑当前基站的资源使用和功率配置情况,在任一用户需求动态到达以及平均时延、小基站回传速率和传输功率约束下,使用受限马尔科夫决策过程(CMDP)建立频谱效率最大化和功率消耗最小化的多目标优化模型,其次运用切比雪夫理论将多目标优化问题转化为单目标问题,并使用拉格朗日对偶分解法进一步转化为非受限的马尔科夫决策过程(MDP)问题。最后,为了解决其求解时存在的“维度灾”爆炸问题,该文提出基于近似动态规划的无线接入与回传一体化小基站资源动态分配算法进行求解,得到此时的接入与资源分配策略。仿真结果表明,所提算法能在保证平均时延约束、小基站回传速率约束和传输功率约束的同时最大化长期平均频谱效率和能效。     

SCMA系统中一种新节能资源分配算法

随着移动网络的快速更新换代,无线通信系统的能耗急剧增加,考虑一种稀疏码多址接入(Sparse Code Multiple Access,SCMA)下行链路系统的节能策略,通过联合优化功率分配及子载波资源分配算法来最小化系统总功耗。由于该问题是一个非凸规划问题,很难求解,首先通过松弛整数和拉格朗日对偶分解将功率分配问题转化为一个标准的凸优化问题,然后综合考虑用户的特征,提出一种快速搜索算法对子载波进行分配。仿真结果和理论分析表明,所提出的联合功率分配及子载波资源分配算法可以有效地降低下行链路系统传输功耗和保证较好的用户公平性。     

基于深度学习的多用户Massive MIMO预编码方法

在下行链路传输场景中,发射机处的功率分配和波束赋形设计至关重要。考虑一个多用户Massive MIMO系统中总功率约束下最大化加权和速率问题,经典的WMMSE算法可以获取次优解,但计算复杂度过高。为了降低计算复杂度,提出了一种基于深度学习的快速波束赋形设计方法,该方法可以离线训练深度神经网络,利用训练后的神经网络求解最优波束赋形解,只需要简单的线性和非线性操作即可完成。实验结果显示,该方法可以逼近WMMSE算法精度的90%以上,同时计算复杂度和时延也大大降低。     

基于子载波配对的多用户协作中继系统资源分配算法

针对多用户协作中继系统中的功率最小化问题,提出了一种基于联合子载波配对及分配的资源分配算法。首先根据不同用户的目标速率要求及平均信道增益进行子载波数目的分配;然后以信道条件最佳为准则,提出了一种联合子载波配对及分配的多用户迭代算法,以实现对每个用户的中继链路和直传链路分别进行子载波配对及虚拟配对;最后利用注水算法对子载波进行功率分配,从而保证各用户以最小功率进行传输。仿真结果表明,该算法在满足用户目标速率的情况下,能够进行有效的子载波配对及分配,从而最小化系统的发射功率。     

无人机数据链下行链路的时隙空分复用算法

针对无人机数据链的下行链路,考虑波束空分复用、波束数目与节点功率限制的多维约束条件,以最大化下行链路总吞吐量为优化目标,构建了联合波束分配、时隙分配和功率控制的随机优化问题。基于李雅普诺夫优化方法,解析最优解的数学特征,提出了一种低复杂度的联合波束分配和功率控制的时隙空分复用算法。最后,将所提方法与基于功率控制的时隙分配算法、联合波束分配和恒定功率的时隙空分复用算法进行了对比,仿真结果表明,所提方法能够显著提升网络吞吐量,降低接入时延。     

一种面向无人机通信的协作干扰安全传输技术

本文利用无人机的高机动特性带来信道的动态变化这一机理,通过合理地控制无人机位置,靠近合法节点并远离窃听节点,增加合法节点的信道增益,削弱窃听节点的信道增益,从而提高信源端和目的端的安全通信容量。已有的无人机空地信道模型大多仅考虑视距传输链路,本文在此基础上增加了非视距链路（Not Line of Sight, NLOS）,并且在窃听者位置存在估计误差条件下,建立了两架无人机协同通信场景,在上述场景下通过合理规划两架无人机飞行轨迹,增强合法信道增益,削弱窃听信道增益,并联合无人机的功率分配,实现最大化平均保密速率。该优化问题为非凸问题,因此采用了连续凸近似（Successive Convex Approximation, SCA）以及块坐标下降算法 （Block Coordinate Descent Algorithm, BCD）来解决问题。仿真结果表明在视距链路和非视距链路同时存在的前提下,通过规划两架无人机的飞行轨迹,信号功率,能有效提升无人机通信系统的保密速率。      

基于人工噪声辅助的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.     

多天线系统中多中继传输的时间分配和功率分配优化方法

本文考虑单小区内的两个中继使用解码转发的方法为两个用户提供下行数据的场景,基站和中继配置多根天线,用户配置单天线。两中继使用相同的频率资源同时为两个用户提供服务。为减小两中继同时向两用户传输时产生的干扰,中继到用户的传输采用协作干扰避免的策略;相应的基站到中继的传输采用多用户空分复用的传输策略。本文在时间分配和功率分配两个方面对上述两跳传输过程进行了优化,提出了两跳传输最优的时间分配策略。由于功率分配最优化问题难以求解,本文提出了一种匹配链路容量的次优功率分配方法,并对其进行简化以降低复杂度。通过仿真可以看出,简化的功率分配方法与匹配链路容量的功率分配性能很接近;所提出的时间分配和功率分配方案可以获得有效的性能提升。      

基于链路间干扰辅助的中继D2D系统安全通信方法

在包含中继节点的D2D(Device-to-Device)系统中,针对蜂窝链路与D2D链路同时受窃听的问题,提出一种基于链路间干扰辅助的中继D2D系统安全通信方法.首先,确定蜂窝链路与D2D链路上下行发送模式;然后,在基站与中继节点的发送信号中添加人工噪声,协作干扰窃听者;最后,对基站功率分配与D2D功率控制进行了优化,以实现不同类型链路间干扰辅助保障系统安全.仿真结果表明,所提出的安全通信方法在保密速率方面比SVD(Singular Value Decomposition)与ZF(Zero-Forcing)预编码方法提高了1.5bit/s/Hz.     

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.     

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.     

Resource allocation in orthogonal frequency division multiple access‐based cognitive radio systems with minimum rate constraints

In this paper, resource allocation problem in orthogonal frequency division multiple access‐based cognitive radio (CR) systems to maintain minimum transmission rate constraints of CR users (CRUs) with the specified interference thresholds is investigated. Firstly, a single primary user (PU) CR system is considered, and a suboptimal resource allocation algorithm to maximize the sum transmission rate of all CRUs is proposed. Secondly, the single‐PU scenario is extended to multiple‐PU case, and an asymptotically optimal resource allocation algorithm is proposed using dual methods subject to constraints on both interference thresholds of PUs and total transmit power of all CRUs. Analysis and numerical results show that, in contrast to classical resource allocation algorithms, the proposed algorithm can achieve higher transmission rate and guarantee each CRU's minimum transmission rate in both scenarios. Copyright © 2012 John Wiley & Sons, Ltd.     

Joint linear precoder and power allocation design for uplink MIMO systems with limited feedback

In this article, the authors consider joint design of a linear precoder and power allocation for uplink multiuser multiple input multiple output (MIMO) communication systems with limited feedback to improve the bit error rate (BER) performance for all users. Precoder selection from the codebook set is directly based on the exact BER performance, instead of other suboptimal criteria, to achieve the optimal precoder matrix, but closed-form expressions may not exist in the view of power allocation based directly on the BER criterion. From this perspective, the authors propose the joint transmitter optimization algorithm for the consideration ofprecoder design, with total power constraint for asymptotic MBER (AMBER) criterion. In this AMBER criterion, a closed-form solution has been derived for power allocation with an optimal precoder. The simulation results show that the proposed joint design algorithm can achieve a much better performance than precoding with uniform power allocation and only consideration of power allocation.     

Dynamic Resource Allocation in Non-orthogonal Multiple Access Using Weighted Maximin Fairness Strategy for a UAV Network

Non-orthogonal multiple access (NOMA) with power domain multiplexing and successive interference cancellation (SIC) is one of the promising technologies for future wireless communication. The performance of NOMA is highly dependent on resource allocation such as power allocation and channel assignment. In this paper, we investigate the power allocation (PA) scheme, to optimize the weighted maximin fairness (MMF) for 2-user and 3-user clusters. We utilize the particle swarm optimization (PSO) based algorithm for power allocation due to its promising behavior. Application area of NOMA is becoming broader, then, we considered a cellular network, assisted by an unmanned aerial vehicle (UAV) as the base station (BS) which is integrated with the NOMA system. The PA for weighted MMF problem in NOMA is non-convex, it is difficult to find out the optimal solution directly. Simulation results show the performance of PSO-based algorithm in different adaptive weights and its convergence characteristics. We have also shown that the rate and fairness tradeoff using weighted maximin fairness. Numerical results compare the performance of NOMA and orthogonal multiple access (OMA) and prove the significance of the proposed algorithm.

     

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.     

Resource allocation with proportional rate fairness in orthogonal frequency division multiple access relay networks

We address the problem of subchannel and transmission power allocation in orthogonal frequency division multiple access relay networks with an aim to maximize the sum rate and maintain proportional rate fairness among users. Because the formulated problem is a mixed‐integer nonlinear optimization problem with an extremely high computational complexity, we propose a low‐complexity suboptimal algorithm, which is a two‐step separated subchannel and power allocation algorithm. In the first step, subchannels are allocated to each user, whereas in the second step, the optimal power allocation is carried out on the basis of the given subchannel allocation and the nonlinear interval Gauss–Seidel method. Simulation results have demonstrated that the proposed algorithm can achieve a good trade‐off between the efficiency and the fairness compared with two other existing relevant algorithms. In particular, the proposed algorithm can always achieve 100% fairness under various conditions. Copyright © 2012 John Wiley & Sons, Ltd.