Downlink Resource Allocation for NOMA-Based Hybrid Spectrum Access in Cognitive Network

To solve the contradiction between limited spectrum resources and increasing communication demand,this paper proposes a wireless resource allocation scheme based on the Deep Q Network(DQN)to allocate radio resources in a downlink multi-user cognitive radio(CR)network with slicing.Secondary users(SUs)are multiplexed using non-orthogonal multiple access(NOMA).The SUs use the hybrid spectrum access mode to improve the spectral efficiency(SE).Considering the demand for multiple services,the enhanced mobile broadband(eMBB)slice and ultrareliable low-latency communication(URLLC)slice were established.The proposed scheme can maximize the SE while ensuring Quality of Service(QoS)for the users.This study established a mapping relationship between resource allocation and the DQN algorithm in the CR-NOMA network.According to the signal-to-interference-plusnoise ratio(SINR)of the primary users(PUs),the proposed scheme can output the optimal channel selection and power allocation.The simulation results reveal that the proposed scheme can converge faster and obtain higher rewards compared with the Q-Learning scheme.Additionally,the proposed scheme has better SE than both the overlay and underlay only modes.

User Scheduling and Slicing Resource Allocation in Industrial Internet of Things

Heterogeneous base station deployment enables to provide high capacity and wide area coverage.Network slicing makes it possible to allocate wireless resource for heterogeneous services on demand.These two promising technologies contribute to the unprecedented service in 5G.We establish a multiservice heterogeneous network model,which aims to raise the transmission rate under the delay constraints for active control terminals,and optimize the energy efficiency for passive network terminals.A policygradient-based deep reinforcement learning algorithm is proposed to make decisions on user association and power control in the continuous action space.Simulation results indicate the good convergence of the algorithm,and higher reward is obtained compared with other baselines.

Cognitive RAN Slicing Resource Allocation Based on Stackelberg Game

The cognitive network has become a promising method to solve the spectrum resources shortage problem.Especially for the optimization of network slicing resources in the cognitive radio access network(RAN),we are interested in the profit of the mobile virtual network operator(MVNO)and the utility of secondary users(SUs).In cognitive RAN,we aim to find the optimal scheme for the MVNO to efficiently allocate slice resources to SUs.Since the MVNO and SUs are selfish and the game between the MVNO and SUs is difficult to reach equilibrium,we consider modeling this scheme as a Stackelberg game.Leveraging mathematical programming with equilibrium constraints(MPEC)and Karush-Kuhn-Tucker(KKT)conditions,we can obtain a single-level optimization problem,and then prove that the problem is a convex optimization problem.The simulation results show that the proposed method is superior to the noncooperative game.While guaranteeing the Quality of Service(QoS)of primary users(PUs)and SUs,the proposed method can balance the profit of the MVNO and the utility of SUs.