ALT Flow-based traffic classifiers trained on Ethernet data may lose accuracy when applied to Wi-Fi traffic. This paper proposes a five-stage procedure for selecting and constructing features that enable Wi-Fi flow classification using models trained only on Ethernet data. The procedure removes the transport protocol identifier, examines rate dependence, compares feature distributions and the information each feature provides for the application classes, reduces redundancy, and constructs normalized packet-size and temporal features. Ethernet and Wi-Fi traffic are simulated in ns-3, with Wi-Fi using Best Effort access category. Labelled Wi-Fi data from six development scenarios are used for feature design, while a separate scenario is reserved for final testing. The evaluation compares feature sets, examines threshold sensitivity, and analyses classification errors under different traffic conditions.

ALT Wake-up radios (WURs) reduce energy consumption by continuously monitoring the channel for a wake-up signal (WUS) while the main receiver remains asleep. Neuromorphic computing offers a promising approach to ultra-low-power WUS detection through sparse, event-driven processing. However, realizing these benefits requires spike-like inputs, which conventional orthogonal frequency-division multiplexing (OFDM) waveforms do not naturally provide. To enable neuromorphic WUS detection in OFDM-based systems, we introduce a neuromorphic wake-up signal (nWUS) that can be generated by a standard OFDM transmitter. The proposed design superposes frequency-domain vectors with linear phase progressions across the OFDM subcarriers, producing a time-domain waveform with sparse amplitude peaks at predefined positions. These peaks encode the wake-up signature in a spike-like representation that facilitates neuromorphic processing at the receiver. Building on this structure, we then propose a noncoherent

ALT Coordinated spatial reuse (Co-SR) in IEEE 802.11bn increases area throughput through simultaneous transmissions, yet the combinatorial configuration space makes real-time optimization challenging. We propose a sample-and-score approach: draw random Co-SR configurations, score each with a surrogate model, and select the best. The surrogate is trained offline and deployed without online fine-tuning or sequential exploration, yet performs close to multi-armed bandit and heuristic baselines that need multiple interaction steps or extensive measurements. On unseen topologies with 2-16 access points, it recovers 52-77% of a perfect surrogate's throughput. A perfect sample-and-score approach reaches 95% of the upper bound throughput with 8192 candidates.

ALT Human errors remain the leading cause of network outages. To prevent them researchers propose general verifiers that analyze the network behavior. Yet, their (symbolic) models struggle to accurately reflect network devices, they fail to scale to large networks, and report misbehavior, not what configuration line caused it. We attribute all three challenges to specifications that describe the intended behavior but not how operators intend to achieve it—the network's design: which protocols to run and how to combine them. We present Axiom, a language for expressing network designs, and a checker that finds every violation and the responsible commands. Operators state their design decision as rules over configuration commands. Axiom then compiles them into a single Datalog program that checks the entire network directly on its configurations, not on the state they produce. Our prototype checks a 754-router network within seconds. Ultimately, a design enforced on every keystroke could give

ALT 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 infras

ALT 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 dev

ALT Radio-frequency (RF) digital twins (DTs) enable site-specific wireless propagation prediction by explicitly reconstructing the physical environment and modeling electromagnetic interactions. Although physics-based DTs reduce reliance on exhaustive measurements, systematic bias relative to real radio data arises from environmental uncertainty, material inaccuracies, and geometric abstractions. Calibration using field measurements is therefore necessary but costly under limited sampling budgets. This paper studies active RF DT calibration, in which measurement locations are selected sequentially and in an online manner to estimate a calibration offset under strict measurement budget constraints. A physics-based RF DT pipeline is developed, integrating semantic geospatial data from OpenStreetMap, 3D modeling in Blender, and deterministic ray tracing in Sionna to capture dominant building and foliage effects. This RF DT is calibrated using path-loss measurements collected with software-def

ALT Reliable low-latency connectivity for real-time applications is a key requirement for 5G and future 6G non-terrestrial networks. Low Earth Orbit satellites enable global coverage but impose long propagation delays, rapid channel variations, and delayed feedback, which challenge conventional link adaptation algorithms designed for terrestrial networks. To address this problem, the paper proposes a Multi-Level Outer-Loop Link Adaptation (ML-OLLA) algorithm that assigns a dedicated target block error rate and an independent adaptation process for each transmission attempt. With ML-OLLA, early transmission attempts use higher-rate modulation and coding schemes (MCSs), while later ones use more robust MCSs. The core contribution of this work is a low-complexity data-driven parameter selection method that determines ML-OLLA parameters. Numerical results obtained with ns-3 show that the proposed ML-OLLA algorithm increases the system capacity by up to four times and reduces the minimum suppor

