Search arXivSearch

arXiv · 2609.06585

Assessing Fixed-Batch Reporting for Deadline-constrained Inference in Intermittently Powered IoT

Abstract

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.

Explore related subjects

Keep this discovery

BibTeXRIS

Onel L. A. López. 2026-09-06. Assessing Fixed-Batch Reporting for Deadline-constrained Inference in Intermittently Powered IoT. https://arxiv.org/abs/2609.06585

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

Unifying Power Flow and Electromagnetic Transient Modeling

Grid tools are separated by timescales: steady-state analysis is performed by power flow (PF), whereas the fastest dynamics are captured by electromagnetic transient (EMT) simulation. Although operating at varying timescales, different tools should produce consistent results when analyzing the same grid conditions. However, the PF steady-state solution does not match the time-to-infinity EMT response. This mismatch exists because simplified device models in PF are inconsistent with the "ground truth" EMT models derived from first principles. As inverter-based resources (IBRs) and data centers strip away inertia and operating reserves, approximations used in PF risk grid security by missing violations. To address this, we introduce a steady-state framework that uses full-physics EMT models for high-fidelity steady-state grid analysis. The challenge lies in systematically formulating algebraic frequency-domain representations of dynamic power devices that are naturally described in state-space form. Our tool, SALT (Steady-state After Last Transients), constructs steady-state representations that exactly capture grid device physics when embedded into transmission networks. The approach exploits the structural properties of power device models and the single-harmonic, balanced nature of the transmission system. Results demonstrate SALT achieves EMT steady-state accuracy while delivering a 1x10^6 times speedup. We demonstrate that SALT can capture security threats in contingency scenarios without exception --- whereas PF-based analyses reported 75% fewer rated line violations, 18% fewer Q-limit violations, and 7% fewer voltage violations.

eess.SY

A simple derivation of the Kalman filter

In this lecture note, we present a concise and self-contained derivation of the discrete-time Kalman filter equations that requires only a basic understanding of least squares estimation. The treatment is designed to minimize mathematical overhead while preserving both rigor and generality.

math.OC