动态多业务车辆切片网络中的业务关联与子载波分配

IF 3.7 3区 计算机科学 Q2 TELECOMMUNICATIONS
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}
引用次数: 0

摘要

基于动态多业务的车辆切片网络(VSN-DMS)使车辆能够支持多种类型动态变化的业务。在这种架构中,车辆可以访问多个基站(BSs),并利用不同的网络切片(NSs)来满足各种业务需求。然而,频繁的服务变化和车辆移动性带来了高切换成本和低效决策。本文提出了一种新的双时间尺度优化框架,用于联合优化车辆服务(VS)关联和子载波(SC)分配。具体而言,在长时间尺度下,我们提出了一种联邦深度强化学习(FDRL)算法来优化VS关联。与需要集中收集数据的传统强化学习方法不同,FDRL支持跨车辆的分布式模型训练,同时在云中聚合参数。这缓解了由于频繁的VS变化而导致的训练数据不足的问题,同时也保证了车辆数据的隐私。在短时尺度下,我们提出了一种通用的交替联合博弈和交换匹配博弈算法(ACGSM)来优化SC的分配。通过迭代执行联盟形成和交换匹配机制,ACGSM在适应动态网络条件的同时,有效地提高了解决方案的质量。仿真结果证明了FDRL的收敛性,并表明该方案在提高长期QoS和减少HOs数量方面优于基准测试。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Communications Letters
IEEE Communications Letters 工程技术-电信学
CiteScore
8.10
自引率
7.30%
发文量
590
审稿时长
2.8 months
期刊介绍: 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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信