ALT Satellite communication systems are increasingly relied upon for connectivity in remote areas and are expected to play a pivotal role in 6G networks, operating under high round-trip times and packet loss where forward error correction is essential. This work evaluates Reed-Solomon (RS) coding, Random Linear Network Coding (RLNC), and a combined RS+RLNC hybrid over a three-hop satellite channel whose loss statistics are derived from orbital geometry and link-budget calculations rather than assumed, comparing RS and RLNC at matched code rates of 0.800. The central finding is the bridging property of RLNC: every RS code rate collapses above a crossover threshold p, while RLNC operates continuously through all failure regions with overhead growing as 1/(1-p). At rate 0.800, p≈ 0.21. Under the derived satcom channel with mean burst duration 166 minutes, RS(255,204) is impractical despite an average loss rate of 1%, while RLNC requires 15.5 Mbit to recover all 1000 packets. An RS+RLNC hybrid

ALT We evaluate ErouVe, a vehicular eco-routing protocol in which roadside units (RSUs) collect per-segment travel-time and CO2 reports from passing vehicles and answer route requests with the lowest-cost alternative, across a range of road architectures and traffic scenarios. We conduct the evaluation with a working implementation of the protocol inside Veins, adapted to drive SUMO's own router rather than a hand-rolled shortest-path search, on a network offering a short, signal-controlled route and a longer, signal-free bypass, under two traffic scenarios. This evaluation reveals clear strengths and weaknesses of the protocol. Under light, uncongested traffic, ErouVe's fleet-wide effect is light. Under traffic dense enough to stress the signalized route's throughput and produce a real, growing queue, the same protocol succeeds a medium fleet-wide CO2 reduction, with diverted vehicles individually saving even more fuels. We use these findings to propose three targeted corrective methods;

ALT Autonomous IoT systems rely on distributed sensing, but sensor faults and communication loss can leave multichannel evidence incomplete or unreliable. Their agents must therefore classify measurements, assess evidence sufficiency, select a sensor to reacquire, and hand off unsafe decisions. We formulate counterfactual sensing: a degraded window defines the factual state, each candidate restoration defines a controlled alternative, and a pre-request utility model estimates loss reduction. Physics-Guided Invariant-Kinematic Fusion (PGIK-Fusion) constructs class evidence, while calibrated risk and cost-sensitive utility select acceptance, sensor request, or handoff from factual information. On the Logistic Activity Recognition Challenge dataset, PGIK-Fusion achieves 0.768 accuracy and a macro-averaged F1 score (Macro-F1) of 0.696, exceeding extreme gradient boosting (XGBoost)–one-dimensional convolutional neural network (1D-CNN) fusion by 2.49 and 2.00 percentage points, respectively. Acr

ALT Lightning routing nodes lend their channel balance for a posted fee. Operators' tools move that fee with the balance around a hand-set level, and which part of the fee drives revenue is unclear. We present Trim, which models a channel as a two-sided inventory with costly refills. Its optimal fee is a level, set by demand and replenishment, plus a balance skew, the shadow price of liquidity. The level is first order: no fee rule beats the ceiling demand and replenishment set, and on exactly solved channels the best flat fee comes within 1.6% of the optimum at the median, whereas a level off by a factor of two loses tens of percent. The skew is second-order insurance: it adds at most what the flow-balancing flat fee loses to refused forwards. So the level should be chosen: Trim's rule traces the revenue–success frontier, posts one level on every channel, and adds a skew only where refills stay frequent and costly. On a 2026 snapshot with synthetic payments, no tuned tool beats that front

ALT The proliferation of orbital sensing data and the real-time demands of emerging global services are pushing low Earth orbit (LEO) satellite networks from bent-pipe relays toward intelligent onboard processing. This shift confronts a fundamental tension, where modern artificial intelligence (AI) training paradigms require intensive computation, abundant memory, and stable connectivity, all of which are scarce under the dynamic topologies, intermittent links, and severe size, weight, and power (SWaP) constraints of satellite networks. Addressing this tension demands rethinking AI workflows, from training and inference to the emerging deployment of large language models (LLMs), under a constraint-aware design philosophy. To the best of our knowledge, this paper provides the first survey that jointly covers all three, whereas prior surveys examine these aspects in isolation. We begin by identifying the deployment challenge of satellite intelligence (SI) and deriving design principles for S

ALT We study the vulnerability of beam allocation approaches in large low-Earth-orbit (LEO) satellite constellations to adversarial demand inflation resulting in denial-of-service attacks. We consider an attack model in which an adversary places (injects) additional terminals and evaluate these attacks against greedy and max-min-fair beam allocation algorithms, each combined with either equal or demand-proportional intra-cell capacity sharing. Vulnerability is measured using mean demand satisfaction, coverage, and the fraction of legitimate users receiving at least a threshold fraction of their requested capacity under several attack heuristics. There is a trade-off for the system between robustness and performance, meaning the algorithm with the most vulnerability to the attacks (greedy-proportional) has the highest performance before the attacks. Demand-proportional sharing increases the fraction of under-served users up to 34% under both allocation algorithms, whereas equal sharing limi

