Towards wireless time-sensitive networking: Multi-link deterministic scheduling via deep reinforcement learning

IF 4.4 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Xiaolin Wang , Jinglong Zhang , Xuanzhao Lu , Fangfei Li , Cailian Chen , Xinping Guan
{"title":"Towards wireless time-sensitive networking: Multi-link deterministic scheduling via deep reinforcement learning","authors":"Xiaolin Wang ,&nbsp;Jinglong Zhang ,&nbsp;Xuanzhao Lu ,&nbsp;Fangfei Li ,&nbsp;Cailian Chen ,&nbsp;Xinping Guan","doi":"10.1016/j.comnet.2025.111119","DOIUrl":null,"url":null,"abstract":"<div><div>Wireless time-sensitive networking (WTSN) has gained significant popularity because of its potential flexibility, scalability and bounded latency. Nevertheless, fewer studies have investigated specific scheduling strategies under unreliable wireless media. Besides, the lack of interoperability with current industrial networks and the ability to handle complex wireless network scheduling pose great challenges in WTSN design. To handle these challenges, we first propose a WiFi-based WTSN architecture. The wireless time-aware shaper (WTAS) and deep reinforcement learning based flow scheduling strategy are studied as the core mechanism of the proposed architecture. Specifically, the functionality of WTSN is designed through wireless gate control, control-aware retransmission, deterministic time slot design and delay analysis, and dynamic queue priority mapping. Then, we formulate a multi-link time slot scheduling problem to achieve load balance while considering transmission and control constraints. The soft actor-critic-based flow scheduling optimization (SAC-FSO) algorithm with elaborately designed decision variables mapping and dynamic constraint detection is proposed to efficiently achieve the wireless deterministic transmission. The performance evaluation demonstrates the effectiveness of the proposed WTSN architecture and WTAS modules. Comparison results with other algorithms demonstrate that the SAC-FSO algorithm is more efficient and scalable.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"261 ","pages":"Article 111119"},"PeriodicalIF":4.4000,"publicationDate":"2025-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1389128625000878","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

Abstract

Wireless time-sensitive networking (WTSN) has gained significant popularity because of its potential flexibility, scalability and bounded latency. Nevertheless, fewer studies have investigated specific scheduling strategies under unreliable wireless media. Besides, the lack of interoperability with current industrial networks and the ability to handle complex wireless network scheduling pose great challenges in WTSN design. To handle these challenges, we first propose a WiFi-based WTSN architecture. The wireless time-aware shaper (WTAS) and deep reinforcement learning based flow scheduling strategy are studied as the core mechanism of the proposed architecture. Specifically, the functionality of WTSN is designed through wireless gate control, control-aware retransmission, deterministic time slot design and delay analysis, and dynamic queue priority mapping. Then, we formulate a multi-link time slot scheduling problem to achieve load balance while considering transmission and control constraints. The soft actor-critic-based flow scheduling optimization (SAC-FSO) algorithm with elaborately designed decision variables mapping and dynamic constraint detection is proposed to efficiently achieve the wireless deterministic transmission. The performance evaluation demonstrates the effectiveness of the proposed WTSN architecture and WTAS modules. Comparison results with other algorithms demonstrate that the SAC-FSO algorithm is more efficient and scalable.

Abstract Image

求助全文
约1分钟内获得全文 求助全文
来源期刊
Computer Networks
Computer Networks 工程技术-电信学
CiteScore
10.80
自引率
3.60%
发文量
434
审稿时长
8.6 months
期刊介绍: Computer Networks is an international, archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in the computer communications networking area. The audience includes researchers, managers and operators of networks as well as designers and implementors. The Editorial Board will consider any material for publication that is of interest to those groups.
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信