Papers

We evaluate multi-target detection, association and tracking end to end on an O-RAN simulation testbed built from OpenAirInterface, FlexRIC and Sionna RT that repurposes the 5G NR uplink sounding reference signal as a passive radar waveform, and against what a counter-UAS command-and- control (C2) consumer requires rather than by detection alone. Three UAVs differing in altitude, velocity and radar cross section (-8 to -20 dBsm) fly one bistatic pair with an 8-element planar receive array. Once every target is detected the binding limit is contention, not sensitivity - two targets share one nearest detection in about 74% of coherent processing intervals, and targets are detected far more often than they are tracked. Elevation from that array cannot separate targets sharing a range-Doppler cell, but it decides association in 58% of intervals. Concurrent tracks are exported from the RAN Intelligent Controller (RIC) xApp to a C2 fusion node over a SAPIENT interface carrying a calibrated detection confidence, validated at schema level against a mock fusion node. The evaluation is emulation-only on one geometry with 10 noise seeds, the mechanisms are characterized and analyzed to identify the key factors influencing multi-target tracking performance.

In this paper, we consider an indoor networking architecture in which visible light communication (VLC) provides wireless connectivity between users and distributed fog computing resources and an energy-efficient passive optical network (PON)- based backhaul interconnects the VLC access points (APs). We investigate the joint optimization of the allocation of VLC and fog computing resources aiming to minimize processing and networking power consumption. We develop a mixed-integer linear programming (MILP) model that jointly optimizes access points (APs) selection, wavelength assignment and fog computing resources allocation to serve the requests of users. Compared to a statically preconfigured AP selection and wavelength assignment based on maximizing signal-to-interference-plus-noise ratio (SINR) independently of fog resource placement, the joint optimization achieves lower average total power consumption, driven by a reduction in processing power. These savings are attributed to the ability of the joint optimization to allow AP sharing across users and selecting more energy-efficient wavelengths that still satisfy quality of service (QoS) requirements.

Multipath transports place a client's WiFi, cellular, and satellite networks under one connection, yet real-time video gains little from them. The scheduler that assigns packets to paths sees only bytes, so it cannot tell a keyframe that anchors a second of video from an enhancement frame whose loss costs one image. We show that the limiting factor is not a shortage of path diversity but the absence of a channel through which the application can name what the transport cannot see. Media over QUIC Transport (MoQT), already deployed on production CDNs, carries media as named Objects, and relays forward each Object's metadata without interpreting it. The knowledge the scheduler lacks therefore already flows through the subscriber's relay. We present MoMQ, a MoQT extension that turns this metadata into path decisions. Applications and relay operators install declarative rules at the edge relay that match Object metadata and express delivery preferences against labeled paths. The relay evaluates the rules mechanically, so it acts on video semantics while containing no video logic. On a live testbed spanning Starlink and WiFi, four rules cut P99.9 frame completion time from 384.7 ms under the best transport-only scheduler to 114.1 ms and reduce the required playback buffer by 61.5%. MoMQ is the only configuration that meets the 150 ms interactive latency target. Across relays in two countries and subscribers on two continents, the same rules apply unchanged and retain their advantage wherever the paths remain disjoint.

The Organic 6G vision of a network of networks spanning an edge-cloud continuum complemented by non-terrestrial resources requires, to realize its promise, service provisioning that is simple to operate, scalable across independently administered domains, and agile under domain churn (i.e., domains dynamically joining and leaving). Despite advances in cross-domain orchestration, many proposals rely on heavy integration fabrics, multi-layer coordinators, and deep telemetry pipelines that hinder deployability and amplify coordination overhead. We propose a lightweight, decentralized conversational orchestration framework based on Large Language Model (LLM)-driven domain agents. Each domain remains autonomous: an agent observes local state via tools, reasons in a closed loop, and exchanges summaries with neighboring agents over an Agent-to-Agent (A2A) overlay aligned with data-plane coupling. Fast feasible placement is enabled by periodic, routing-like dissemination of reachability advertisements (latency, bottleneck bandwidth, and compute capacity), while safe re-optimization, scaling, and migration are handled through event-driven requests and negotiation. To meet real-time constraints, we deploy a compact reasoning model trained with verifier-based self-verification and periodically refined online via shadow updates. Simulations show manageable, near-linear control-plane overhead as domains scale and during domain joins, and robust decision quality, including recovery after objective changes. We close by outlining future research directions for principled, secure, and uncertainty-aware agentic orchestration in Organic 6G.

