{"title":"Reconfigurable RAN Slicing for Ultra-Dense LEO Satellite Networks via DRL","authors":"Yuru Liu;Ting Ma;Xiaohan Qin;Haibo Zhou;Xuemin Sherman Shen","doi":"10.1109/TCCN.2024.3449643","DOIUrl":null,"url":null,"abstract":"Ultra-dense low earth orbit (LEO) satellite network (UD-LSN) is an emerging architecture in the sixth-generation communication system. Network slicing technology can build multiple virtual logical networks for services provided by UD-LSNs on the common physical network. The spatiotemporal variabilities of service requirements and available satellite resources make it necessary to perform reconfigurable resource slicing in UD-LSNs. In this paper, we present a reconfigurable radio access network (RAN) slicing architecture based on grouping and clustering in UD-LSNs. Time is separated into several slicing windows, each further separated into multiple time slots. We take into account the features of the rate-constrained and delay-constrained slices and formulate an optimization problem aiming at maximizing the long-term slicing revenue that involves resource utilization, the service level agreement satisfaction ratio (SSR), and reconfiguration revenues. The problem is tackled by a two-tier deep reinforcement learning (DRL)-based reconfigurable satellite RAN resource slicing and user access (TDRL-RSUA) algorithm. We decouple the original problem into the RAN resource slicing subproblem in slicing windows and user access subproblem at time slots. Specifically, the resource slicing subproblem is solved with the multi-discrete mask Proximal Policy Optimization (MDMPPO) algorithm, while the user access subproblem is solved with the many-to-one matching algorithm. Simulation results demonstrate that our TDRL-RSUA algorithm can improve resource utilization by more than 30% in comparison to the non-reconfigurable resource slicing strategy and achieves higher slicing revenue and SSR.","PeriodicalId":13069,"journal":{"name":"IEEE Transactions on Cognitive Communications and Networking","volume":"11 1","pages":"566-580"},"PeriodicalIF":7.0000,"publicationDate":"2024-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Cognitive Communications and Networking","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10648932/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"TELECOMMUNICATIONS","Score":null,"Total":0}
引用次数: 0
Abstract
Ultra-dense low earth orbit (LEO) satellite network (UD-LSN) is an emerging architecture in the sixth-generation communication system. Network slicing technology can build multiple virtual logical networks for services provided by UD-LSNs on the common physical network. The spatiotemporal variabilities of service requirements and available satellite resources make it necessary to perform reconfigurable resource slicing in UD-LSNs. In this paper, we present a reconfigurable radio access network (RAN) slicing architecture based on grouping and clustering in UD-LSNs. Time is separated into several slicing windows, each further separated into multiple time slots. We take into account the features of the rate-constrained and delay-constrained slices and formulate an optimization problem aiming at maximizing the long-term slicing revenue that involves resource utilization, the service level agreement satisfaction ratio (SSR), and reconfiguration revenues. The problem is tackled by a two-tier deep reinforcement learning (DRL)-based reconfigurable satellite RAN resource slicing and user access (TDRL-RSUA) algorithm. We decouple the original problem into the RAN resource slicing subproblem in slicing windows and user access subproblem at time slots. Specifically, the resource slicing subproblem is solved with the multi-discrete mask Proximal Policy Optimization (MDMPPO) algorithm, while the user access subproblem is solved with the many-to-one matching algorithm. Simulation results demonstrate that our TDRL-RSUA algorithm can improve resource utilization by more than 30% in comparison to the non-reconfigurable resource slicing strategy and achieves higher slicing revenue and SSR.
期刊介绍:
The IEEE Transactions on Cognitive Communications and Networking (TCCN) aims to publish high-quality manuscripts that push the boundaries of cognitive communications and networking research. Cognitive, in this context, refers to the application of perception, learning, reasoning, memory, and adaptive approaches in communication system design. The transactions welcome submissions that explore various aspects of cognitive communications and networks, focusing on innovative and holistic approaches to complex system design. Key topics covered include architecture, protocols, cross-layer design, and cognition cycle design for cognitive networks. Additionally, research on machine learning, artificial intelligence, end-to-end and distributed intelligence, software-defined networking, cognitive radios, spectrum sharing, and security and privacy issues in cognitive networks are of interest. The publication also encourages papers addressing novel services and applications enabled by these cognitive concepts.