Skip to main content

Lund University Publications

LUND UNIVERSITY LIBRARIES

Scheduling of Industrial Control Traffic for Dynamic RAN Slicing with Distributed Massive MIMO †

Fitzgerald, Emma LU orcid and Pióro, Michał LU (2024) In Future Internet 16(3).
Abstract

Industry 4.0, with its focus on flexibility and customizability, is pushing in the direction of wireless communication in future smart factories, in particular, massive multiple-input-multiple-output (MIMO) and its future evolution of large intelligent surfaces (LIS), which provide more reliable channel quality than previous technologies. At the same time, network slicing in 5G and beyond systems provides easier management of different categories of users and traffic, and a better basis for providing quality of service, especially for demanding use cases such as industrial control. In previous works, we have presented solutions for scheduling industrial control traffic in LIS and massive MIMO systems. We now consider the case of dynamic... (More)

Industry 4.0, with its focus on flexibility and customizability, is pushing in the direction of wireless communication in future smart factories, in particular, massive multiple-input-multiple-output (MIMO) and its future evolution of large intelligent surfaces (LIS), which provide more reliable channel quality than previous technologies. At the same time, network slicing in 5G and beyond systems provides easier management of different categories of users and traffic, and a better basis for providing quality of service, especially for demanding use cases such as industrial control. In previous works, we have presented solutions for scheduling industrial control traffic in LIS and massive MIMO systems. We now consider the case of dynamic slicing in the radio access network, where we need to not only meet the stringent latency and reliability requirements of industrial control traffic, but also minimize the radio resources occupied by the network slice serving the control traffic, ensuring resources are available for lower-priority traffic slices. In this paper, we provide mixed-integer programming optimization formulations for radio resource usage minimization for dynamic network slicing. We tested our formulations in numerical experiments with varying traffic profiles and numbers of nodes, up to a maximum of 32 nodes. For all problem instances tested, we were able to calculate an optimal schedule within 1 s, making our approach feasible for use in real deployment scenarios.

(Less)
Please use this url to cite or link to this publication:
author
and
organization
publishing date
type
Contribution to journal
publication status
published
subject
keywords
industrial communications, large intelligent surfaces, LIS, massive MIMO, network slicing, scheduling
in
Future Internet
volume
16
issue
3
article number
71
publisher
MDPI AG
external identifiers
  • scopus:85188663468
ISSN
1999-5903
DOI
10.3390/fi16030071
language
English
LU publication?
yes
id
2e802320-dcd9-425d-ad33-cf4448ffa81f
date added to LUP
2024-04-12 11:22:06
date last changed
2024-04-12 11:23:21
@article{2e802320-dcd9-425d-ad33-cf4448ffa81f,
  abstract     = {{<p>Industry 4.0, with its focus on flexibility and customizability, is pushing in the direction of wireless communication in future smart factories, in particular, massive multiple-input-multiple-output (MIMO) and its future evolution of large intelligent surfaces (LIS), which provide more reliable channel quality than previous technologies. At the same time, network slicing in 5G and beyond systems provides easier management of different categories of users and traffic, and a better basis for providing quality of service, especially for demanding use cases such as industrial control. In previous works, we have presented solutions for scheduling industrial control traffic in LIS and massive MIMO systems. We now consider the case of dynamic slicing in the radio access network, where we need to not only meet the stringent latency and reliability requirements of industrial control traffic, but also minimize the radio resources occupied by the network slice serving the control traffic, ensuring resources are available for lower-priority traffic slices. In this paper, we provide mixed-integer programming optimization formulations for radio resource usage minimization for dynamic network slicing. We tested our formulations in numerical experiments with varying traffic profiles and numbers of nodes, up to a maximum of 32 nodes. For all problem instances tested, we were able to calculate an optimal schedule within 1 s, making our approach feasible for use in real deployment scenarios.</p>}},
  author       = {{Fitzgerald, Emma and Pióro, Michał}},
  issn         = {{1999-5903}},
  keywords     = {{industrial communications; large intelligent surfaces; LIS; massive MIMO; network slicing; scheduling}},
  language     = {{eng}},
  number       = {{3}},
  publisher    = {{MDPI AG}},
  series       = {{Future Internet}},
  title        = {{Scheduling of Industrial Control Traffic for Dynamic RAN Slicing with Distributed Massive MIMO †}},
  url          = {{http://dx.doi.org/10.3390/fi16030071}},
  doi          = {{10.3390/fi16030071}},
  volume       = {{16}},
  year         = {{2024}},
}