Traditional resource allocation policies for multimedia streaming have primarily targeted metrics such as throughput, fairness and delay. However, user satisfaction is known to be strongly influenced by variations in throughput. Although some recent works have considered throughput variations, they overlooked a well-known aspect of human behavior that has reshaped behavioral economics over the past few decades: the same amount of decrease in throughput causes greater annoyance than the satisfaction caused by the increase. Motivated by this insight from the broad field of economics, popularly known as prospect theory, we propose a generic utility (metric) that captures both the average throughput and the asymmetric effect of throughput variations on user satisfaction. Next, we propose a resource allocation policy that reduces abrupt decreases in allocated resources when the system transitions from a resource-rich to resource-scarce state while respecting the priorities of different classes of users. Extensive simulations show that this policy outperforms the existing fair allocation policies. However, the choice of the optimal threshold depends on the network instance, which, in practice, may change frequently. Hence, building on the theoretical analysis of multi-queue systems, we propose fast numerical methods for determining the optimal threshold, which can be used in field deployments.

Billions of users take Internet connectivity for granted and use it daily to access applications deployed anywhere around the globe. What users perceive as a seamless connection between their end device and the application server involves a complex system of systems operated by various actors. Failures in any of these systems disrupt user-to-application connectivity if the communication network is not resilient. Since communication networks are a critical infrastructure as part of ICT, real-world operators rarely disclose information about them. This makes it difficult to measure the end-to-end resilience of deployments, because it requires guessing topologies and the availability of the involved systems. This paper presents DRACO, a framework for modeling communication networks and measuring end-to-end resilience of application deployments. It enables configuring application deployments across arbitrary communication networks and evaluating their availability, robustness, and resilience. We demonstrate the functional scope of DRACO by modeling nationwide application deployments in Germany and France, highlighting its compatibility with a wide variety of public data sources and synthetic data.

The highly dynamic and safety-critical characteristics of low-altitude airspace render sensing an indispensable component of low-altitude wireless networks (LAWN). Although sensing techniques have been extensively studied under diverse paradigms, a prominent mismatch persists between state-of-the-art sensing schemes and the practical sensing demands of LAWN. To fill this research gap, this article systematically reviews LAWN-oriented sensing from the dimensions of system framework, core technologies, and research trends. Specifically, we first analyze the sensing system framework, covering concepts, services and tasks, nodes and targets, and scenarios for LAWN sensing. Next, we conduct a comparative analysis of existing sensing techniques from the perspectives of propagation medium, cooperation, methodology, and modality, analyzing their advantages and limitations. Then, we summarize promising future research directions for deployable LAWN sensing systems, covering non-cooperative and cooperative sensing, model-driven and data-driven sensing, and model-and-data-driven multi-modal sensing. Finally, we present a case study of a model-and-data-driven multi-modal method for real-time aerial target sensing. Compared with existing surveys on LAWN or sensing, this article delivers a more comprehensive, targeted review exclusively centered on LAWN sensing.

Edge LLMs must preserve inference continuity when a user hands over between edge nodes, requiring key-value (KV) cache transfer to the target node. However, simultaneous handovers saturate the backhaul, preventing full cache delivery within the mobility-imposed transfer window. Rather than allocating bandwidth as if all cache entries were equally valuable, we order each user's KV cache by importance and transmit only its most informative fraction, turning token-level sparsity into communication savings. We cast the transfer as a multi-user backhaul allocation problem that maximizes average accuracy across users. Each user's partial-cache accuracy serves as its utility: a sigmoid that fits measurements on the RULER benchmark with $R^2>0.99$ across models and context lengths. Because importance ordering front-loads the high-value entries, the concave region of the accuracy curve spans nearly the entire cache. Our proposed allocator keeps served users within this region, making each per-slot allocation problem convex. The optimum is derived via a closed-form weighted water-filling solution that generalizes information-theoretic water-filling and enables online scheduling. The proposed allocator attains over 93.7% average accuracy in a 500ms transfer window, within 0.5pp of the full-cache ceiling, and reaches 98.2-99.5% of a clairvoyant upper bound.

