Metraipolis › archive › dc_52d3de12290b
Assessing Fixed-Batch Reporting for Deadline-constrained Inference in Intermittently Powered IoT — arXiv:2609.06585
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.06585
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T13:23:37.362Z
- SHA-256 of the archived text
1d15f9960d2fad919da34411e634a75401687b0f126c7d9e5a76c73c1d9ea3b4- Stable URL of this page
https://metraipolis.com/documento/dc_52d3de12290b
How to cite
Assessing Fixed-Batch Reporting for Deadline-constrained Inference in Intermittently Powered IoT — arXiv:2609.06585 — arXiv (en), https://arxiv.org/abs/2609.06585 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_52d3de12290b (Metraipolis archive dc_52d3de12290b, sha256 1d15f9960d2fad919da34411e634a75401687b0f126c7d9e5a76c73c1d9ea3b4)
BibTeX
@misc{dc52d3de12290b,
title = {Assessing Fixed-Batch Reporting for Deadline-constrained Inference in Intermittently Powered IoT — arXiv:2609.06585},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.06585},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_52d3de12290b; sha256 1d15f9960d2fad919da34411e634a75401687b0f126c7d9e5a76c73c1d9ea3b4},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.06585. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Energy-harvesting Internet of Things (IoT) devices must decide whether to transmit each observation immediately or accumulate several observations before reporting to the edge. Early reports make information from initial observations available sooner at the edge but require more transmission actions, whereas larger batches save reports while delaying that information and retaining more state. We develop a unified analytical framework to compare this fixed-batching choice in scenarios with repeated, deadline-constrained inference cycles. Every configuration processes the same ordered observations and yields the same final posterior if all reports arrive, enabling a controlled comparison of the persistent state, actions, and energy costs induced by batching. Using reductions in Bayesian risk under the continuous ranked probability score (CRPS), we express long-run timely value exactly as a statistical-value-weighted sum of expected decision-weighted report availabilities. This separates the inferential value of observations from their availability at application-relevant decision times. We construct exact Markov-reward models accounting jointly for intermittent harvesting, finite storage, energy carry-over, unreliable delivery, retransmissions, and deadlines. We prove that the long-run regime is well defined and derive exact batch-size comparisons, timing benchmarks, and a decomposition of harvesting-law effects into within-cycle and carry-over contributions. Directly evaluable Gaussian and Gaussian-mixture belief specializations show that the preferred batch size can change with the prior, the decision-time profile, link reliability, harvested-energy statistics, and accumulation cost. Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-09 in cs.PF). Categorie arXiv: Systems and Control (eess.SY) ; Performance (cs.PF). Pagina del lavoro: https://arxiv.org/abs/2609.06585 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-16T13:02:50.663Z dalla pagina https://arxiv.org/catchup/cs.PF/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).