Multi-channel real-time access with starvation avoidance for heterogeneous data in smart factories

IF 4.6 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Computer Networks Pub Date : 2025-03-25 DOI:10.1016/j.comnet.2025.111236
Huaguang Shi , Jian Huang , Hengji Li , Tianyong Ao , Wei Li , Yi Zhou
{"title":"Multi-channel real-time access with starvation avoidance for heterogeneous data in smart factories","authors":"Huaguang Shi ,&nbsp;Jian Huang ,&nbsp;Hengji Li ,&nbsp;Tianyong Ao ,&nbsp;Wei Li ,&nbsp;Yi Zhou","doi":"10.1016/j.comnet.2025.111236","DOIUrl":null,"url":null,"abstract":"<div><div>In Industrial Wireless Control Networks (IWCNs), Industrial Devices (IDs) generate massive amounts of Data Packets (DPs) with different Quality of Service (QoS) requirements. However, most of the existing works set different priorities for differentiated transmission of heterogeneous data, and the high-priority DPs will access the channel immediately after they are generated. This may result in the access starvation of low-priority DPs in time-frequency resource-constrained IWCNs. In this paper, we study the collaborative transmission algorithm of heterogeneous data to avoid access starvation for lower-priority DPs while guaranteeing QoS for higher-priority DPs. Specifically, we first design an edge-assisted learning architecture with multi-access edge computing to assist the training of the algorithm. Then, to mitigate access conflicts among IDs, a gated recurrent unit enhanced Multi-Agent Deep Reinforcement Learning (MADRL) framework was adopted. Based on the framework, we propose a Multi-criteria Decision based dynamic Multi-channel Access (MDMA) algorithm, where high-priority DPs can consider waiting for access according to their own criteria to avoid preempting the channel access opportunity of low-priority DPs approaching the deadline. Extensive simulations show that the proposed MDMA algorithm outperforms the existing algorithms in terms of the average channel utilization rate and the average completion rate of heterogeneous data.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"264 ","pages":"Article 111236"},"PeriodicalIF":4.6000,"publicationDate":"2025-03-25","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/S138912862500204X","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

In Industrial Wireless Control Networks (IWCNs), Industrial Devices (IDs) generate massive amounts of Data Packets (DPs) with different Quality of Service (QoS) requirements. However, most of the existing works set different priorities for differentiated transmission of heterogeneous data, and the high-priority DPs will access the channel immediately after they are generated. This may result in the access starvation of low-priority DPs in time-frequency resource-constrained IWCNs. In this paper, we study the collaborative transmission algorithm of heterogeneous data to avoid access starvation for lower-priority DPs while guaranteeing QoS for higher-priority DPs. Specifically, we first design an edge-assisted learning architecture with multi-access edge computing to assist the training of the algorithm. Then, to mitigate access conflicts among IDs, a gated recurrent unit enhanced Multi-Agent Deep Reinforcement Learning (MADRL) framework was adopted. Based on the framework, we propose a Multi-criteria Decision based dynamic Multi-channel Access (MDMA) algorithm, where high-priority DPs can consider waiting for access according to their own criteria to avoid preempting the channel access opportunity of low-priority DPs approaching the deadline. Extensive simulations show that the proposed MDMA algorithm outperforms the existing algorithms in terms of the average channel utilization rate and the average completion rate of heterogeneous data.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
智能工厂中异构数据的多通道实时访问与饥饿避免
在工业无线控制网络(IWCN)中,工业设备(ID)会产生大量数据包(DP),这些数据包具有不同的服务质量(QoS)要求。然而,大多数现有研究都为异构数据的差异化传输设置了不同的优先级,高优先级的数据包在生成后会立即访问信道。这可能会导致低优先级 DP 在时频资源受限的 IWCN 中陷入访问饥渴。本文研究了异构数据的协同传输算法,以避免低优先级 DP 的访问饥渴,同时保证高优先级 DP 的 QoS。具体来说,我们首先设计了一种边缘辅助学习架构,利用多访问边缘计算来辅助算法的训练。然后,为了缓解 ID 之间的访问冲突,我们采用了门控递归单元增强型多代理深度强化学习(MADRL)框架。在此框架的基础上,我们提出了一种基于多标准决策的动态多信道接入(MDMA)算法,其中高优先级 DP 可以根据自己的标准考虑等待接入,以避免抢占接近截止日期的低优先级 DP 的信道接入机会。大量仿真表明,所提出的 MDMA 算法在异构数据的平均信道利用率和平均完成率方面优于现有算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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.
期刊最新文献
Editorial Board Efficient evaluation of nonblocking property of optical circuit-Switched clos networks with non-Uniform link distribution Multi-scale attention fusion for enhanced transformer models in intrusion detection systems Federated learning-blockchain synergy for multi-objective replication optimization in dynamic cloud-edge networks FederNet: A network and device-aware emulation platform for federated learning benchmarking
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1