Time Division Multiple Access (TDMA)-based Medium Access Control (MAC) protocols have proven their practicality through extensive field trials in Underwater Acoustic Networks (UANs), attributable to their hardware compatibility and ease of implementation. In conventional TDMA-based MAC designs, channel access is typically organized using synchronized, fixed-length slots to mitigate contention and coordinate transmissions. However, this paradigm imposes significant clock synchronization overhead in UANs with long and variable propagation delays and struggles to improve scheduling flexibility. Although some protocols attempt to refine this slot paradigm (adjust the slot length to improve channel reuse efficiency or scheduling frequency), they are still constrained by the trade-off between channel utilization and scheduling complexity. To this end, this paper proposes AT-MAC, an Asynchronous Triggered MAC protocol that aims to achieve efficient and fair channel access through coordinated asynchronous scheduling. AT-MAC introduces a triggered slot paradigm without time synchronization, decoupling transmission scheduling from a rigid timeline and enabling asynchronous, variable-length slots to accommodate the long and diverse propagation delays. To power this slot paradigm, AT-MAC augments conventional Multi-Agent Deep Reinforcement Learning to handle asynchronous interaction, achieving coordinated channel access under partial observations. It further devises a load-aware fairness guard mechanism to enable network-wide fairness status inference solely through local overhearing, thereby guiding adaptive scheduling correction to maintain fairness. Field-reconstructed simulations and on-board inference benchmarking demonstrate the feasibility of AT-MAC. Extensive simulation results further demonstrate its consistent performance gains across the evaluated scenarios and traffic conditions.

Static load balancers cannot mitigate a backend that is degraded rather than down: round-robin and least-connections keep routing traffic to a server returning HTTP 500s until an operator intervenes. We ask whether a Large Language Model can replace the static routing policy itself, reading HAProxy and Prometheus telemetry every 10 seconds and isolating faulty servers through guardrailed calls to the HAProxy Data Plane API. On a reproducible benchmark with a persistent structural fault built into roughly one-third of a heterogeneous fleet, we sweep 15 open-weight models across five families (0.35B to 35B total parameters; dense, mixture-of-experts, and efficient-sparse architectures), reasoning modes, fleet scales of 3 to 9 backends, and two routing algorithms, totaling 240 runs. We find a capability threshold near 3B active parameters. Below it, LLM policies are typically unreliable and sometimes worse than no policy; above it, every model, regardless of architecture, saturates near an 88% reduction in client-perceived 5xx errors over the static baseline. The threshold is approximate: Gemma 4 E2B clears it with 2B active parameters, while the dense 3B Granite 4.0 Micro does not. The availability gain has costs. Draining concentrates load onto surviving servers, inflating tail latency 2.6 to 2.8 times, and enabling reasoning multiplies token spend roughly tenfold, overrunning the control interval and degrading effectiveness. The efficient operating point is a supra-threshold model in its cheapest non-reasoning mode, wrapped inside deterministic guardrails.

Accurate physical-layer modeling is increasingly essential for reliable ultra-wideband operation and capacity optimization, especially under the intensified inter-channel stimulated Raman scattering (ISRS) effect. This paper proposes the link-adaptive digital twin (LA-DT) for hybrid-amplified ultra-wideband links to overcome the generalization and speed limitations of existing methods, achieving accurate modeling and robust generalized signal-to-noise ratio (GSNR) estimation across diverse links. First, to address EDFA heterogeneity, the GSNR modeling task is decomposed into three key power predictions: ASE, NLI, and signal powers before EDFA entry. Second, to enhance cross-scenario generalization, three dedicated DT models are developed using a novel neural architecture with linear modulation layers (LMLs). Third, for rapid adaptation to unseen scenarios with limited data, three domain discriminators guide few-shot fine-tuning of the LMLs. Fourth, the LA-DT explicitly accounts for Raman amplifier (RA) insertion loss, improving practical deployment reliability. Results across 35 scenarios show that LA-DT reduces RMSE for NLI, ASE, and signal power predictions to 0.151, 0.111, and 0.113 dBm with improvements of 56.0%, 58.4%, and 52.7% over the baseline,and achieves an average GSNR estimation RMSE of 0.114 dBm (55.8% improvement). For 12 unseen scenarios, the LA-DT maintains high accuracy through few-shot fine-tuning with only 20 samples per scenario, achieving an average GSNR RMSE of 0.159 dB and demonstrating strong adaptability and robustness.

