Joint resource allocation for hybrid NOMA-assisted MEC in 6G networks

Multi-access Edge Computing (MEC) is an essential technology for expanding computing power of mobile devices, which can combine the Non-Orthogonal Multiple Access (NOMA) in the power domain to multiplex signals to improve spectral efficiency. We study the integration of the MEC with the NOMA to improve the computation service for the Beyond Fifth-Generation (B5G) and the Sixth-Generation (6G) wireless networks. This paper aims to minimize the energy consumption of a hybrid NOMA-assisted MEC system. In a hybrid NOMA system, a user can offload its task during a time slot shared with another user by the NOMA, and then upload the remaining data during an exclusive time duration served by Orthogonal Multiple Access (OMA). The original energy minimization problem is non-convex. To efficiently solve it, we first assume that the user grouping is given, and focuses on the one group case. Then, a multilevel programming method is proposed to solve the non-convex problem by decomposing it into three subproblems, i.e., power allocation, time slot scheduling, and offloading task assignment, which are solved optimally by carefully studying their convexity and monotonicity. The derived solution is optimal to the original problem by substituting the closed expressions obtained from those decomposed subproblems. Furthermore, we investigate the multi-user case, in which a close-to-optimal algorithm with low-complexity is proposed to form users into different groups with unique time slots. The simulation results verify the superior performance of the proposed scheme compared with some benchmarks, such as OMA and pure NOMA.     

Robust resource allocation algorithm for heterogeneous wireless networkwith SWIPT

To improve energy efficiency and robustness of heterogeneous wireless networks with wireless information and power transfer,the robust joint transmit power and power splitting resource allocation problem was studied.Based on mini-max probability machine and Dinkelbach method,the original NP-hard problem was transformed into a solvable convex optimization form,meanwhile a distributed dual resource allocation algorithm was proposed.Additionally,both computational complexity and robust sensitivity were analyzed.Simulation results show that the proposed algorithm can guarantee the quality of service requirements of macro cellular users and femtocell users under channel uncertainties.     

Optimal resource allocation solutions for heterogeneous cognitive radio networks

Cognitive radio networks (CRN) are currently gaining immense recognition as the most-likely next-generation wireless communication paradigm, because of their enticing promise of mitigating the spectrum scarcity and/or underutilisation challenge. Indisputably, for this promise to ever materialise, CRN must of necessity devise appropriate mechanisms to judiciously allocate their rather scarce or limited resources (spectrum and others) among their numerous users. ‘Resource allocation (RA) in CRN', which essentially describes mechanisms that can effectively and optimally carry out such allocation, so as to achieve the utmost for the network, has therefore recently become an important research focus. However, in most research works on RA in CRN, a highly significant factor that describes a more realistic and practical consideration of CRN has been ignored (or only partially explored), i.e., the aspect of the heterogeneity of CRN. To address this important aspect, in this paper, RA models that incorporate the most essential concepts of heterogeneity, as applicable to CRN, are developed and the imports of such inclusion in the overall networking are investigated. Furthermore, to fully explore the relevance and implications of the various heterogeneous classifications to the RA formulations, weights are attached to the different classes and their effects on the network performance are studied. In solving the developed complex RA problems for heterogeneous CRN, a solution approach that examines and exploits the structure of the problem in achieving a less-complex reformulation, is extensively employed. This approach, as the results presented show, makes it possible to obtain optimal solutions to the rather difficult RA problems of heterogeneous CRN.     

Optimal resource allocation for energy efficiency in coordinated multicell OFDMA networks

Because energy efficiency (EE) is inevitable in future wireless cellular networks, in this paper, we focus on improving the number of bits delivered to users for each unit energy consumption in the downlink of orthogonal frequency‐division multiple access cellular networks with base stations (BSs) coordination. Specifically, each BS shares the channel qualities of users with others and jointly choose the set of co‐channel users and the transmit power allocated to maximize the EE of the system subject to the transmit power ceiling of each BS and minimum required data rate. We formulate the problem as a nonlinear fractional optimization problem, using nonlinear fractional programming, the original hard‐to‐solve problem is transferred to a new one that has the same optimal solution and is easier to solve, this enables two iterative algorithms that achieve nearly the same maximum EE. Numerical results are provided to show the convergence and superiority of the two proposed. Copyright © 2014 John Wiley & Sons, Ltd.     

