Ultrareliable Low-Latency Slicing in Space-Air-Ground Multiaccess Edge Computing Networks for Next-Generation Internet of Things and Mobile Applications

被引:5
作者
Asheralieva, Alia [1 ,2 ]
Niyato, Dusit [3 ]
Wei, Xuetao [1 ,4 ]
机构
[1] Southern Univ Sci & Technol, Dept Comp Sci & Engn, Shenzhen 518055, Guangdong, Peoples R China
[2] Loughborough Univ, Dept Comp Sci, Loughborough LE11 3TU, England
[3] Nanyang Technol Univ, Sch Comp Sci & Engn, Jurong West 639798, Singapore
[4] Southern Univ Sci & Technol, Res Inst Trustworthy Autonomous Syst, Shenzhen 518055, Guangdong, Peoples R China
关键词
Heuristic algorithms; Space-air-ground integrated networks; Reliability; Network topology; Dynamic scheduling; Vehicle dynamics; Optimization; Deep learning (DL); dynamic optimization; edge computing; graph neural networks (GNNs); graphs; Internet of Things (IoT); mathematical decomposition; network slicing; next-generation wireless networks; nonconvex optimization; space-air-ground integrated networks (SAGINs); ultrareliable and low-latency communications; RESOURCE-ALLOCATION; 6G NETWORKS; FRAMEWORK; MEC; TECHNOLOGIES; MINIMIZATION; CHALLENGES; VISION; SLICES; GAME;
D O I
10.1109/JIOT.2023.3298789
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We study the problem of ultrareliable and low-latency slicing in multiaccess edge computing (MEC) systems for the next-generation Internet of Things (IoT) and mobile applications operating in the space-air-ground integrated network. The network has a dynamic topology formed by multiple nonstationary nodes with unstable communication links and unreliable processing/transmission resources. Each node can be in one of two hidden states: 1) reliable-in which the node generates no data errors and no losses and 2) unreliable-when the node can generate/propagate random data errors/losses. Solving this problem is difficult, as it represents the nondeterministic polynomial-time (NP) hard nonconcave nonsmooth stochastic maximization problem which depends on the unknown hidden nodes' states and private information about local, dynamic parameters of each node, which is known only to this node, and not to other nodes. To address these challenges, we develop a new deep learning (DL) model based on the message passing graph neural network (MPNN) to estimate hidden nodes' states. We then propose a novel algorithm based on the online alternating direction method of multipliers (ADMMs)-an extension of the well-known classical "static" ADMM to dynamic settings, where our slicing problem can be solved distributedly, in real time, without revealing local (private) information of the nodes. We show that our algorithm converges to a global optimum of the slicing problem and has a good consistent performance even in highly dynamic, unreliable scenarios.
引用
收藏
页码:3956 / 3978
页数:23
相关论文
共 104 条
  • [1] Elastic O-RAN Slicing for Industrial Monitoring and Control: A Distributed Matching Game and Deep Reinforcement Learning Approach
    Abedin, Sarder Fakhrul
    Mahmood, Aamir
    Tran, Nguyen H.
    Han, Zhu
    Gidlund, Mikael
    [J]. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2022, 71 (10) : 10808 - 10822
  • [2] A Deep Reinforcement Learning Approach for Service Migration in MEC-enabled Vehicular Networks
    Abouaomar, Amine
    Mlika, Zoubeir
    Filali, Abderrahime
    Cherkaoui, Soumaya
    Kobbane, Abdellatif
    [J]. PROCEEDINGS OF THE IEEE 46TH CONFERENCE ON LOCAL COMPUTER NETWORKS (LCN 2021), 2021, : 273 - 280
  • [3] [Anonymous], 2016, LEO parameters
  • [4] [Anonymous], 2016, 36300 3GPP TS
  • [5] [Anonymous], 2021, G.651.1: Characteristics of a 50/125 mum multimode graded index optical fiber cable for the optical access network
  • [6] [Anonymous], 2017, Unmanned Aircraft Systems Trial Report
  • [7] [Anonymous], 2018, Study on management and orchestration of network slicing for next generation network release-15 v. 15.1.0
  • [8] [Anonymous], 2022, OPNET network simulator
  • [9] [Anonymous], 2019, Description
  • [10] Summary of Rel-17 work items release 17.