Optimal Dynamic Transmission Scheduling for Wireless Networked Control Systems
Bibliographic record
Abstract
Wireless networked control systems (WNCSs) have the potential to revolutionize industrial automation in smart factories. Optimizing closed-loop performance while maintaining stability is a fundamental challenge in WNCS due to limited bandwidth and nondeterministic link quality of wireless networks. In order to bridge the gap between network design and control system performance, we propose an optimal dynamic transmission scheduling strategy that optimizes the performance of multiloop control systems by allocating network resources based on predictions of both link quality and control performance at run time. We formulate the optimal dynamic scheduling problem as a nonlinear integer programming problem, which is relaxed to a linear programming problem. We further extend the optimization problem to balance control performance and communication cost. The proposed optimal dynamic scheduling strategy renders the closed-loop system mean-square stable under mild assumptions. Its efficacy is demonstrated by simulating a four-loop control system over an IEEE 802.15.4 wireless network simulator—TOSSIM. The run-time network reconfiguration protocol tailored for optimal scheduling is designed and implemented on a real wireless network consisting of IEEE 802.15.4 devices. Hybrid simulations integrating a real wireless network and simulated physical plant control are performed. Simulation and experimental results show that the optimal dynamic scheduling can enhance control system performance and adapt to both constant and variable wireless interference and physical disturbance to the plant.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".