Abstract Nowadays, wireless communication system is facing the problems of spectrum resource shortage. Cognitive radio technology allows cognitive users to use the spectrums authorized to primary users to improve the spectrum utilization. In this paper, a cognitive network model based on hybrid overlay–underlay spectrum access mode is established. To solve the resource allocation problem, a multi‐agent resource allocation algorithm based on graph convolution reinforcement learning which combines deep Q network (DQN) and graph attention network is proposed. DQN is used for action selection and graph attention network is used to obtain the information about neighbours, so as to achieve local cooperation. The proposed algorithm can adaptively optimize cognitive network throughput, spectrum efficiency, or power efficiency by controlling the transmission power and channel selection of cognitive users. To improve the information interaction efficiency, the agent's states are divided into two categories, whether it needs to interact with neighbours or not, which shortens training time and improves convergence speed. Simulation results show that the proposed algorithm can effectively improve the power efficiency of cognitive networks. Compared with Q‐learning, DQN and exiting graph convolutional reinforcement learning algorithm, the proposed algorithm has faster convergence speed and higher stability, and obtains higher network power efficiency.

Abstract Network slicing is considered to be a key feature of the 5th generation mobile networks. It permits multiple tenants, i.e. mobile virtual network operators, to share virtual resources. However, each tenant only considers the individual slice utility, which leads to unfair resource allocation among tenants. To achieve the aim that the infrastructure provider can fairly allocate virtual resources to tenants, a two‐layer resource allocation architecture in a heterogeneous radio access network (RAN) is proposed and it is formulated as a mathematical program with equilibrium constraints (MPEC). The existence of the solution in the lower layer is proved via the properties of the quasi‐variational problem, indicating that the MPEC is solvable. Combining the two‐layer architecture and successive convex approximation method, a fair algorithm is proposed, which provides fair resource allocation strategies for the infrastructure provider. Compared with the existing static slicing and social optimal methods, the analysis and simulation results confirm that the proposed algorithm weighs the utilities of the total network system and each tenant. In addition, regarding their utilities, the gap between the proposed method and the social optimal is within 5%, which outperforms static slicing.

Abstract Network slicing and mobile edge computing are key technologies in 5G/6G networks. Stable allocation of slicing resources is a challenge while communication and computation offloading coexist. To meet the service requirements of communication and computation offloading, a radio access network model which consists of enhanced mobile broadband (eMBB) slicing users, ultra‐reliable low latency communication (URLLC) slicing users, base stations integrated with MEC servers, and fog nodes with computing power are proposed. By employing the Lyapunov optimisation technique, a slicing resource allocation algorithm is proposed to maintain the queue stability and minimise the energy consumption of the system. For eMBB and URLLC slices, long time interval and short time interval resource allocation algorithms are proposed respectively. Simulation results show that the proposed algorithm can guarantee the long‐term stability of the network system while ensuring the service requirements.

This paper investigates the network slicing in the virtualized wireless network. We consider a downlink orthogonal frequency division multiple access system in which physical resources of base stations are virtualized and divided into enhanced mobile broadband (eMBB) and ultrareliable low latency communication (URLLC) slices. We take the network slicing technology to solve the problems of network spectral efficiency and URLLC reliability. A mixed-integer programming problem is formulated by maximizing the spectral efficiency of the system in the constraint of users’ requirements for two slices, i.e., the requirement of the eMBB slice and the requirement of the URLLC slice with a high probability for each user. By transforming and relaxing integer variables, the original problem is approximated to a convex optimization problem. Then, we combine the objective function and the constraint conditions through dual variables to form an augmented Lagrangian function, and the optimal solution of this function is the upper bound of the original problem. In addition, we propose a resource allocation algorithm that allocates the network slicing by applying the Powell–Hestenes–Rockafellar method and the branch and bound method, obtaining the optimal solution. The simulation results show that the proposed resource allocation algorithm can significantly improve the spectral efficiency of the system and URLLC reliability, compared with the adaptive particle swarm optimization (APSO), the equal power allocation (EPA), and the equal subcarrier allocation (ESA) algorithm. Furthermore, we analyze the spectral efficiency of the proposed algorithm with the users’ requirements change of two slices and get better spectral efficiency performance.

In this paper, multi-cell power allocation approach is researched. Different from the traditional optimization decomposition method, Deep Reinforcement Learning (DRL) method is employed to solve the power allocation issue which is an NP-hard problem. The objective of our work is to maximize the overall capacity of the entire network in the scenario where the base stations are randomly and densely distributed. We propose a wireless resource mapping method and a deep neural network for multi-cell power allocation named as Deep-Q-Full-Connected-Network (DQFCNet). Compared with the water-filling power allocation and Q-learning method, DQFCNet can achieve a higher overall capacity. Furthermore, the simulation results show that DQFCNet has significant improvement in convergence speed and stability.