Ambient BackCom in beyond 5G NOMA networks: A multi-cell resource allocation framework

The research of Non-Orthogonal Multiple Access (NOMA) is extensively used to improve the capacity of networks beyond the fifth-generation. The recent merger of NOMA with ambient Backscatter Communication (BackCom), though opening new possibilities for massive connectivity, poses several challenges in dense wireless networks. One such challenge is the performance degradation of ambient BackCom in multi-cell NOMA networks under the effect of inter-cell interference. Driven by providing an efficient solution to the issue, this article proposes a new resource allocation framework that uses a duality theory approach. Specifically, the sum rate of the multi-cell network with backscatter tags and NOMA user equipment is maximized by formulating a joint optimization problem. To find the efficient base station transmit power and backscatter reflection coefficient in each cell, the original problem is first divided into two subproblems, and then the closed form solution is derived. A comparison with the Orthogonal Multiple Access (OMA) ambient BackCom and pure NOMA transmission has been provided. Simulation results of the proposed NOMA ambient BackCom indicate a significant improvement over the OMA ambient BackCom and pure NOMA in terms of sum-rate gains.     

基于不完美CSI的D2D通信网络鲁棒能效资源分配算法

针对设备到设备(D2D)直连通信网络传统最优资源分配算法在随机信道时延、信道估计误差影响下鲁棒性弱的问题,该文在考虑参数不确定性影响的条件下,提出D2D用户总能效最大的鲁棒资源分配算法.考虑干扰功率门限、用户最小速率需求、最大传输功率和子信道分配约束,建立了下垫式频谱共享模式下多用户D2D网络资源分配模型.基于有界信道...     

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

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

面向窃听用户的RIS-MISO系统鲁棒资源分配算法

针对信道不确定性影响、用户信息泄露和能效提升等问题,该文提出一种基于不完美信道状态信息的可重构智能反射面(RIS)多输入单输出系统鲁棒资源分配算法。首先,考虑能量收集最小接收功率约束、合法用户最小保密速率约束、基站最大发射功率约束及RIS相移约束,基于有界信道不确定性,建立一个联合优化基站主动波束、能量波束、RIS相移矩阵的多变量耦合非线性资源分配问题。然后,利用Dinkelbach,S-procedure和交替优化方法,将原非凸问题转换成确定性凸优化问题,并提出一种基于连续凸近似的交替优化算法。仿真结果表明,与传统非鲁棒算法对比,所提算法具有较低的中断概率。     

Radio resource allocation using genetic algorithm in heterogeneous networks

Radio resource management to enable user association and resource block (RB) allocation is crucial for enhancing the performance of heterogeneous networks (HetNets), which are required for fifth generation (5G) mobile networks. This paper proposed a resource allocation technique based on a genetic algorithm (GA) for use in HetNets. We aimed to optimize user association and RB allocation simultaneously to fulfill multiple objectives, such as throughput and fairness measure. In addition to the four primary phases used in GA process, namely initialization, crossover, mutation, and selection, a further operator was provided for managing illegal offspring generated during a GA process. We performed a simulation to compare the proposed GA‐based approach with best channel quality indicator (CQI) algorithm and integer linear programming (ILP) approach in terms of total throughput and fairness measure. The simulation results revealed that the total throughput obtained using the proposed approach is 32.7% and 37.6% better than that obtained using the ILP and best CQI approaches, respectively. Moreover, the fairness measure obtained using the proposed GA‐based approach was 31.8% and 33.2% higher than that obtained using ILP and best CQI approaches, respectively.     

协作D2D异构网络的联合资源分配和功率控制

针对下行协作D2D(Device-to-Device)异构网络中复用蜂窝用户的联合资源分配和功率控制问题,提出了一种量子珊瑚礁优化算法(Quantum Coral Reef Optimization Algorithm,QCROA).首先,构建异构网络模型并推导得到整个网络总吞吐量的数学表达式;其次,基于QCROA算法...     

Optimal resource allocation for heterogeneous traffic in multipath networks

