Skip to content
#edge computing Book Open access

Resilient Priority-Aware Inference for Mission-Critical UAV Networks Under Bursty Edge Load

Nov 2026 · Proceedings of the Twenty-seventh International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing · 0 citations · 3 references

TL;DR

This paper presents a priority-aware admission-control architecture built around two trust mechanisms: a lightweight router that assigns each request a priority level grounded in verifiable evidence rather than a model confidence, and a deterministic safety gate that rejects unsafe outputs regardless of which model checkpoint produced them.

Abstract

Mission-critical mobile networks, including UAV-based disaster-response systems, must keep delivering usable and trustworthy inference under the exact conditions that make inference harder: constrained edge compute, degraded backhaul, and requests arriving in bursts rather than at a steady rate. A system that allocates compute uniformly has no way to fail gracefully once a burst exceeds its budget, dropping high-urgency requests along with low-urgency ones. In this paper, we present a priority-aware admission-control architecture built around two trust mechanisms: a lightweight router that assigns each request a priority level grounded in verifiable evidence rather than a model confidence, and a deterministic safety gate that rejects unsafe outputs regardless of which model checkpoint produced them. Low- and medium-priority requests are served by a baseline checkpoint, and a confidence-gated escalation path that reserves a more capable checkpoint for requests that need it. Both mechanisms are designed as auditable security controls rather than opaque model judgments: the router functions as a content-based access-control decision, and the safety gate as a policy-enforcement point that cannot be bypassed by manipulating the model confidence. We evaluate this policy end-to-end. The priority queue degrades gracefully, exactly as designed, under a simulated burst load. The router and confidence gate that feed it, however, correctly protect only 46.58% of genuinely high-priority requests, and a policy-optimization stage did not measurably improve the underlying checkpoint. Ultimately, a safety mechanism is only as trustworthy as the evidence behind it.

Read PDF

Similar papers

Open access Oct 2026

Resilient Multi-UAV Emergency Networking with Adaptive Clustering and Priority-Aware Access for Beyond-5G Disaster Response

When a disaster disables terrestrial infrastructure, the command, control and situational-awareness traffic of the response teams loses its network. Fleets of unmanned aerial vehicles can restore connectivity within minutes, but most designs treat clustering, medium access, energy and failure recovery as separate probl...

Osman Kaya, Muhammet Ali Karabulut, C. Eyupoglu et al. · 0 citations
Open access 2026

A Prototype-Level Study of Jamming-Aware Route-to-Edge Tradeoffs in FANETs

Flying ad hoc networks (FANETs) used in counter-UAV missions must make routing decisions under jamming, rapid topology change, and uneven edge workload. Existing studies often treat routing and offloading separately, leaving the route-to-edge tradeoff under adversarial conditions insufficiently examined. This paper pre...

Yu-Jie Li, Sang-Chul Kim · 0 citations

Gossamer: Distributed QoS-Aware Request Routing for Stateful Large Language Model (LLM) Inference at the Edge

This work proposes Gossamer, a distributed scheduler where each edge node routes requests using type-weighted scoring over gossiped partial state, and GLARE (Gossip-driven Local Adaptive Routing Engine), a metaheuristic that uses gossip staleness to control per-node weight adaptation.

Qi-Fan Deng, Rajkummar Buyya · 0 citations
Preprint Sep 2026

IMPACT: Intent-driven Multi-agent Policy with Attention for SLO-guaranteed Microservice Migration in Cloud-edge Systems

Ensuring strict tail-latency service-level objectives (SLOs) in dynamic mobile edge computing (MEC) systems remains challenging because user mobility, wireless fading, bursty workloads, and partial observability jointly undermine reliable cloud-edge orchestration. Existing microservice migration methods predominantly o...

Xin-Jin Li, Si-Ru Tao, Shi-Han Yin et al. · 0 citations
Preprint Oct 2026

Conflict-Aware Autonomous Resource Orchestration for 5G Edge Slicing Using Multi-Agent Systems and LLMs

5G edge network slicing must reconcile two coupled requirements: understanding high-level operator intent and reallocating scarce computing and bandwidth resources under dynamic contention. Centralized optimization can face computational and responsiveness challenges under rapidly changing edge contention, and Multi-Ag...

Nathan R. Prediger, Rodrigo Moreira, Juliano Araújo Wickboldt et al. · 0 citations
Preprint Sep 2026

GateDrain: Availability Attacks and Admission-Side Defense for Confidence-Gated Edge-Cloud Inference

Confidence-gated edge--cloud inference accepts confident local predictions and offloads uncertain inputs to a stronger cloud model. We show that this routing decision creates an availability attack surface. We call this attack \emph{GateDrain}: bounded input perturbations lower calibrated confidence and redirect reques...

Zong-Hua Gu, Julian Singh-Smith, Jun-Lin Liao et al. · 1 citation

Related blog posts

Microsoft Research Blog Oct 29, 2026

Microsoft Research Focus – Edition #97

Host Sowbhagya Suresh shares some of the latest news and cutting-edge research from across Microsoft—from understanding the challenges facing coding agents to uncovering how people use AI at work and improving extended-range weather forecasting. The post Microsoft Research Focus – Edition #97 appeared first on Microsoft Research.

MIT News · Artificial Intelligence Oct 28, 2026

Making machines that can listen

Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.

Microsoft Research Blog Oct 21, 2026

Solving a 31-year-old grand challenge in mathematics – the KLS conjecture

For decades, a fundamental question about the difficulty of computing in high-dimensional spaces has resisted proof. New research resolves this question, removing a major theoretical obstacle to understanding the efficiency of randomized algorithms used across science and computing. The Kannan–Lovász–Simonovits (KLS) conjecture was proposed in 1995. It asks whether, for a broad class of high-dimensional […] The post Solving a 31-year-old grand challenge in mathematics – the KLS conjecture appear…

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.