Control-Aware Energy-Efficient Transmissions for Wireless Control Systems With Short Packets
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
In this article, we investigate control-aware energy-efficient transmission strategies for wireless control systems with short packets (WCSs), in which remote state estimation error, system stability, transmission energy consumption, and communication packets with finite-length coding are all taken into account. Specifically, we formulate the transmission strategy design problem as a multiobjective optimization problem, which minimizes the remote state estimation error and transmission energy consumption simultaneously under the constraints of system stability and short packet communications. To solve the multiobjective optimization problem, we first introduce a novel objective function that encapsulates two different objective functions into a single one by using weight parameters, and further prove that the solution of the new stochastic optimization problem is a nondominated solution of the original one. Moreover, to solve the new stochastic optimization, we propose a dynamic control-aware energy-efficient transmission (DCET) algorithm that pushes the objective cost close to the optimal with a tradeoff in virtual queue backlogs for constraints. In particular, to tackle the nonconvexity constraint due to short packet communications, we introduce an additional constraint, with which the optimization problem is convex. Finally, simulation results verified the superiority of our proposed transmission strategy as compared with schemes of TDMA and Aloha-RAM multi access.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it