Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.36602

Martingale-Based Resource Partitioning Bounds for URLLC and eMBB Network Slicing in 5G

Hanbing Li·Yantong Wang
View original source ↗Read source document ↗Export metadata ↓

Abstract

Network slicing is a key enabler for the coexistence of ultra-reliable low-latency communications (URLLC) and enhanced mobile broadband (eMBB) in 5G networks. However, allocating limited radio resources to heterogeneous slices while satisfying stringent quality-of-service (QoS) requirements remains challenging, particularly in the ultra-reliable regime where conventional effective-capacity-based approaches may lead to excessive resource allocation. To address this issue, this paper proposes a martingale-based resource block (RB) allocation framework for coexisting URLLC and eMBB slices. By constructing exponential martingale processes using the moment generating functions (MGFs) of the arrival and service processes and applying Doob's maximal inequality, explicit non-asymptotic upper bounds are derived for the URLLC delay violation probability and the eMBB backlog violation probability. Based on the resulting theoretical stability conditions, a low-complexity bisection algorithm is developed to determine the optimal martingale parameters, followed by a deterministic search algorithm to obtain the minimum RB requirements for both slices. Numerical results show that the analytical bounds effectively upper-bound the Monte Carlo simulation results. At a target violation probability of $10^{-6}$ for each slice, the proposed framework requires 44 RBs in total, satisfying the system capacity constraint of 50 RBs. Compared with the conventional effective-capacity baseline requiring 64 RBs, the proposed framework reduces total RB consumption by approximately 31.2% relative to the conventional effective-capacity baseline.

Explore related subjects

cs.NI

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hanbing Li, Yantong Wang. 2026-10-27. Martingale-Based Resource Partitioning Bounds for URLLC and eMBB Network Slicing in 5G. https://arxiv.org/abs/2610.36602

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

KEEP EXPLORING

Related papers

arXiv2026

NetGuise: Adversarial Traffic Generation for Early-Stage Classifier Evasion

Early-stage encrypted traffic classifiers make decisions from only the first few packets of a connection, enabling low-latency classification but raising robustness concerns under realistic traffic morphing. Existing adversarial traffic generation methods often assume complete flows, feature-level perturbations, or iterative runtime feedback, which do not match the constraints of early-stage execution. We present NetGuise, a target-conditioned traffic morphing framework that generates packet-level padding and non-negative delay actions while preserving packet direction, ordering, and packet count and respecting MTU, bandwidth, and latency constraints. We evaluate NetGuise for censorship evasion under two observation interfaces, i) a history-only causal interface for online packet-by-packet execution, ii) and a full-window oracle interface that provides an upper-bound characterization of early-stage morphability. On VANT, NetGuise achieves 33.2% mean targeted evasion under the causal interface versus 82.0% under the oracle interface; on UTMobileNet, the corresponding results are 5.6% and 81.8%. NetGuise outperforms the strongest causal baseline, BAP, on both datasets and, on VANT, reduces bandwidth overhead from 19.80% to 3.02% and generation latency from 37.42 ms/flow to 1.16 ms/flow. Under the oracle interface, it achieves up to 85.7% targeted evasion, retains 43.5% after four rounds of adaptive censor retraining, and maintains 48% under zero-shot cross-environment transfer. Our results show that early-stage classifiers can remain morphable despite high clean accuracy and that robustness evaluation should account for targeted morphability, observation constraints, defender adaptation, and operational network conditions.

cs.NI↗
arXiv2026

RadarCom: Unlocking Simultaneous Communication and Sensing on Commodity Automotive mmWave Radars

Vehicle-to-vehicle (V2V) communication can improve road safety and traffic efficiency, yet its deployment remains limited by the need for dedicated communication hardware and supporting infrastructure. Meanwhile, production vehicles are already widely equipped with millimeter-wave radars for sensing. To unlock their communication potential, this paper presents RadarCom, a software-defined system that enables direct radar-to-radar communication on unmodified commercial off-the-shelf (COTS) automotive mmWave radars while preserving their native sensing functionality. The key insight is that mutual inter-radar interference, traditionally viewed as harmful, can be repurposed as a communication carrier. Based on this insight, RadarCom introduces slope-mismatch-based discovery, adaptive chirp synchronization, differential coding on range-FFT, and sensing-aware interference suppression to enable simultaneous communication and sensing without hardware modification, waveform redesign, or infrastructure support. We implement RadarCom on TI AWR2243 automotive radars and evaluate it under static, dynamic, and challenging real-world conditions. Results show an average effective data rate of 5.55 kbps with symbol error rates below 1.5%, while maintaining sensing F1 scores of up to 80.5% during concurrent communication. These results demonstrate the feasibility of transforming commodity automotive radars into dual-purpose communication and sensing devices.

cs.NI↗
arXiv2026

GLo-MAPPO: Multi-Agent Deep Reinforcement Learning for Energy-Efficient UAV-Assisted LoRa Networks

The rapid advancement of Low-Power Wide Area Networks (LPWANs), particularly Long Range (LoRa) technology, has positioned them as a cornerstone of Next-Generation Internet of Things (NG-IoT) applications. Despite their long-range and low-power advantages, achieving high energy efficiency (EE) in LoRa networks remains a significant challenge in highly dynamic environments. Traditional terrestrial gateway deployments often suffer from coverage gaps and non-line-of-sight (NLoS) propagation, while satellite-based alternatives incur excessive energy consumption and prohibitive latency. To address these limitations, we propose a multi-UAV architecture in which unmanned aerial vehicles (UAVs) serve as mobile LoRa gateways to dynamically collect data from LoRa end devices (EDs). We formulate a joint optimization problem to maximize the weighted system EE by jointly optimizing spreading factors, transmission powers, UAV trajectories, and ED-UAV associations. This problem is transformed into a partially observable stochastic game (POSG), which we solve using our proposed Green LoRa Multi-Agent Proximal Policy Optimization (GLo-MAPPO). We adopt PPO because its clipped surrogate objective discourages excessively large policy updates, thereby promoting stable learning as multiple UAV agents simultaneously adapt their behaviors. Combined with centralized training and decentralized execution (CTDE), this enables coordinated policy learning while allowing each UAV to make decisions independently during execution. Simulation results show that GLo-MAPPO consistently outperforms state-of-the-art multi-agent reinforcement learning (MARL) benchmarks in terms of EE and power consumption across varying network densities. We further validate the trained policy through closed-loop, packet-level co-simulation using the OMNeT++/FLoRa LoRa simulator. Finally, ....

cs.NI↗