Cognitive RAN Slicing Resource Allocation Based on Stackelberg Game  

作　　者：Tengteng Ma Yong Zhang Siyu Yuan Zhenjie Cheng 

机构地区：[1]School of Electronic Engineering,Beijing University of Posts and Telecommunications,Beijing 100876,China [2]Beijing Key Laboratory of Work Safety Intelligent Monitoring(Beijing University of Posts and Telecommunications),Beijing 100876,China [3]Network Planning Research and innovation Center,China Telecom Corporation Limited Research Institute,Beijing 102209,China

出　　处：《China Communications》2022年第5期12-23,共12页中国通信（英文版）

基　　金：This work was supported by National Natural Science Foundation of China(No.61971057).

摘　　要：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.

关 键 词：cognitive RAN network slicing MVNO Stackelberg game MPEC KKT 

分 类 号：TN925[电子电信—通信与信息系统]