Multipath networks allow each source to send packets from it to its destination over multiple paths, which increases the available bandwidth and throughput for source‐destination pairs. Recently, a variety of flow control schemes have been presented for multipath networks to achieve optimal resource allocation. Unfortunately, much of the investigation focused on elastic traffic with controllable packet injection rates. Networks have witnessed an increase in real‐time traffic (voice and video), which are inelastic. We consider resource allocation for heterogeneous traffic in multipath networks and formulate an optimization problem, which is intrinsically difficult nonconvex. In order to address the aforementioned issue and obtain the optimum, we approximate an equivalent problem of the original optimization problem to a strictly convex problem and present a primal‐dual resource allocation algorithm for the approximation problem, which converges to an optimal solution satisfying the Karush‐Kuhn‐Tucker conditions of the original problem. We evaluate its convergence performance through theoretical analysis and illustrate it with numerical examples. Copyright © 2014 John Wiley & Sons, Ltd.     

基于改进遗传算法的C-RAN网络动态无线资源分配

针对云无线网络(Cloud Radio Access Network,C-RAN)中传统静态资源分配效率低下以及动态无线资源分配中资源种类单一的问题,提出了一种基于用户服务质量(Qulity of Service,QoS)约束的动态无线资源分配方案,对无线资源从无线射频单元(Remote Radio Head,RRH)选择、子载波分配和RRH功率分配三个维度进行研究.首先,根据传统的C-RAN系统传输模型和QoS约束在时变业务环境下建立了以发射功率为变量,以吞吐量最大为优化目标的优化问题;然后,基于改进的遗传算法,将原优化方案转变为通过优化RRH选择、子载波分配和RRH功率分配来达到提高系统吞吐量的目的;最后,将改进的遗传算法与其他智能算法在种群规模变化下进行了时间复杂度对比.实验结果表明,所提算法具有较低时间复杂度,所提资源分配方案下的平均吞吐量增益为17％.     

基于深度学习的异构资源分配算法研究

资源分配是目前云计算领域中一个重要的研究方向。在异构云计算体系结构下的复杂应用问题研究中,为了满足异构资源分配的需求,提升资源利用效率,文中提出了一种基于深度学习的面向应用的资源分配算法。该算法将数据特征进行量化,更加精确地刻画了不同服务器资源之间的性能差异,在分配算法中加入了一个工作负载预测模型,使给出的资源分配方案与需求更加匹配,同时提高了资源利用率。     

End-to-end utility-based resource allocation for multi-RAT nodes in heterogeneous cognitive wireless networks

This paper studies the problem of effective resource allocation for multi-radio access technologies (Multi-RAT) nodes in heterogeneous cognitive wireless networks (HCWNs). End-to-end utility, which is defined as the delay of end-to-end communication, is taken into account in this paper. In the scenario of HCWNs, it is assumed that the cognitive radio nodes have the ability of Multi-RAT and can communicate with each other through different paths simultaneously by splitting the arrival packets. In this paper, the problem is formulated as the optimization of split ratio and power allocation of the source cognitive radio node to minimize the delay of end-to-end communication, and a low complexity step-by-step iterative algorithm is proposed. Numerical results show good performance of the proposed algorithm over two other conventional algorithms.     

Deep reinforcement learning-based resource allocation for D2D communications in heterogeneous cellular networks

Device-to-Device (D2D) communication-enabled Heterogeneous Cellular Networks (HCNs) have been a promising technology for satisfying the growing demands of smart mobile devices in fifth-generation mobile networks. The introduction of Millimeter Wave (mm-wave) communications into D2D-enabled HCNs allows higher system capacity and user data rates to be achieved. However, interference among cellular and D2D links remains severe due to spectrum sharing. In this paper, to guarantee user Quality of Service (QoS) requirements and effectively manage the interference among users, we focus on investigating the joint optimization problem of mode selection and channel allocation in D2D-enabled HCNs with mm-wave and cellular bands. The optimization problem is formulated as the maximization of the system sum-rate under QoS constraints of both cellular and D2D users in HCNs. To solve it, a distributed multiagent deep Q-network algorithm is proposed, where the reward function is redefined according to the optimization objective. In addition, to reduce signaling overhead, a partial information sharing strategy that does not observe global information is proposed for D2D agents to select the optimal mode and channel through learning. Simulation results illustrate that the proposed joint optimization algorithm possesses good convergence and achieves better system performance compared with other existing schemes.     

Utility‐optimal cross‐layer resource allocation in distributed wireless cooperative networks

