Industrial IoT Data Scheduling Based on Hierarchical Fog Computing: A Key for Enabling Smart Factory
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
Industry 4.0 or industrial Internet of things (IIoT) has become one of the most talked-about industrial business concepts in recent years. Thus, to efficiently integrate Internet of things technology into industry, the collected and sensed data from IIoT need to be scheduled in real-time constraints, especially for big factories. To this end, we propose in this paper a hierarchical fog servers' deployment at the network service layer across different tiers. Using probabilistic analysis models, we prove the efficiency of the proposed hierarchical fog computing compared with the flat architecture. In this paper, IIoT data and requests are divided into both high priority and low priority requests; the high priority requests are urgent/emergency demands that need to be scheduled rapidly. Therefore, we use two-priority queuing model in order to schedule and analyze IIoT data. Finally, we further introduce a workload assignment algorithm to offload peak loads over higher tiers of the fog hierarchy. Using realistic industrial data from Bosch group, the benefits of the proposed architecture compared to the conventional flat design are proved using various performance metrics and through extensive simulations.
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.002 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.000 |
| Research integrity | 0.001 | 0.002 |
| 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