In multi-user wireless power transfer (WPT), scheduling schemes that determine the allocation of transmission resources among receivers play a crucial role in improving power transfer efficiency. Scheduling can be classified into time-division (TD) and space-division (SD) schemes, with the transmission order and direction designed to control when and to whom power is delivered. TD-WPT can exploit the nonlinear characteristics of rectennas by concentrating power in time; however, a system relying on highly directional transmission from a single location reduces robustness under time-varying channel conditions. This study investigated the effectiveness of spatio-temporal scheduling in coordinated multi-transmitter WPT systems. By employing multiple transmitters, the proposed method is robust against channel variations in delivering power. Moreover, coordinated beamforming among transmitters exploits inter-cluster interference. Simulation results demonstrate the potential of the proposed scheme for robust and efficient power supply, even under shadowing conditions.

Machine-learning intrusion-detection studies commonly emphasize predictive accuracy while treating explanation generation as a computationally free post-processing step. This study jointly evaluates predictive effectiveness, explanation cost, local explanation stability, and selective explanation for binary Internet of Things (IoT) intrusion detection. A leakage-safe CICIoT2023 corpus was constructed using exact 39-feature hashes, non-finite-value handling, exact-feature deduplication, conservative label-collision removal, and deterministic hash-level partitioning. Logistic Regression, Decision Tree, Random Forest, and XGBoost were evaluated on natural and balanced test distributions. TreeSHAP cost was measured, stability was assessed under prediction-preserving perturbations, and validation-calibrated policies were used to allocate explanation workload. XGBoost provided the strongest overall predictive profile, while Random Forest produced the lowest false-positive rate. At 5,000 samples, TreeSHAP required 700.759 s for Random Forest and 1.471 s for XGBoost. Random Forest showed the strongest overall base-level explanation stability; XGBoost retained high rank and directional consistency but showed greater top-feature turnover and attribution-magnitude drift. On the balanced test, about 90% false-negative explanation coverage permitted 28-32% compute savings, while about 95% coverage permitted 15-23% savings. Savings were much smaller under the attack-heavy natural prevalence. These results show that operationally useful explainable IoT intrusion detection depends on predictive quality, explanation cost, local stability, workload prevalence, and selective invocation rather than detection accuracy alone.

Modern sequence models, from Transformers to State Space Models, have enabled powerful generative modeling across diverse domains, yet they are typically trained to predict what happens while treating when it happens as a secondary concern. In data-mining settings where events are associated with explicit timing information, this separation can limit temporal reasoning, anomaly detection, and faithful reconstruction of event chronology. A common strategy is to treat timing as an auxiliary signal, training a separate timing model using representations learned solely for event prediction. However, this two-stage approach implicitly assumes that representations optimized for event prediction already contain sufficient temporal structure. We introduce ChronoSSM, an autoregressive State Space Model (SSM) that jointly models events and timestamps with a shared backbone trained using combined token and temporal generation objectives. We compare the joint regime, where temporal supervision updates the backbone, with the two-stage regime, where timing is learned only using the frozen event representations. Across four domains spanning dense and partial timestamp supervision, joint training consistently makes inter-arrival information more recoverable from frozen representations without any systematic degradation in content-generation quality overall. Our results show that temporal supervision can produce more temporally informative representations without materially degrading autoregressive event modeling.

Request for comments (RFCs) are Internet standards, memorandums, and related technical documents about core Internet protocols made via and released by the Internet Engineering Task Force (IETF). In the early 1990s each RFC was required to have a section for security considerations. The present work examines these sections. According to the empirical results, (1) over 90% of the RFCs sampled have discussed security explicitly in these sections, (2) although mandatory security requirements have only seldom-if ever-been imposed. Furthermore, (3) the RFC-to-RFC reference network specific to the security consideration sections is sparse, although a few RFCs and their security consideration sections are heavily referenced. In addition, (4) the volume of references peaked during a period from circa mid-1990s to mid-2010s. Regarding the topics discussed in the sections, (5) these do not represent general security issues, such as spoofing or eavesdropping; rather, the topics mostly reflect distinct security issues specific to distinct protocols. With the exceptions of network security in general, security specifications, and routing, (6) also the longitudinal evolution of the topics is protocol-specific. As the subject matter has not been previously examined, these empirical results fill a gap in the standardization literature.

