Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.07415

Understanding Conflict and Compatibility Conditions for Agents in AI-RAN

Arshia Zolghadr·Joao F. Santos·Imtiaz Nasim·Deniz Aytemiz·Nicholas J. Kaminski·Jacek Kibilda
View original source ↗Read source document ↗Export metadata ↓

Abstract

Disaggregated mobile networks expose open interfaces for independent agents to control the Radio Access Network (RAN). The interactions between agents with contrasting objectives can result in conflicts. However, existing conflict mitigation methods treat agents that control the same parameter as being in a conflict that requires arbitration of their actions, without assessing whether their objectives can be satisfied simultaneously. In this paper, we introduce a control-theoretic approach to determine when agents can coexist and share control of the same parameters. We model threshold-based agents often encountered in the literature as sampled deadband feedback controllers and represent their objectives through Key Performance Indicator (KPI) targets and tolerances that define acceptable deadband bounds. We derive compatibility conditions from these bounds and show that compatibility for any number of agents and monitored KPIs can be established through pairwise tests. We propose a conflict mitigation policy that allows compatible agents to share control of the same network parameters while restricting arbitration to cases where their objectives cannot be satisfied simultaneously. We evaluate our policy through simulations using NIST's ns3-oran extension of ns-3, and our results show that it enables agents to share control with near-zero Service Level Agreement (SLA) drift when their objectives are compatible and the shared acceptable range is attainable, while matching Priority Mitigation when their objectives are incompatible.

Explore related subjects

cs.NIcs.SYeess.SY

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Arshia Zolghadr, Joao F. Santos, Imtiaz Nasim, Deniz Aytemiz, Nicholas J. Kaminski, Jacek Kibilda. 2026-10-05. Understanding Conflict and Compatibility Conditions for Agents in AI-RAN. https://arxiv.org/abs/2610.07415

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

KEEP EXPLORING

Related papers

arXiv2026

How Feasible are Passive Network Attacks on 5G Networks and Beyond? A Survey

Privacy concerns around 5G, the latest generation of mobile networks, are growing, with fears that its deployment may increase exposure to privacy risks. This perception is largely driven by the use of denser deployments of small antenna systems, which enable highly accurate data collection at higher speeds and closer proximity to mobile users. At the same time, 5G's unique radio communication features can make the reproduction of known network attacks more challenging. In particular, passive network attacks, which do not involve direct interaction with the target network and are therefore nearly impossible to detect, remain a pressing concern. Such attacks can reveal sensitive information about users, their devices, and active applications, which may then be exploited through known vulnerabilities or spear-phishing schemes. This survey examines the feasibility of passive network attacks in 5G and beyond (B5G/6G) networks, with emphasis on two major categories: information extraction (system identification, website and application fingerprinting) and geolocation (user identification and position tracking). These attacks are well documented and reproducible in existing wireless and mobile systems, including short-range networks (IEEE 802.11) and, to a lesser extent, LTE. Current evidence suggests that while such attacks remain theoretically possible in 5G, their practical execution is significantly constrained by directional beamforming, high-frequency propagation characteristics, and encryption mechanisms. For B5G and early 6G networks, the lack of public tools and high hardware cost currently renders these attacks infeasible in practice, which highlights a critical gap in our understanding of future network threat models.

cs.NI↗
arXiv2026

Orientation-Aware Deep Learning Framework for RSSI-Based Indoor Localization in RIS-Aided mmWave Systems

Reconfigurable intelligent surface (RIS)-aided millimeter wave (mmWave) systems provide directional measurements of received power for indoor localization, but device orientation changes the fingerprints. This work proposes an orientation-aware dual-stream gated (O-DSG) deep learning framework for received signal strength indicator (RSSI)-based indoor localization. An orientation classifier estimates device orientation from RSSI, so inference needs only received power. An embedding of the predicted angle and posterior entropy controls feature modulation and soft expert gating. Parallel convolutional and statistical streams are fused through bidirectional long short-term memory (BiLSTM) processing and temporal attention. Single-user measurements in an indoor laboratory at 28 GHz under non-line-of-sight (NLoS) conditions yield a median localization error of 0.141 m, a 25.8% improvement over the closest evaluated baseline (supplied with the measured orientation), and 92.3% orientation classification accuracy across four discrete classes. In spatial regions withheld from training, O-DSG has an average median error of 0.247 m, against 0.392 m for a validation-selected sequence model. A separate offline evaluation constructs non-orthogonal multiple access (NOMA)-style power mixtures from the single-user measurements and measures localization accuracy and computational scaling with up to eight emulated users whose power contributions overlap, under the specified mixture model.

cs.NI↗
arXiv2026

PriorityFEC: Deadline-Aware Streaming FEC for KV-Cache Handoff in Edge Multi-Agent Systems

Multi-agent large language model (LLM) systems are increasingly deployed at the edge to support complex tasks that require collaboration and information exchange among multiple agents. However, when task contexts are passed across agents, shared context that has already been processed by upstream agents often needs to be prefilled again, resulting in substantial redundant computation. Reusing an already prefilled key--value (KV) cache can avoid this recomputation, but requires the reusable KV state to be transferred across the network before the receiving agent can begin generation. Under strict time-to-first-token (TTFT) deadlines and unreliable edge links, delivering the complete KV cache may be infeasible, making it necessary to prioritize and protect the most valuable KV information within a limited transmission budget. This paper proposes PriorityFEC, a utility-aware KV-cache handoff scheme that jointly exploits model-side KV importance and transport-side reliability. PriorityFEC first constructs a utility-aware source stream by placing high-utility KV blocks at earlier transmission positions. It then protects the ordered stream using a feedback-adaptive Streaming Forward Erasure Correction (FEC) mechanism, which schedules repair packets according to receiver feedback before the TTFT deadline. We implement PriorityFEC on a distributed edge LLM serving prototype and evaluate it with Qwen2.5-7B-Instruct and Llama-3.1-8B-Instruct across multiple datasets. Results show that PriorityFEC achieves superior task quality over the compared transport schemes, with its advantages becoming particularly pronounced under stringent deadline constraints. These results demonstrate the importance of jointly optimizing KV-cache utility and deadline-aware transport reliability when reusable LLM state must be handed off across unreliable edge networks.

cs.NI↗