Online-Learning-Based Predictive Optimization of Uplink Scheduling for Industrial Internet-of-Things

IF 6.3 Q1 ENGINEERING, ELECTRICAL & ELECTRONIC
Chenshan Ren;Xinchen Lyu
{"title":"Online-Learning-Based Predictive Optimization of Uplink Scheduling for Industrial Internet-of-Things","authors":"Chenshan Ren;Xinchen Lyu","doi":"10.1109/OJCOMS.2024.3481431","DOIUrl":null,"url":null,"abstract":"The industrial Internet of Things (IIoT) operates in dynamic environments where wireless channels are subject to rapid changes, posing significant challenges for reliable data transmission. This paper introduces a novel online learning approach to predictively optimize uplink scheduling for IIoT devices. In harsh industrial settings, the unpredictability of channel conditions and data arrivals necessitates immediate data transmission to ensure timeliness and representativeness. We propose a primal-dual online learning framework that integrates stochastic gradient descent (SGD) and online convex optimization (OCO) to generate predictive uplink schedules. By learning only from past channel changes and data arrivals, our predictive schedule can asymptotically minimize the amount of data dropped at the IIoT devices. We also accelerate the online learning by having the IIoT devices oversample their channels to reduce the penalty of the predictive schedule. The optimality loss is proved to asymptotically diminish with the decrease of SGD/OCO stepsizes and the increase of oversampling rate even in fast-changing IIoT environments. Simulation results validate the effectiveness of our approach, showing significant improvements in system throughput compared to state-of-the-art methods, especially in environments with rapidly changing wireless channels.","PeriodicalId":33803,"journal":{"name":"IEEE Open Journal of the Communications Society","volume":"5 ","pages":"6817-6831"},"PeriodicalIF":6.3000,"publicationDate":"2024-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10720074","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Open Journal of the Communications Society","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10720074/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

Abstract

The industrial Internet of Things (IIoT) operates in dynamic environments where wireless channels are subject to rapid changes, posing significant challenges for reliable data transmission. This paper introduces a novel online learning approach to predictively optimize uplink scheduling for IIoT devices. In harsh industrial settings, the unpredictability of channel conditions and data arrivals necessitates immediate data transmission to ensure timeliness and representativeness. We propose a primal-dual online learning framework that integrates stochastic gradient descent (SGD) and online convex optimization (OCO) to generate predictive uplink schedules. By learning only from past channel changes and data arrivals, our predictive schedule can asymptotically minimize the amount of data dropped at the IIoT devices. We also accelerate the online learning by having the IIoT devices oversample their channels to reduce the penalty of the predictive schedule. The optimality loss is proved to asymptotically diminish with the decrease of SGD/OCO stepsizes and the increase of oversampling rate even in fast-changing IIoT environments. Simulation results validate the effectiveness of our approach, showing significant improvements in system throughput compared to state-of-the-art methods, especially in environments with rapidly changing wireless channels.
基于在线学习的工业物联网上行链路调度预测优化
工业物联网(IIoT)在动态环境中运行,无线信道变化迅速,给可靠的数据传输带来了巨大挑战。本文介绍了一种新颖的在线学习方法,用于预测性地优化 IIoT 设备的上行链路调度。在恶劣的工业环境中,由于信道条件和数据到达的不可预测性,必须立即进行数据传输,以确保及时性和代表性。我们提出了一种整合了随机梯度下降(SGD)和在线凸优化(OCO)的原始双在线学习框架,以生成预测性上行链路调度。通过仅从过去的信道变化和数据到达情况中学习,我们的预测性时间表可以渐进地将 IIoT 设备的数据丢失量降到最低。我们还通过让 IIoT 设备对其信道进行超采样来加速在线学习,从而减少预测性计划的惩罚。事实证明,即使在快速变化的物联网环境中,随着 SGD/OCO 步长的减小和超采样率的提高,优化损失也会逐渐减小。仿真结果验证了我们方法的有效性,与最先进的方法相比,系统吞吐量有了显著提高,尤其是在无线信道快速变化的环境中。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
13.70
自引率
3.80%
发文量
94
审稿时长
10 weeks
期刊介绍: The IEEE Open Journal of the Communications Society (OJ-COMS) is an open access, all-electronic journal that publishes original high-quality manuscripts on advances in the state of the art of telecommunications systems and networks. The papers in IEEE OJ-COMS are included in Scopus. Submissions reporting new theoretical findings (including novel methods, concepts, and studies) and practical contributions (including experiments and development of prototypes) are welcome. Additionally, survey and tutorial articles are considered. The IEEE OJCOMS received its debut impact factor of 7.9 according to the Journal Citation Reports (JCR) 2023. The IEEE Open Journal of the Communications Society covers science, technology, applications and standards for information organization, collection and transfer using electronic, optical and wireless channels and networks. Some specific areas covered include: Systems and network architecture, control and management Protocols, software, and middleware Quality of service, reliability, and security Modulation, detection, coding, and signaling Switching and routing Mobile and portable communications Terminals and other end-user devices Networks for content distribution and distributed computing Communications-based distributed resources control.
×
引用
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学术官方微信