Papers for
mobile network engineers
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.
Multimodal semantic encoding improves image reconstruction over noisy channels
Multimodal Semantic Communication using Shared and Unique Representation Decomposition
Abstract: Semantic communication (SemCom) has emerged as a promising paradigm for bandwidth-constrained mobile and vehicular networks. This paper proposes a unified representation learning framework for multimodal SemCom (MSC), which encodes heterogeneous data into a compact semantic space for efficient transmission and source recovery. The framework addresses the multimodal semantic representation gap, which arises when at least one modality contains semantic information that cannot be fully inferred from the other. To preserve this information for reconstruction, the framework decomposes each representation into shared and modality-specific components. We formulate a mutual information objective for source reconstruction, cross-modal alignment of the shared components, and decoupling of the shared and modality-specific components. To enhance transmission efficiency, we introduce a shared knowledge base implemented as a compact codebook of semantic vectors learned during training. The shared components are transmitted digitally as codebook indices, while the modality-specific components are sent in analog form. We apply knowledge distillation during training, using a pretrained vision foundation model to guide the learning of quantized shared features. On image--text pairs over additive white Gaussian noise (AWGN) and Extended Vehicular A (EVA) channels, the proposed framework improves image reconstruction over conventional separate source-channel coding (SSCC) and representative multimodal and unimodal SemCom systems. Further evaluations show gradual degradation under channel-estimation mismatch, complementary effects of alignment, decoupling, and knowledge distillation on the shared representation, and alignment of shared features across modalities with separation of the modality-specific features.
Robot learning adapts updates to unstable mobile networks
Network-Co-Designed Dynamic Sparsification for Dependable Distributed Robot Learning over 3GPP Networks
Abstract: Robot fleets performing distributed learning often face volatile uplink conditions like bandwidth variation, packet loss, and latency spikes that delay or destabilize training. We propose a network-co-designed dynamic sparsification loop that couples model-update compression to network-facing byte budgets and time constraints. We describe two realizations: (i) a standards-aligned SA6/5GC mapping that leverages CAPIF with NEF/PCF/NWDAF, enriched with AI-specific semantics; and (ii) a VASEAL-style role-reversed loop where the learning system exposes learning-state feedback and receives bounded, time-limited control intents. We implement the mechanism in an asynchronous federated reinforcement learning framework with heterogeneous simulated quadruped robots and reproducible uplink impairments via emulated network links. Results indicate that substantial communication reduction is achievable under dynamic constraints without materially degrading learning progress in the studied setting.
Intelligent routing agents improve protest communication during shutdowns
Distributed Intelligent Ad Hoc Routing Agents for Communication at Protests During Internet Shutdowns
Abstract: Governments around the world are increasingly using internet shutdowns to block digital communication. Internet shutdowns are particularly dangerous during political protests, as they inhibit protesters' ability to organize and communicate critical, potentially life-saving information and may be used to prevent awareness of state-based violence. Recent prior works have explored secure, private messaging systems for use during political protests and internet shutdowns but have encountered long delivery delays or low delivery rates under challenging conditions. In this work, we explore the use of distributed, adaptive, social- and congestion-aware heuristics and efficient communication patterns to create an intelligent ad hoc routing protocol in which network agents learn and leverage the network social environment and monitor and respond to dynamic network congestion behaviour to route messages in a time- and resource-efficient manner. Through this exploration, we contribute an intelligent algorithm and protocol which overall achieves comparable or higher delivery rates relative to the leading dynamic clique routing protocol which it extends while also transmitting messages through notably fewer carriers and, when network devices have larger amounts of buffer storage, transmitting fewer message-related packets. We additionally contribute a further understanding of routing limitations and challenges and conceptualizations of extensions of intelligent dynamic clique routing to overcome them.
Power saving and freshness tradeoffs in mobile device reception
Age of Information for Power-Saving Devices with DRX Mechanism
Abstract: Reducing the power consumption of User Equipment (UE) has always been a crucial issue in communication systems. As a result, Discontinuous reception (DRX) is introduced in today's New Radio (NR) networks as a power-saving strategy. In addition, the variety of low latency applications in 6G makes the issue of maintaining data freshness increasingly important. This paper aims to study the relationship between freshness and power-saving. To capture the information freshness, we use Age of Information (AoI) as the performance metric. To our best knowledge, unlike previous studies focusing on power saving and delay trade-offs, this is the first study considering the impact of DRX on AoI. We solve the closed-form solution of the peak average AoI with the DRX mechanism. Moreover, we propose a parameters adjustment strategy. Based on the simulation validation, our proposed strategy can enable the UE to keep the AoI close to the theoretical lower bound AoI while achieving high power-saving efficiency.
AI service traffic patterns revealed for 6G networks with new testbed
Characterizing AI Service Traffic for 6G: An Open Testbed and Initial Results from 3GPP SA4
Abstract: The design of sixth generation (6G) mobile systems requires measurements of artificial intelligence (AI) service traffic under controlled network conditions. The 3rd Generation Partnership Project (3GPP) Service and System Aspects Working Group 4 (SA4) documents such measurements in draft Technical Report 26.870. In this paper, we describe the open testbed used for the study and analyze the results recorded in version 0.6.2 and its companion workbook. The testbed combines network emulation, packet capture, application measurements, and scenario execution against hosted and self-hosted models. The reported uplink to downlink volume ratios span more than six orders of magnitude. A personal assistant agent has a ratio of 0.007 at its local control interface and 0.50 on its wide-area egress. Deterministic agent signaling follows the configured round-trip delay. In a tokenized video experiment with 125 questions per profile, the number of correct answers changes by at most three through 10% independent uplink loss. Larger losses reduce accuracy, but the available repetitions do not establish a tolerance threshold. We also analyze emulator behavior that affects the interpretation of the study. Per-packet jitter introduces reordering, correlated random-loss settings suppress rare loss events, and a Gilbert-Elliott parameter mapping changes the stationary loss rate. The results support characterization by scenario, measurement layer, and versioned network configuration.
QueueTrack detects early queueing in mobile networks reliably
QueueTrack: Framework for Detecting the Onset of Queueing in Mobile Networks
Abstract: In mobile networks, timely and accurate detection of the onset of queueing at path bottlenecks remains challenging for end-to-end congestion control algorithms (CCAs), where end hosts have limited visibility into queue status. Traditional congestion signals, such as packet loss, round-trip time (RTT), and one-way delay (OWD), have well-known limitations for early queue buildup detection. This paper presents QueueTrack, a practical end-host framework to detect the onset of queueing in mobile networks. QueueTrack computes a queue buildup indicator, denoted QBI, from endpoint-observable packet-level timing statistics, without requiring tight synchronization between end hosts or modifications to the existing network infrastructure. We develop and assess the complete QueueTrack machine learning (ML) pipeline, including data collection, labeling, model training, and testing, on a 5G testbed built on the OpenAirInterface platform, under a range of scenarios with competing TCP traffic. The experimental results show that QueueTrack can reliably detect the onset of queueing at the 5G base station using low-complexity classification models such as logistic regression. For example, QueueTrack achieves an F1 score of approximately 80% in a challenging mixed TCP/UDP scenario. These findings confirm that QueueTrack can serve as a practical framework for developing CCAs that target low delay, as well as for network telemetry and network monitoring in mobile networks.
Prism improves mobile network speed and cuts delay using RL
PRISM: RL-Based Rate Control for Low Latency and High Data Rate in Mobile Edge Networks
Abstract: Emerging delay-sensitive interactive services, such as extended reality and remote operation, demand advanced congestion control algorithms (CCAs) capable of maintaining high data rates while keeping latency low in mobile networks. Existing CCAs typically rely on congestion signals such as packet loss, delay, or explicit congestion notification (ECN) marks, which can be delayed, imprecise, or require extensive upgrades to the network infrastructure. To address these limitations, physical resource block (PRB) utilization has recently been proposed as a reliable early congestion signal in mobile networks [1]. This paper introduces PRISM, a reinforcement-learning-based CCA that uses peak PRB utilization to regulate the send rate under challenging mobility and fading conditions. NS3 simulation results show that, in a mobility scenario where two PRISM flows coexist with two TCP Cubic flows and one TCP BBR flow, PRISM maintains a per-packet mean one-way delay (OWD) of 6.3ms and a $p_{99}$ OWD of 44.6ms, with negligible (0.02%) packet loss, over a 20min high-contention interval. However, over the same interval, the coexisting TCP flows experience 60x higher mean OWDs of 371-390ms and $p_{99}$ OWDs of 563-578ms, with 0.1% packet loss. PRISM achieves a 31x improvement in goodput-over-latency performance, indicating a favorable tradeoff for delay-sensitive applications.
Metamodel improves confidence in predicting next mobile location
Selective Next-Location Prediction with MetaModelSelect: A Lightweight Post-Hoc Confidence Metamodel
Abstract: Next-location prediction can support proactive mobile-network decisions, but acting on unreliable predictions can waste resources. We apply MetaModelSelect, a lightweight post-hoc confidence metamodel, to selective cellular next-location prediction. The mobility-specific model combines a learned embedding of the predicted location with the four largest softmax probabilities and Softmax Concentration. It learns whether a frozen recurrent neural network's top-1 prediction is correct, using only its outputs and without retraining the backbone. On path-balanced Changchun cellular mobility trajectories, we evaluate backbones trained with cross-entropy (CE) and self-adaptive training plus entropy minimization (SAT+EM), comparing against eight scalar confidence scores, two location-aware lookup methods, and a raw-logit multilayer perceptron. Relative to maximum softmax probability, MetaModelSelect achieves mean per-run reductions in area under the risk--coverage curve (AURC), excess AURC (E-AURC), and area under the generalized risk--coverage curve (AUGRC) of 2.6%, 4.2%, and 3.0% for CE, and 2.0%, 3.3%, and 1.9% for SAT+EM. It also achieves the lowest reported mean risk at every evaluated partial coverage. The results show that MetaModelSelect improves confidence ranking in this mobility setting while leaving the underlying location predictor unchanged.
Mobile networks add tens of milliseconds in latency through exit routing
Bounding Mobile Latency from Network Interconnections
Abstract: Mobile latency is determined by how Mobile Network Operators (MNOs) route traffic: from phones, across the MNO's network to exit points where it enters the public Internet. Exit points are few, and MNOs are quiet about details, but their role prompts us to ask: What is the latency cost of sending traffic through an exit point? We develop a new method to evaluate this question, and demonstrate it on the three largest U.S. MNOs, although in principle it can apply globally. Using new analysis of existing traceroutes, we find that AT&T, T-Mobile, and Verizon funnel nationwide traffic through only 9, 5, and 9 exits, and the geographic detour they incur adds up to 62.1 ms compared to an ideal, direct-path latency. Routing delays also add latency. We show that even assuming speed-of-light paths through the exit points, latency is still up to 46.9 ms more than optimal. To understand if these costs can be overcome, we compare actual to theoretically optimal placements, finding that the latencies of current placements are 18-66% above the population-weighted optimum and 32-72% above the market-share-weighted optimum with the same number of exits. However, we show this gap is small in absolute terms: perfect placement would recover only a few milliseconds of the tens that remain. We show that geographic optimization saves little latency: the inflation users experience comes from routing and other overhead.
Compositional approach improves co-design for future mobile networks
A Compositional Perspective on Communication-Control Co-Design for Mobile Broadband Systems Beyond 6G
Abstract: Anticipated applications of beyond sixth-generation (B6G) mobile broadband networks will require the co-design of communication and control subsystems within the network architecture. Existing co-design approaches are predominantly optimization-driven, integrating subsystems through joint optimization problems. While this approach is effective in relatively simple systems, such formulations present challenges in (i) modular subsystem representations, (ii) tracing the propagation of requirements across subsystems, and (iii) systematically analyzing design-space feasibility, particularly as the number and complexity of interacting subsystems increase. In this article, we present a compositional perspective on co-design based on the formal theory of co-design. We examine how the notion of composition introduced by this theory can address the challenges of the conventional optimization-driven approach. Building on this perspective, we propose a composition-driven methodology for communication-control co-design in B6G networks and illustrate it through a wireless-assisted robotic control case-study. We then discuss how the composition-driven and optimization-driven co-design approaches can complement each other and why this complementarity may be beneficial for B6G networks. Finally, we identify key research challenges and future directions toward the practical adoption of the proposed methodology.
6G split computing architecture supports holograms and drone safety
6G NeXt - Towards 6G Split Computing Network Applications: Use Cases and Architecture
Abstract: The definition of the sixth generation mobile communication is in the full swing. Mobile communication aims for the convergence of physical, human and digital world. Research project 6G NeXt is considering two demanding use cases, holographic communications and drones anti-collision system, which set heterogeneous requirements on the communication as well as the computing infrastructure. In both use cases, the clients are widely spread in the network and are cooperatively interacting with each other. Especially for holographic communication, also high processing power is required. This makes a high-speed distributed backbone computing infrastructure, which realises the concept of split-computing, inevitable. Furthermore, tight integration between processing facilities and wireless network is required in order to provide adequate quality of service to the users. This paper illustrates the use case scenarios and their requirements. Afterwards, an appropriate solution approach to realise those is elaborated. Here, the novel technological approaches are discussed based on the developed overall communication and computing architecture.
Secure local caching cuts communication load in device networks
Secure D2D Coded Caching under Radius-Limited Connectivity via Lifting
Abstract: Secure device-to-device (D2D) caching requires users to generate delivery signals from their own caches and to recover their requested files without learning the other files. We construct schemes that meet both requirements when communication is limited to nearby users. The network consists of $K$ users on a cycle, a library of $N$ independent files, and a reception radius $r$. Delivery uses one round of noiseless orthogonal local broadcasts, with no server transmission. Each user's cache has capacity $M$ file units. An outer secret-sharing code assigns file shares to senders, and a secure local caching scheme at each sender delivers the requested shares. The cache budget includes the sender's library representation, random state, and delivery keys. We prove that each receiver's cache and all audible broadcasts jointly reveal no information about nonrequested files, despite the dependence between the outer shares. The converse counts transmissions crossing a contiguous user block and uses secrecy to remove one user's observation from the entropy bound. Let $h=2r$ and $K\ge h+1$. The private coded caching (PCC) instantiation attains the minimum peak sum load $K/h$ for every $M\ge Nh$ when $N>1$. For $N\ge K$, its memory-sharing envelope is within a factor $15$ of the optimum throughout $M\in[N/h+2,Nh]$. We also apply lifting without secrecy constraints, achieving the optimal load on $M\in[hN/(h+1),N]$ and a factor-$9/2$ guarantee on $M\in[N/(h+1),N]$ when $N\ge K$.
Dual stream system cuts video data for wireless use
Toward Generative Video Communication: A Dual-Stream Digital Transmission Framework
Abstract: Generative video communication has shown promise for bandwidth-constrained wireless transmission and has the potential to support personalized content delivery. In this article, we propose a dual-stream digital generative video communication (DGVC) framework that integrates a traditional digital link with a generative link. The traditional link provides source-grounded visual references, while the generative link conveys compact semantic and perceptual information for receiver-side generation. We further discuss three bandwidth-dependent operating regimes and key technologies for dual-stream coordination, synchronization, reliability, and latency control. A practical case study demonstrates the perceptual and temporal-quality benefits of DGVC under wireless fading channels. Finally, we discuss open challenges and future research directions for generative video communication.
Fedoag enables efficient federated learning over varied wireless channels
Over-the-Air Federated Learning in Heterogeneous Mobile Wireless Networks
Abstract: Over-the-air computation has emerged as a scalable and efficient solution for deploying federated learning algorithms in wireless networks by exploiting waveform superposition for simultaneous model aggregation. Most existing work struggles with heterogeneous fading channels. These approaches either enforce unbiased updates from all devices or allow partial device contributions, requiring careful tuning of the convergence bound to mitigate bias under specific fading models. However, the former significantly amplifies receiver noise due to the weakest channel, whereas the latter is sensitive to fading model mismatch and converges only to a biased objective. To tackle these challenges, we propose FedOAG, which employs algorithmic components to automatically satisfy energy constraints via gradient normalization and evenly mix devices' updates through implicit gossiping. Importantly, FedOAG does not require transmission from all devices, nor does it rely on a specific fading model or knowledge of time-varying statistical channel distributions. We show that FedOAG converges to a stationary point of an unbiased non-convex objective at the best possible rate $O(1/\sqrt{T})$ for any stochastic first-order method. We corroborate our analysis with numerical experiments over dynamic wireless conditions on real-world datasets.
Theory of best stopping time for fading connections in peer learning
PROSE: A Theory of Optimal Stopping with Perishable Evidence for Peer Selection in Intermittently Connected Decentralised Learning
Abstract: Decentralised federated learning removes the aggregation server but makes collaboration dependent on transient peer availability. In mobile and intermittently connected systems, evaluating a promising peer consumes contact time and may cause the exchange opportunity itself to vanish, so that the evidence a learner gathers about a peer is perishable: it decays because links expire and because peer models drift while old measurements age. This paper develops a self-contained theory of optimal stopping for the resulting peer-selection problem. We formalise a receiver's within-contact decision as a finite-horizon Markov optimal-stopping problem with costly information acquisition and a future-arrival outside option, and prove that it admits an optimal policy characterised by a reservation value (Snell-envelope structure). Around this formulation we prove: (i) stage-uniform, drift-aware concentration and a maximin certification rule that is correct with high probability together with a finite-sample identification bound; (ii) a mobility-aware value of-information stopping rule and comparative statics showing that higher link hazard lowers the value of continued probing and enlarges the stopping region; (iii) a closed-form value of waiting under marked-Poisson contact arrivals, together with a search-theoretic reservation value whose comparative statics we characterise; and (iv) a myopic-optimality theorem establishing that, in sufficiently volatile (monotone) mobility regimes, the one-step confidence-safe rule is a sound surrogate for the optimal policy and never stops prematurely. We instantiate the theory as PROSE (Perishable-evidence Reservation-value Optimal Stopping for Exchange), a lightweight, fully local policy, and delineate the static contact and drift-free limits in which classical sequential decision problems are recovered. The development is entirely analytical.
Pinching antennas enable flexible communication and sensing in 6g networks
Pinching-Antenna-Enabled ISAC: A Unified Architecture for Flexible Communication and Sensing
Abstract: Integrated sensing and communication (ISAC) is a cornerstone of sixth-generation (6G) networks, yet conventional fixed-antenna systems lack the spatial adaptability to cope with dynamic users and targets. The emerging pinching antenna (PA) offers a flexible, low-cost solution by dynamically reconfiguring radiation points along waveguides, introducing large-scale spatial degrees of freedom. This article develops a unified architectural perspective for PA-enabled ISAC. We first discuss the unique advantages of PAs over existing flexible solutions, and then propose a PA-enabled ISAC framework that accommodates both uplink and downlink communication while being compatible with passive and active sensing targets. Within this framework, we identify representative application scenarios, discuss major design challenges, and highlight critical enabling techniques. A numerical case study demonstrates how PA reconfigurability affects the communication-sensing rate trade-off. We also outline open issues to guide further PA-ISAC research for future 6G networks.
Federated adaptive knowledge distillation cuts communication for large language models
FLoKD: Adaptive Knowledge Distillation for Federated Low-Rank LLM over Wireless Networks
Abstract: Large language models (LLMs) have demonstrated strong capabilities across a wide range of natural language processing tasks. However, conventional fine-tuning typically relies on centralized data collection, bringing in privacy concerns. Federated learning (FL) enables collaborative LLM fine-tuning without sharing raw client data, but its deployment over bandwidth-constrained wireless networks is hindered by the communication overhead of model-parameter transmission. Although Low-Rank Adaptation (LoRA) reduces the number of trainable parameters, its communication cost still increases with model scale. Knowledge distillation avoids parameter sharing via output logits, but token-level logits in LLMs incur high communication cost due to sequence length and vocabulary size. Reducing logits lowers the cost but weakens supervision and degrades accuracy. To address these limitations, we propose FLoKD, an adaptive knowledge-distillation framework for federated LoRA fine-tuning of LLMs over wireless networks, which communicates intermediate LoRA activations as the distillation signal rather than logits or full parameters. Since transmitting all blocks over the entire public dataset remains costly, we further propose a transformer block importance scoring framework that selectively transmits the most informative blocks, and two dataset selection strategies that discard public samples deviating from the local data distribution and prioritise those most informative for distillation. Extensive experiments across multiple generative language datasets, including WikiText-103, PTB, and Dialog, demonstrate that our proposed framework reduces communication overhead by 50-65% while achieving rapid convergence to competitive perplexity compared to baselines.
OTFS modulation outperforms OFDM in high mobility wireless communication
Comparative Performance Analysis of OTFS and OFDM Modulations for Mobile Wireless Communications
Abstract: This paper provides a quantitative performance comparison between Orthogonal Time Frequency Space (OTFS) and Orthogonal Frequency-Division Multiplexing (OFDM) modulation schemes, focusing on mobile wireless communication scenarios. We evaluate and compare both schemes based on critical communication scenarios and configurations such as mobility levels, modulation orders, multipath environments, and equalizers. The study systematically identifies conditions where OTFS and OFDM each exhibit optimal performance. Results from simulations demonstrate that OTFS outperforms OFDM consistently for high mobility scenarios and multipath environments. Depending on the modulation order, the performance gap between OTFS and OFDM might be very close or many orders of magnitude. Moreover, at low and mid values of SNR, the non-linear equalizer performs better than traditional linear equalizers for OTFS.