SearcharxivSearch

arXiv · 2608.00409

Design and Implementation of Schwarz Information Criterion-Aided Intelligent Decentralized Resource Allocation in Dynamic LoRa Networks

Abstract

This paper proposes a lightweight distributed learning method for selecting transmission parameters in Long-Range (LoRa) networks that adapts to dynamically changing communication environments. In the proposed method, the Thompson Sampling (TS) is adopted for transmission parameter selection, whereas the Schwarz Information Criterion (SIC) is employed for environmental change detection. TS is a reinforcement learning approach that effectively balances exploration and exploitation by updating parameters based on probability distributions. Additionally, it demonstrates stable performance even with a small number of trials, thereby making it well-suited for LoRa end devices (EDs) with limited memory capacity and computational resources. Furthermore, to address the issue that TS-based methods strongly depend on past learning histories and therefore adapt slowly to abrupt changes in communication environments, a statistical change detection mechanism based on the SIC is integrated into our proposed method. SIC is adopted because it can detect environmental changes with low computational cost and is suitable for implementation on resource-constrained LoRa EDs. When a change in the communication environment is detected by SIC, the learning history of TS is reset, thereby enabling rapid re-learning under new environmental conditions. Moreover, to achieve fully distributed communication parameter selection while enhancing transmission reliability and energy efficiency, the proposed method relies solely on Acknowledgment (ACK) feedback and the selected transmission parameters. Experimental results demonstrate that the proposed method improves the transmission success rate from 64.0% to 71.1% and increases energy efficiency from 293.9 bit/J to 328.3 bit/J compared with the conventional Upper Confidence Bound (UCB)1-tuned scheme under high-density dynamic LoRa networks.

Explore related subjects

Keep this discovery

BibTeXRIS

Aohan Li, Ryota Ariyoshi, Mikio Hasegawa, Miao Pan, Tomoaki Ohtsuki, Zhu Han. 2026-08-01. Design and Implementation of Schwarz Information Criterion-Aided Intelligent Decentralized Resource Allocation in Dynamic LoRa Networks. https://arxiv.org/abs/2608.00409

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

KEEP EXPLORING

Related papers

Online Treasure Hunt in Vertex-Permuted Dynamic Rings

We study the problem of treasure hunt by a group of $k \geq 1$ agents in vertex-permuted dynamic rings (VP). In this model, the $n$ vertices remain on a ring but are permuted at each time step. We first show that treasure hunt is impossible for any $k \leq n-3$ agents, if there are no restrictions on the sequence of permutations used in the dynamic ring. We then study the $VP(\delta)$ setting, in which for every pair $i, j$ of vertices, the edge $(i, j)$ is guaranteed to appear within $\delta$ steps. We show that the class $VP(\delta)$ is feasible only for $\delta \geq \left\lceil \frac{n-1}{2}\right\rceil$. For the one-agent case, we show a tight bound of $\Theta(\delta n)$ on the worst-case search time as well as competitive ratio of any online algorithm for treasure hunt, provided $\delta \geq 2n$. We then give an optimal algorithm for $k$ agents, thereby showing that $k$ agents can obtain a speedup of $k$ on the worst-case search time. Finally, in the R-VP setting, in which in every step, the vertices are arranged as a ring according to a random permutation, we show that treasure hunt takes expected $\Theta(n)$ steps against an oblivious adversary and $\Theta(n \log n)$ steps against an adaptive adversary.

cs.DC

The Computing Channel: How Modulation Programs the Airwaves

Distributed computing and distributed artificial intelligence require frequent exchanges of intermediate results, although many applications need only an aggregate rather than messages from individual devices. Conventional systems recover each message before computing the aggregate, whereas over-the-air computation (OAC) exploits simultaneous transmission to obtain it directly. However, dominant OAC implementations rely on analog signaling, creating a mismatch with finite-precision data and digital communication procedures. This article presents digital function-oriented communication, in which finite-alphabet symbol representations and receiver decisions are jointly designed so that multiple-access superposition encodes the desired function without recovering individual inputs. We introduce its computational-constellation principle, main design approaches, extensions, and implementation challenges. Federated edge learning illustrates how the framework can reduce user-dependent data-bearing resources while operating directly on quantized model updates.

cs.DC

Can AI Remediate Backend Failures Safely? GuardedAct with Blast-Radius-Aware Sandboxing

Large Language Models (LLMs) have shown promising capabilities in generating remediation actions for microservice failures. However, directly executing AI-generated repair actions in production risks cascading collateral damage. We propose GuardedAct, a sandbox-first remediation framework that interposes a blast-radius-aware verification layer between the LLM action generator and the production environment. GuardedAct operates in four phases: (1) ingesting a diagnosis report together with the live system topology and recent telemetry, (2) prompting an LLM to produce a ranked list of candidate remediation actions, (3) simulating each action in a lightweight digital-twin sandbox that estimates the blast radius and assigns a risk label, and (4) enforcing a rollback-confidence gate that auto-executes only low-risk actions while escalating high-risk ones for human review. We evaluate GuardedAct on five fault scenarios injected into the DeathStarBench social-network application. Experimental results show that GuardedAct achieves an overall recovery rate of 87.4% while reducing collateral damage by 79.7% relative to direct LLM execution (from 25.6% to 5.2%), at the cost of a modest sandbox-induced increase in mean time to recovery (approximately 8 s). Ablation studies confirm that each component contributes meaningfully to the safety-speed trade-off.

cs.DC