Human-Robot Collaboration (HRC) plays a vital role in dynamic, high mix, low volume industrial scenarios such as remanufacturing, which frequently face workcell rearrangements. Traditional setups are constrained by power and data cabling, restricting modularity and reconfigurations, while the selection of commercial wireless devices suitable for real-time perception and safe collaboration are limited in availability. This paper presents a highly flexible, wireless, 5G-based system that serves as a versatile experimental testbed for applications including remanufacturing, operator training, and user studies. To eliminate infrastructure barriers, the workcell integrates a novel battery-powered, multi-sensor platform prototype. Additionally, to support operator safety and system adaptability across environmental shifts, the system integrates a computer vision module for object detection and pose estimation, further augmented for robust hand recognition. Trained on synthetic and real data, the model reliably detects oriented grasping poses and human hands across varying lighting and background conditions (with an mAP@50-95 of 97.74 +- 0.10% and a mean inference time of 12.5 ms). Offloading these computationally intensive tasks to the edge via 5G, the proposed architecture contributes to resolving the bandwidth-latency trade-off. To demonstrate portability, the system was implemented in both Hungary and Norway, and was evaluated across a combination of public and private, Standalone and Non-Standalone 5G infrastructures. The performed network experiments produced results in round-trip response times down to 12 ms in case of compatible network-device pairings, suitable for safe, adaptive HRC. However, these measurements also revealed practical limitations related to interoperability in current 5G deployments that should be addressed in future works.

Networks are increasingly adopting AI as are AI applications leveraging networks. Awareness sharing between networks and AI applications promises to unlock higher levels of network utilization and application performance, but is inadequately supported in the current architecture of the Internet. In this paper, we describe a reference architecture that abstractly enables the synergistic interaction of intelligent applications and the intelligent network, via an information waist, and also supports the network intelligence services in the emerging intelligence plane in networks. We discuss the rationale for our AI-EDGE architecture, its functional requirements, and the core abstractions. We present a reference component-level design of the core abstractions to support experimentation and development on existing platforms for wireless networking (i.e., based on O-RAN cellular networks) and edge computing (i.e., based on 3GPP Edge App and ETSI MEC). Moreover, we provide representative use cases from the perspective of different types of users that demonstrate the benefits of the architecture in contexts of awareness sharing, portability, prototyping, and validation.

Autonomous robots increasingly rely on edge computing to offload computationally intensive perception tasks while maintaining real-time operation over 5G networks. However, conventional fiducial marker detection pipelines provide limited opportunities for efficient task partitioning, making them poorly suited for communication-aware edge deployment. This paper proposes a semantic split inference framework for fiducial marker processing in 5G-enabled Edge SLAM. A DeepTag-inspired convolutional neural network is partitioned between the robot and the edge server, where intermediate feature representations serve as task-oriented semantic information transmitted over the wireless link. The framework is integrated into a ROS2-based robotic architecture and characterized over a real 5G communication testbed. Experimental results demonstrate accurate keypoint estimation, illustrate the impact on downstream pose estimation, and quantify the communication–computation trade-offs associated with different split points, providing practical insights for communication-aware deployment of deep visual perception in connected robotic systems.

Among the foretold claims of the transition from 5G to 6G, Beyond-Visual-Line-of-Sight (BVLoS) drone operation has emerged as a prominent Internet-of-Robots enabler. However, safety concerns have been raised since BVLoS imposes strict requirements on performance and dependability on the technology, and requires robust regulatory frameworks. While current 5G technologies promise to meet the performance requirements in terms of throughput and latency, there is a lack of studies regarding how to achieve full reliability in practice. To address this challenge, the research community is actively working on open-source projects that allow for experimental validation in the field. Fortunately, new Open RAN (O-RAN) standards are paving the way for such approaches in an integrated, native manner. In this work, we deploy a state-of-the-art 5G O-RAN open-source BVLoS operational system, report current limitations, and address them via advanced capabilities natively available in O-RAN: Slicing. Our proposed deployment minimizes trajectory errors due to 5G link congestion and keeps latency well below the 3GPP limits defined for BVLoS operation. Finally, we discuss on the challenges ahead and the opportunities that 5G O-RAN-enabled networks may bring to BVLoS drone operation.

