Yijian Hou;Kaisa Zhang;Gang Chuai;Weidong Gao;Xiangyu Chen;Siqi Liu
{"title":"动态多业务车辆切片网络中的业务关联与子载波分配","authors":"Yijian Hou;Kaisa Zhang;Gang Chuai;Weidong Gao;Xiangyu Chen;Siqi Liu","doi":"10.1109/LCOMM.2025.3555768","DOIUrl":null,"url":null,"abstract":"The vehicular slicing network with dynamic multi-service (VSN-DMS) enables vehicles to support multiple services with dynamically changing types. In this architecture, vehicles can access multiple base stations (BSs) and leverage different network slices (NSs) to meet the requirements of various services. However, frequent service variations and vehicle mobility introduce high handover (HO) costs and inefficient decision making. This letter proposes a novel two-timescale optimization framework to jointly optimize vehicle service (VS) association and subcarrier (SC) allocation. Specifically, in the long-timescale, we propose a federated deep reinforcement learning (FDRL) algorithm to optimize VS association. Unlike conventional reinforcement learning approaches that require centralized data collection, FDRL enables distributed model training across vehicles while aggregating parameters in the cloud. This mitigates the issue of insufficient training data caused by frequent VS changes, while also ensuring vehicle data privacy. In the short-timescale, we propose a versatile alternating coalitional game and swap-matching game algorithm (ACGSM) to optimize SC allocation. By iteratively executing coalitional formation and swap-matching mechanisms, ACGSM efficiently improves the quality of the solution while adapting to dynamic network conditions. Simulation results demonstrate the convergence of FDRL and show that the proposal outperforms benchmarks in improving long-term QoS and reducing the number of HOs.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 5","pages":"1131-1135"},"PeriodicalIF":3.7000,"publicationDate":"2025-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Service Association and Subcarrier Allocation in Vehicular Slicing Networks With Dynamic Multi-Service\",\"authors\":\"Yijian Hou;Kaisa Zhang;Gang Chuai;Weidong Gao;Xiangyu Chen;Siqi Liu\",\"doi\":\"10.1109/LCOMM.2025.3555768\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The vehicular slicing network with dynamic multi-service (VSN-DMS) enables vehicles to support multiple services with dynamically changing types. In this architecture, vehicles can access multiple base stations (BSs) and leverage different network slices (NSs) to meet the requirements of various services. However, frequent service variations and vehicle mobility introduce high handover (HO) costs and inefficient decision making. This letter proposes a novel two-timescale optimization framework to jointly optimize vehicle service (VS) association and subcarrier (SC) allocation. Specifically, in the long-timescale, we propose a federated deep reinforcement learning (FDRL) algorithm to optimize VS association. Unlike conventional reinforcement learning approaches that require centralized data collection, FDRL enables distributed model training across vehicles while aggregating parameters in the cloud. This mitigates the issue of insufficient training data caused by frequent VS changes, while also ensuring vehicle data privacy. In the short-timescale, we propose a versatile alternating coalitional game and swap-matching game algorithm (ACGSM) to optimize SC allocation. By iteratively executing coalitional formation and swap-matching mechanisms, ACGSM efficiently improves the quality of the solution while adapting to dynamic network conditions. Simulation results demonstrate the convergence of FDRL and show that the proposal outperforms benchmarks in improving long-term QoS and reducing the number of HOs.\",\"PeriodicalId\":13197,\"journal\":{\"name\":\"IEEE Communications Letters\",\"volume\":\"29 5\",\"pages\":\"1131-1135\"},\"PeriodicalIF\":3.7000,\"publicationDate\":\"2025-03-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Communications Letters\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10945444/\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"TELECOMMUNICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Communications Letters","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10945444/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"TELECOMMUNICATIONS","Score":null,"Total":0}
Service Association and Subcarrier Allocation in Vehicular Slicing Networks With Dynamic Multi-Service
The vehicular slicing network with dynamic multi-service (VSN-DMS) enables vehicles to support multiple services with dynamically changing types. In this architecture, vehicles can access multiple base stations (BSs) and leverage different network slices (NSs) to meet the requirements of various services. However, frequent service variations and vehicle mobility introduce high handover (HO) costs and inefficient decision making. This letter proposes a novel two-timescale optimization framework to jointly optimize vehicle service (VS) association and subcarrier (SC) allocation. Specifically, in the long-timescale, we propose a federated deep reinforcement learning (FDRL) algorithm to optimize VS association. Unlike conventional reinforcement learning approaches that require centralized data collection, FDRL enables distributed model training across vehicles while aggregating parameters in the cloud. This mitigates the issue of insufficient training data caused by frequent VS changes, while also ensuring vehicle data privacy. In the short-timescale, we propose a versatile alternating coalitional game and swap-matching game algorithm (ACGSM) to optimize SC allocation. By iteratively executing coalitional formation and swap-matching mechanisms, ACGSM efficiently improves the quality of the solution while adapting to dynamic network conditions. Simulation results demonstrate the convergence of FDRL and show that the proposal outperforms benchmarks in improving long-term QoS and reducing the number of HOs.
期刊介绍:
The IEEE Communications Letters publishes short papers in a rapid publication cycle on advances in the state-of-the-art of communication over different media and channels including wire, underground, waveguide, optical fiber, and storage channels. Both theoretical contributions (including new techniques, concepts, and analyses) and practical contributions (including system experiments and prototypes, and new applications) are encouraged. This journal focuses on the physical layer and the link layer of communication systems.