ALT Emerging 6G control planes would compose Large Language Model (LLM) agents that exchange interpreted conclusions, so hallucinations can propagate even over error-free transport. Recent architectures audit each message locally against the sender's observation mask, but isolated audits miss collective behavior. Modeling the agent society as a cellular sheaf, we establish three laws valid on arbitrary topologies. First, the composition law: network-wide divergence exceeds the sum of per-agent audit scores by exactly their hidden total correlation. This blind spot masks up to 23% of joint divergence and, because the declared signal cancels in the cognitive signal-to-noise ratio (SNR), overstates it by 1.14 dB purely through topology; the resulting trust inflation preserves valid consensus states but slows convergence. Second, the scaling law: reconciliation decouples across metric counters, so the worst-connected dimension sets the pace. Consistency time grows for a society size n as Ω(n²/

ALT Inferring directional handover traffic from aggregate mobility observations remains challenging because population density evolution does not fully describe the movement of individual users across cell boundaries. This paper develops a kinetic framework for geometry-induced serving-region crossings in nonstationary cellular networks, connecting boundary-normal velocity statistics with fluid spatiotemporal stochastic geometry (F-STSG) for density-based transport reconstruction. The framework distinguishes signed net population transfer from gross bidirectional crossings and reveals two information limits: density evolution does not uniquely determine physical pairwise transport, while first-order transport alone cannot resolve counter-moving crossings. We establish exact recovery conditions for potential transport and develop coherent and Gaussian mobility closures for estimating directional crossing rates. Sharp moment-constrained bounds further characterize the remaining uncertainty u

ALT The Invisible Internet Project (I2P) is a peer-to-peer anonymity network whose routing and peer-selection mechanics underlie a growing family of state-sponsored covert relay architectures. Studying these mechanics demands a controlled, reproducible environment. We present Garlic-in-a-Box, an installable emulator that deploys a fully isolated network of unmodified I2P Java routers on a single host or cluster of hosts. Each router runs in its own Linux network namespace. A filesystem bootstrap removes the dependency on signed reseed servers, and synthetic geographic diversity activates the same location-aware peer-selection code paths present on the live network. A fifty-router deployment across five geographic locations stabilises in about twenty-five minutes and uses roughly 21 GB of memory. To demonstrate the platform's value, we model I2P peer selection as a two-stage process and conduct a reputation attack. Across five independent trials, the attack promotes the adversary into the v

ALT This paper studies a reconfigurable intelligent surface (RIS)-assisted indoor architecture for extended reality (XR) applications, where multiple access points (APs) simultaneously serve multiple users over a shared frequency channel under a centralized AP controller. We formulate a non-convex sum-rate maximization problem with coupled AP precoders and RIS phase shifts, and develop a centralized alternating optimization (AO) framework for joint design. We rigorously prove that the proposed AO guarantees monotonic improvement of the sum rate that converges to a coordinate-wise stationary point, despite the non-convexity of the resulting subproblems. Although AO provides reliable performance, its iterative nature limits real-time applicability as the system dimension grows. To overcome this limitation, we propose a supervised learning-assisted approach that leverages AO-generated solutions to significantly accelerate convergence. Simulation results demonstrate that the proposed framework

ALT Accurate position and distance information provided by Ultra-Wideband (UWB) can enhance a wide range of applications. However, its receive-mode power consumption makes continuous channel monitoring impractical for energy-constrained devices. Consequently, UWB systems often rely on Bluetooth Low Energy (BLE) to discover peers and establish sessions before ranging begins. Although both technologies have been studied in isolation, an framework capturing the latency and energy consumption of the complete workflow is still lacking. To address this gap, we develop a unified analytical model for BLE-assisted UWB systems, from device-to-device ranging to infrastructure-based localization. The model includes closed-form expressions for discovery, parameter exchange, and ranging, and evaluates the resulting latency and energy consumption. Evaluation of three representative BLE configurations shows that the scanner consumes 28-57x more energy per discovery than the advertiser. In addition, the 99

ALT Effective collaboration among resource-constrained mobile intelligent machines, such as Unmanned Aerial Vehicles (UAVs), is essential for the completion of complex tasks. However, concurrent task demands, limited distributed resources, and dynamic collaborator availabilities make it challenging to satisfy task-specific completion goals in diverse collaborative systems. To address these challenges simultaneously, we propose a new framework of trusted collaborator group formation and the supporting resource allocation strategy for concurrent task orchestration. Specifically, a collaborative task is decomposed into subtasks subject to dynamic resource availability and inter-subtask dependencies. A task utility model is developed for collaborator group evaluation support subtask allocation according to task completion goals and unified value-risk analysis. Based on this model, concurrent task orchestration is formulated as a long-term utility maximization problem under α-fairness. To solve