Quantum-classical coexistence networks (QCNs) share optical fiber between quantum and classical signals via wavelength-division multiplexing, offering a practical path to quantum communication over existing telecom infrastructure. However, co- and counter-propagating classical traffic introduce distinct depolarization noise, complicating channel characterization. We develop a tomography framework that infers per-link channel parameters of a QCN from end-to-end measurements alone. We first model each coexisting fiber by decomposing the signal evolution into photon loss, successful transmission, and three direction-dependent depolarization components. We then derive closed-form link-level estimators, and extend the approach to star-topology networks through a system of multiplicative equations across end-node pairs, together with a simple classical-signal-direction-switching protocol that resolves the remaining unknowns. On single-link experimental testbed data, we recover per-link depolarization probabilities accurately, with estimated process fidelities closely tracking the Bayesian-process-tomography baseline across multiple fiber lengths and wavelengths; residual gaps reflect the depolarization-only approximation. Absent a multi-link coexistence testbed, we validate the star-network estimators on emulated paths built from measured single-link channels. We further extend the framework in two directions: (i) a channel model that factorizes the coexisting fiber into a depolarizing-with-loss signal channel and a Raman-noise-injection channel on separate optical modes – a completely-positive, trace-preserving tensor product – whose link observables reduce exactly to our basic model; and (ii) a generalization to arbitrary topologies via a peeling algorithm (trees) and a least-squares estimator (meshes), validated by Monte-Carlo simulations on tree and cyclic-mesh networks.

Military capability is increasingly determined by software. Yet defence platforms are procured on decade-long timescales, while the software and AI models they carry must evolve in days or hours. This paper calls this mismatch the lifecycle paradox, and argues it is the central problem Software-Defined Defence (SDD) must solve. SDD rests on three dimensions: software and systems engineering (design, procurement, certification), AI engineering (sovereignty and trust of learned components), and connectivity and infrastructure engineering (timely exchange of information among sensors, AI, and operators). The proposed path to resilient SDD starts from civilian technologies, addressed through a continuous, DevOps-style loop: model-based systems engineering and simulation-based testing front-load design and verification; tactical connectivity and low-power edge execution carry that design into contested operation; continuous compliance, assurance, and variability management run as cross-cutting concerns. This loop is sustainable given capabilities already proven in automotive, manufacturing, space, and energy. The next step is validating them under adversarial or defence-certified conditions, with short-, medium-, and long-term paths to closing gaps. Closing the SDD gap while preserving civic benefits is a distributed responsibility: researchers must redirect methods toward adversarial conditions; industry must expose tooling to operational needs; policymakers must shape regulatory instruments; and defence agencies must validate results with operators. Recommendations span three horizons: a short-term baseline of adversarial testing and connectivity pilots; a medium-term pipeline of incremental certification; and a long-term validation closing the loop under operational conditions.

Deterministic networking spans heterogeneous domains. At each boundary, two domains must agree on an assume–guarantee contract: what traffic the client may inject, and the QoS the carrier will hold for it. Composing such contracts into an end-to-end guarantee is standardized, but deriving each domain's contract is not. Today they are hand-crafted, static, and over-provisioned. The difficulty rises when traffic changes and the contract must become dynamic. We present a framework that automatically synthesizes the per-domain contract for both static and dynamic classes, along with the registration the dynamic one rests on. Two reasoning modules implemented with large language models (LLMs) drive it: an agent takes the client's traffic declaration and searches the carrier's configuration mechanisms, and a handler builds the network model from a typed disclosure of the substrate. The handler calls a network-calculus kernel for the model's hard terms, and an independent oracle—a faithful simulator, testbed, or live network—which verifies each candidate and discovers what lacks an a-priori algebraic form: when a reconfiguration is safe, and the instant to apply it. We synthesized a dynamic contract for uplink 5G fronthaul over a TDM-PON, grounded against a packet-level simulator. Across six draws from two LLM families, every synthesis produced a feasible, verified contract tight to ${\sim}1.2\,\mu$s, holding a $100$-$\mu$s deadline that reactive scheduling cannot meet, at up to $3.5$ times the bandwidth efficiency of static over-provisioning. Tasked instead with computing the worst-case delay directly, the LLMs were unsound in five of six attempts—evidence for the division of labor: LLMs construct the model, formal tools hold numeric authority. The same framework, unchanged, synthesized a static 5G–TSN bridge contract on a second substrate.

