Joint Task Scheduling and Communication-Computation Optimization for Wireless Networked Control With HRLLC

This paper studies a wireless control system at network edge, in which a base station (BS) wirelessly coordinates the closed-loop control of multiple subsystems each consisting of a plant, a sensor, and an actuator. In this system, the BS first collects the state information from the sensors of plants, then processes the information via edge computing, and finally sends the obtained command signals back to the actuators for controlling the plants. In particular, we consider the hyper-reliable and low-latency communications (HRLLC) for the state and command signal transmission, by using the rate formulas based on short-packet communication. Under this setup, we first present a time-division-multiple-access (TDMA) protocol for coordinating the sensing, communication, and computation among the multiple plants. Then, we jointly optimize the task scheduling as well as the communication and computation resource allocations to minimize the closed-loop control latency while ensuring the stability of the multiple control subsystems. The considered problem is a highly non-convex combinatorial optimization problem that is difficult to solve. To resolve this issue, we present efficient algorithms by first optimizing the communication and computation resource allocations under given task scheduling via the techniques of alternating optimization and successive convex approximation, and then designing the task scheduling based on the exhaustive search or the low-complexity flow-shop scheduling. Numerical results show that the proposed joint resource allocation design with exhaustive search based task scheduling significantly outperforms other benchmark schemes without such joint optimization, and the proposed low-complexity task scheduling based on flow-shop scheduling achieves performance close to the upper bound by exhaustive search.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Wireless Communications
Published
2025-08-20
DOI
https://doi.org/10.1109/twc.2025.3598004
Primary Topic
Network Time Synchronization Technologies
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Joint Task Scheduling and Communication-Computation Optimization for Wireless Networked Control With HRLLC

Zhiyong Feng, Jie Xu, Zhiqing Wei, Yiyang Li et al.
IEEE Transactions on Wireless Communications
Network Time Synchronization Technologies
article

Joint Task Scheduling and Communication-Computation Optimization for Wireless Networked Control With HRLLC

Zhiyong Feng, Jie Xu, Zhiqing Wei, Yiyang Li, Xianxin Song
article en

Abstract

This paper studies a wireless control system at network edge, in which a base station (BS) wirelessly coordinates the closed-loop control of multiple subsystems each consisting of a plant, a sensor, and an actuator. In this system, the BS first collects the state information from the sensors of plants, then processes the information via edge computing, and finally sends the obtained command signals back to the actuators for controlling the plants. In particular, we consider the hyper-reliable and low-latency communications (HRLLC) for the state and command signal transmission, by using the rate formulas based on short-packet communication. Under this setup, we first present a time-division-multiple-access (TDMA) protocol for coordinating the sensing, communication, and computation among the multiple plants. Then, we jointly optimize the task scheduling as well as the communication and computation resource allocations to minimize the closed-loop control latency while ensuring the stability of the multiple control subsystems. The considered problem is a highly non-convex combinatorial optimization problem that is difficult to solve. To resolve this issue, we present efficient algorithms by first optimizing the communication and computation resource allocations under given task scheduling via the techniques of alternating optimization and successive convex approximation, and then designing the task scheduling based on the exhaustive search or the low-complexity flow-shop scheduling. Numerical results show that the proposed joint resource allocation design with exhaustive search based task scheduling significantly outperforms other benchmark schemes without such joint optimization, and the proposed low-complexity task scheduling based on flow-shop scheduling achieves performance close to the upper bound by exhaustive search.

IEEE Transactions on Wireless CommunicationsVol. 25
Beijing University of Posts and Telecommunications (CN), Chinese University of Hong Kong, Shenzhen (CN)
Openalex Percentile: Top 76%
Network Time Synchronization Technologies
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.