Channel-Aware Latency Tail Taming in Industrial IoT
Bibliographic record
Abstract
In this paper, we propose a novel channel-aware latency taming scheme, called Optimal Transmission Latency Taming (OTLT), to detect hidden channel state and tame the distribution tail of the packet sojourn time in Industrial Internet of Things (IIoT) devices. Specifically, we design a forward algorithm based on a hidden semi-Markov model to detect the hidden channel state, with a particular emphasis on the state sojourn duration, and to calculate the corresponding channel access probability. Then we develop a time-sensitive model to investigate the minimum sojourn time a packet spends in the IIoT device before leaving successfully. With the obtained channel access probability, the first passage probability of the proposed model is explored to find the maximum probability of a packet being successfully transmitted in a given back-off sojourn duration (BSD). The distribution tail of the packet sojourn time can be tamed by minimizing the cumulative summation of each BSD in consideration of the quadratic penalty latency constraints. Simulation results demonstrate that, in the industrial environment, the OTLT scheme can keep the packet’s sojourn duration within a quantifiable limit and variance. It can also obtain considerably efficient control over packet transmission latency in a time-varying wireless propagation channel even with the increasing number of IIoT devices.
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.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| 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 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".