Unmanned aerial vehicles (UAVs) have emerged as a promising solution for on-demand wireless coverage planning in urban environments. Existing learning-based UAV control methods, however, typically rely on continuous access to dense user-level received signal strength (RSS) measurements. Such full-observation assumptions are difficult to satisfy in real-world deployments due to the high cost and limited availability of dense wireless feedback. Sparse-feedback decision making under severe observation constraints therefore represents a fundamental challenge. To fill this gap, we propose SparsePilot, a measurement-efficient sensing-control framework that couples active wireless probing with belief-guided network control. SparsePilot formulates spatial probing as a multi-armed bandit problem over grid cells, uses upper confidence bound probing to select informative regions, and aggregates sparse RSS measurements into a coverage belief map. A deep reinforcement learning controller then uses this belief state to generate continuous UAV mobility actions, while the full wireless state remains hidden from the policy. We further provide a theoretical analysis connecting sparse probing, belief estimation error, and the sparse-feedback performance gap. Experiments across seven urban digital twins show that SparsePilot achieves superior coverage restoration performance while using only about 3.1% of the full-observation measurement budget and demonstrates strong cross-scene generalization to unseen urban-scale wireless environments.

A stacked multilayer hemispherical graphene-based transmitarray antenna operating at 250 GHz is developed to achieve wide-angle 3D beam steering. This work presents the first fully automated CST Studio Suite macro for constructing the multilayer hemispherical geometry and configuring 121 independently tunable graphene sectors. Numerical results confirm that the integration of voltage-controlled graphene sectors with FCC gold patches enables wide-angle beam steering, achieving an elevation scanning range of -78{\deg} to 78{\deg} in {\theta} and full 360{\deg} azimuthal coverage while maintaining stable radiation characteristics and broadband impedance matching (|S11| < -10 dB) with a relative bandwidth of 40%. The antenna achieves a directivity range of 11.38 - 14.72 dBi and an SLL range of -6.8 to -9.8 dB across all investigated steering directions. It also maintains high antenna efficiencies from 71% to 80% with a 5% degradation due to imperfections across the entire scanning range, making it a promising candidate in practical moving-target-tracking applications.

Foundation models are emerging as a transformative paradigm for AI-native sixth-generation (6G) wireless networks by enabling scalable, transferable, and data-efficient intelligence across diverse communication tasks. Unlike conventional deep learning models that are trained for individual applications, wireless foundation models (WFMs) learn generalized representations from large-scale heterogeneous wireless data and can be efficiently adapted to communication, sensing, localization, and network optimization tasks with minimal task-specific supervision. Despite rapid progress, current research remains fragmented across architectures, training paradigms, and application domains, with no unified survey dedicated to the design, learning, and deployment of WFMs. This survey presents a comprehensive and unified review of wireless foundation models. We first establish the fundamental concepts of WFMs and introduce a taxonomy that organizes the field according to model architectures, pre-training paradigms, and applications. We then review representative architectures, self-supervised pre-training strategies, parameter-efficient adaptation methods, datasets, benchmarks, and evaluation methodologies, highlighting their roles in enabling transferable wireless intelligence. Furthermore, we examine emerging applications spanning physical-layer signal processing, network intelligence, and cross-layer optimization, and discuss the key challenges of data availability, generalization, interpretability, efficient edge deployment, and standardization. Finally, we outline future research directions toward scalable, trustworthy, and general-purpose wireless intelligence for AI-native 6G networks. This survey provides a comprehensive reference for researchers and practitioners developing next-generation intelligent wireless systems.

In this invited talk, we demonstrate the carrier leakage suppression and power difference equalization based on semiconductor optical amplifier (SOA) for TFDMA-based coherent PON, and propose a nonlinearity compensation algorithm to deal with SOA-induced nonlinear distortion.

With the rapid growth of large language model training and generative artificial intelligence services, data center networks face severe micro-burst traffic and high concurrency. Traditional hash-based flow-level load balancing cannot sense link states, leading to hash collisions, hotspot congestion, and tail latency in multipath Clos networks. Existing packet-level schemes are constrained by stale state information, high hardware complexity, and poor adaptation to heterogeneous links. To address these issues, this paper proposes probabilistic state-proportional (PSP) dispatching, a packet-level load balancing algorithm. Using a Band-based discrete state representation, PSP replaces global sorting with local probability mapping, reducing hardware complexity while suppressing herding and oscillations caused by stale states. Experiments on a cycle-accurate simulator show that PSP is robust across port scales, bandwidth-limited paths, and fixed-flow interference. It outperforms join-the-shortest-queue (JSQ) scheduling and Random in loss rate, 99th-percentile buffer occupancy, and scalability, while remaining competitive with Top-k at lower hardware cost. PSP provides an effective balance among performance, stability, and overhead for artificial intelligence data centers.

