Jialin Zhang, W. Liang, Bo Yang, Huaguang Shi, Qi Wang, Zhibo Pang
{"title":"A Cooperation-Free Resource Allocation Algorithm Enhanced by Reinforcement Learning for Coexisting IIoTs","authors":"Jialin Zhang, W. Liang, Bo Yang, Huaguang Shi, Qi Wang, Zhibo Pang","doi":"10.1109/WFCS57264.2023.10144246","DOIUrl":null,"url":null,"abstract":"The Industrial Internet of Things (IIoTs) plays an important role in various industrial applications, which require multiple time-critical networks to be deployed in the same region. The limited communication resources inevitably incur network coexistence problems. For scenarios where coexisting networks cannot coordinate effectively, the centralized or partial-information-based decentralized resource allocation methods cannot be implemented. To address this concern, we propose a Cooperation-Free Reinforcement Learning (CF-RL) algorithm for the fully distributed resource allocation problem in coexisting IIoT systems. Each network adopts the proposed algorithm to minimize collisions through a trial-and-error approach without any information interaction. To resist the influence of environmental dynamics, each coexisting network learns the state transition probability of the resource block instead of the resource block's position. Moreover, to potentially ensure the overall system performance, each network additionally considers the period offset in the initialization phase and action selection phase, so that the coexisting networks have different preferences for different state transitions. We conduct extensive simulations to verify the convergence performance. Evaluation results show that the CF-RL algorithm almost achieves (more than 99.88%) the effect of centralized resource allocation and has obvious superiorities over other cooperation-free algorithms in terms of the convergence rate, the number of collisions, and the resource utilization ratio.","PeriodicalId":345607,"journal":{"name":"2023 IEEE 19th International Conference on Factory Communication Systems (WFCS)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 IEEE 19th International Conference on Factory Communication Systems (WFCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WFCS57264.2023.10144246","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The Industrial Internet of Things (IIoTs) plays an important role in various industrial applications, which require multiple time-critical networks to be deployed in the same region. The limited communication resources inevitably incur network coexistence problems. For scenarios where coexisting networks cannot coordinate effectively, the centralized or partial-information-based decentralized resource allocation methods cannot be implemented. To address this concern, we propose a Cooperation-Free Reinforcement Learning (CF-RL) algorithm for the fully distributed resource allocation problem in coexisting IIoT systems. Each network adopts the proposed algorithm to minimize collisions through a trial-and-error approach without any information interaction. To resist the influence of environmental dynamics, each coexisting network learns the state transition probability of the resource block instead of the resource block's position. Moreover, to potentially ensure the overall system performance, each network additionally considers the period offset in the initialization phase and action selection phase, so that the coexisting networks have different preferences for different state transitions. We conduct extensive simulations to verify the convergence performance. Evaluation results show that the CF-RL algorithm almost achieves (more than 99.88%) the effect of centralized resource allocation and has obvious superiorities over other cooperation-free algorithms in terms of the convergence rate, the number of collisions, and the resource utilization ratio.