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 , Jian Huang , Hengji Li , Tianyong Ao , Wei Li , 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.4000,"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.
期刊介绍:
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.