Large language model (LLM) agents are emerging as planners for autonomous wireless network operations. Yet a task answer that is correct at proposal time can still be unsafe at execution time if supporting telemetry is stale or inconsistent. Existing benchmarks mainly evaluate task solving from fixed observations and leave support checking at execution time untested. We introduce WirelessOptBench, a benchmark for action assurance in wireless operations. It turns wireless tasks into execution state decision episodes with controlled telemetry faults and action constraints. We further develop WirelessOpsAgent, which grounds candidate actions in current evidence and repairs recoverable support failures before execution. Across three backbone evaluations with 600 episodes each, WirelessOpsAgent achieves up to 0.983 Exact Action Accuracy. On Claude Sonnet 4.6, the Unsafe APPLY Rate decreases from 82.2% to 10.3% relative to the safest baseline. We make WirelessOptBench available at https://anonymous.4open.science/r/wirelessopsbench-artifact-D969/.

Heterogeneous networks pose significant security challenges due to device diversity, fragile operating conditions, and heterogeneous firmware and service configurations. Traditional vulnerability management often relies on static scanning and severity-based prioritization, overlooking exploitation likelihood and asset context. This can delay mitigation and increase operational overhead. This paper proposes a SOAR-orchestrated vulnerability management framework integrating passive asset discovery, adaptive two-stage vulnerability assessment, context-aware risk assessment, and automated SDN-based mitigation. The detection engine progressively characterizes device attack surfaces using assessment strategies tailored to device capabilities, minimizing disruption to resource-constrained IoT assets. Risk assessment combines CVSS severity, EPSS exploitation probability, and contextual attributes to prioritize vulnerabilities by operational risk. Based on risk bands, mitigation is automatically enforced through coordinated OpenFlow and IDS policies, ranging from monitoring and selective service isolation to complete host quarantine. Experimental results demonstrate the framework's effectiveness. Adaptive two-stage assessment reduces scan time by up to 91% while identifying 71% of baseline vulnerabilities during the initial stage before selectively triggering further analysis. The context-aware risk model reduces vulnerabilities requiring immediate mitigation by approximately 75% without missing any vulnerability with verified exploitation. Compared with conventional assessment, the framework reduces assessment time for 32 physical hosts by up to 45% and enforces mitigation within milliseconds, enabling efficient and scalable vulnerability management through adaptive assessment, context-aware prioritization, and automated mitigation.

Vehicular Ad hoc Networks (VANETs) increasingly rely on federated learning (FL) to enable collaborative intelligence without sharing raw sensory data. However, most existing vehicular FL frameworks assume that all vehicles train a single global model for a common task, which limits their applicability in practical vehicular environments where vehicles may perform heterogeneous learning tasks under non-independent and identically distributed (non-IID) data, intermittent connectivity, and high mobility. To address these challenges, this paper proposes an AutoEncoder-based Reliability-Optimized Hierarchical Multi-Task Federated Learning (AERO-HMTFL) framework for dynamic multi-hop clustered VANETs. The proposed framework introduces a tri-weighted clustering metric that jointly considers vehicular mobility, shared-model similarity, and task affinity to produce mobility-stable, semantically aligned clusters. Each vehicle employs a split-model architecture comprising a shared autoencoder-based representation module and multiple task-specific heads, with only the shared autoencoder parameters exchanged while the task heads remain local. To improve robustness, cluster heads perform reliability-aware aggregation based on historical validation performance and participation frequency, while the Evolved Packet Core (EPC) conducts global shared-autoencoder fusion across clusters. Extensive simulations demonstrate that, compared with the multi-task federated learning benchmarks, AERO-HMTFL achieves up to 13% higher sustained EPC-level accuracy, exhibits more stable learning dynamics, and reduces EPC-level packet transmissions by approximately 87-97%. Under short-range connectivity, it also requires approximately 13-29% fewer communication rounds to converge.