In this paper, we propose a distributed cross‐layer resource allocation algorithm for wireless cooperative networks based on a network utility maximization framework. The algorithm provides solutions to relay selections, flow pass probabilities, transmit rate, and power levels jointly with optimal congestion control and power control through balancing link and physical layers such that the network‐wide utility is optimized. Via dual decomposition and subgradient method, we solve the utility‐optimal resource allocation problem by subproblems in different layers of the protocol stack. Furthermore, by introducing a concept of pseudochannel gain, we model both the primal direct logical link and its corresponding cooperative transmission link as a single virtual direct logical link to simplify our network utility framework. Eventually, the algorithm determines its primal resource allocation levels by employing reverse‐engineering of the pseudochannel gain model. Numerical experiments show that the convergence of the proposed algorithm can be obtained and the performance of the optimized network can be improved significantly. Copyright © 2012 John Wiley & Sons, Ltd.     

Low complexity resource allocation and scheduling algorithms for downlink SDMA systems

The downlink zero-forcing beamforming strategy in the case of random packet arrivals is investigated. Under this setting, the relevant fairness criterion is the stabilization of all buffer queues which guarantees a bounded average delay for all users. It has been shown that allocating resources to maximize a queue-length-weighted sum of the rates is a stabilizing policy. However, the high complexity of user selection and the feasible rates determination for optimal scheme may prevent the real-time scheduling operation. Two low complexity algorithms are provided taking the channel state, queue state and orthogonality into account. In particular, the authors pick the first user with the largest product between channel gain and queuing length, and select the remaining users to construct candidate user set based on the greedy user selection method or channel orthogonal user selection method. Then, the power and rate allocation for the selected users are implemented based on the modified water-filling method. The complexity of the proposed algorithms is analyzed. The average delay and average throughput are studied in homogeneous scenarios and heterogeneous scenarios, respectively. Simulation results show that the proposed algorithms can take full advantage of the multi-user diversity gain and provide average delay (or throughput) and fairness improvement compared with channel-aware-only schemes.     

一种5G异构云无线接入网络的D2D资源分配算法

为了解决设备对设备(Device-to-Device,D2D)资源共享带来的信号干扰问题,提出了一种5G异构云无线接入网络的D2D通信资源分配算法.在保证服务质量的前提下,将宏用户设备的频谱资源分配给D2D和中继用户设备,并且把资源分配问题看作一对一的匹配博弈.采用婚姻匹配理论,得到初始的匹配方案.在初始匹配的基础上,提出了一种遵循卡尔多-希克斯(Kaldor-Hicks)原则的资源交换策略,以提高系统的吞吐量.仿真结果表明,该资源分配算法收敛较快,与现有方案相比,能使系统吞吐量提升15％以上,能给系统用户带来约10％的增益,并且有较强抗信道干扰能力.     

Fairness based resource allocation for multiuser MISO-OFDMA systems with beamforming

Resource allocation problem in multiuser multiple input single output-orthogonal frequency division multiple access (MISO-OFDMA) systems with downlink beamforming for frequency selective fading channels is studied. The article aims at maximizing system throughput with the constraints of total power and bit error rate (BER) while supporting fairness among users. The downlink proportional fairness (PF) scheduling problem is reformulated as a maximization of the sum of logarithmic user data rate. From necessary conditions on optimality obtained analytically by Karush-Kuhn-Tucker (KKT) condition, an efficient user selection and resource allocation algorithm is proposed. The computer simulations reveal that the proposed algorithm achieves tradeoff between system throughput and fairness among users.     

Cross-layer resource allocation for QoS guarantee with finite queue constraint in multirate OFDMA wireless networks

Efficient radio resource allocation is essential to provide quality of service （QoS） for wireless networks. In this article, a cross-layer resource allocation scheme is presented with the objective of maximizing system throughput, while providing guaranteed QoS for users. With the assumption of a finite queue for arrival packets, the proposed scheme dynamically a/locates radio resources based on user＇s channel characteristic and QoS metrics derived from a queuing model, which considers a packet arrival process modeled by discrete Markov modulated Poisson process （dMMPP）, and a multirate transmission scheme achieved through adaptive modulation. The cross-layer resource allocation scheme operates over two steps. Specifically, the amount of bandwidth allocated to each user is first derived from a queuing analytical model, and then the algorithm finds the best subcarrier assignment for users. Simulation results show that the proposed scheme maximizes the system throughput while guaranteeing QoS for users.