ML-RASPF: A Machine Learning-Based Rate-Adaptive Framework for Dynamic Resource Allocation in Smart Healthcare IoT
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
The growing adoption of the Internet of Things (IoT) in healthcare has led to a surge in real-time data from wearable devices, medical sensors, and patient monitoring systems. This latency-sensitive environment poses significant challenges to traditional cloud-centric infrastructures, which often struggle with unpredictable service demands, network congestion, and end-to-end delay constraints. Consistently meeting the stringent QoS requirements of smart healthcare, particularly for life-critical applications, requires new adaptive architectures. We propose ML-RASPF, a machine learning-based framework for efficient service delivery in smart healthcare systems. Unlike existing methods, ML-RASPF jointly optimizes latency and service delivery rate through predictive analytics and adaptive control across a modular mist–edge–cloud architecture. The framework formulates task provisioning as a joint optimization problem that aims to minimize service latency and maximize delivery throughput. We evaluate ML-RASPF using a realistic smart hospital scenario involving IoT-enabled kiosks and wearable devices that generate both latency-sensitive and latency-tolerant service requests. Experimental results demonstrate that ML-RASPF achieves up to 20% lower latency, 18% higher service delivery rate, and 19% reduced energy consumption compared to leading baselines.
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.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 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