Papers for

iot device managers

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Packet loss models can miss risks of prolonged update failures

Survival-Time Risk Beyond Low-Order Channel Models: Identifiability and Scheduling

Abstract: This paper investigates whether low-order packet-loss statistics suffice to assess survival-time risk under bursty packet losses, i.e., the probability that no update succeeds for a prescribed number of consecutive slots. Conventional models, such as the Gilbert model, characterize packet losses using the loss rate and mean burst length, but channels sharing these statistics may exhibit substantially different failure risks. We characterize the Markov channels one order above a given low-order fit that share its statistics and analyze their risks under acknowledgment-based scheduling with transmission budgets. We show that, with dense transmission attempts, risk is primarily governed by loss persistence beyond the modeled memory, and the worst-case channel need not be the most persistent one. Under limited budgets, retry spacing makes loss relapse probabilities important and can reverse the risk ordering of compatible channels. Numerical and measurement results show that low-order models can substantially underestimate the risk, highlighting the need for scheduling-dependent channel statistics.

Mon 2 NovNetworking and Internet ArchitectureInformation Theory
The gist
People use simple models to predict how often data packets get lost in a network, especially in bursts. This paper shows that such simple models can miss bigger risks where many updates in a row fail. The authors look at more complex channel behaviors that still match the simple models but have very different chances of long failure periods. They find that how and when retries happen can change which channel is riskier, so network scheduling needs deeper measurements to predict risks accurately.
Open → 2611.03871v1

Edge network security improved by governor checks on automated actions

Autonomy in Check: Governor-Mediated Adaptive Security at the Edge

Abstract: Adaptive security at the network edge increasingly relies on automated planners, including rule-based controllers, learned policies, and LLM-assisted agents, that translate observations into enforcement actions. Once such a planner can influence live policy state, syntactic validity is not enough. A semantically wrong action, produced from incomplete or manipulated observations, can be faithfully executed by an enforcement substrate that cannot judge mission context. We address this problem by treating the boundary between planner output and kernel enforcement input as the primary security object. We propose a split-control architecture in which an untrusted planner emits typed security intents, a deterministic governor checks each intent against safety, resource, temporal-stability, and proportionality invariants, and only admitted actions are bound to signed receipts and compiled into pre-installed eBPF map updates. The paper formalizes this trust-boundary problem, defines three threat classes, develops the governor admission predicate, and reports an end-to-end prototype. Across rule-based and LLM-assisted planners on a Raspberry Pi 5 testbed connected to the university 5G Test Network, the governor admits, rejects, and bounds intents at microsecond cost without disrupting protected-flow regularity. The contribution is conceptual as much as empirical: adaptive security does not need to trust the author of an action. It needs a mediation boundary that decides whether the action is admissible.

Wed 16 SeptCryptography and SecurityArtificial Intelligence
The gist
Security systems at the edge of networks use automatic planners to decide actions, but these planners can make mistakes or be tricked by bad information. The paper shows that just checking if an action looks correct on the surface is not enough. Instead, the authors propose a middleman called a governor that carefully checks each action before it is carried out to make sure it follows safety and fairness rules. They tested this approach on small devices connected to a 5G network and found it works very quickly without messing up normal network flows.
Open → 2609.18338v1