Search for: All records

Millimeter-wave (mmWave) links are increasingly utilized in wireless x-haul transport to meet growing service demands. However, the inherent susceptibility of mmWave links to weather-related attenuation creates uncertainty about future network capacity which can significantly affect Quality of Service (QoS). This creates a critical challenge: how to make admission control decisions for slices with QoS requirements, balancing acceptance rewards against the risk of future QoS-violation penalties due to capacity uncertainty? To address this, we develop a proactive slice admission control framework that tightly integrates: (i) a predictor that leverages historical link measurements to forecast short-term attenuation and quantify uncertainty; and (ii) an admission control algorithm that incorporates both the predictions and uncertainties to maximize rewards and minimize QoS-violation penalties. We compare our framework against baseline, state-of-the-art, and idealized oracle algorithms using real-world mmWave x-haul data and residential traffic traces. Simulations suggest that our framework can achieve revenues that are 250% larger than baseline algorithms and 75% larger than state-of-the-art algorithms. 

In this work, we present an unmanned aerial vehicle (UAV) wireless dataset collected as part of the AERPAW Autonomous Aerial Data Mule (AADM) challenge, organized by the NSF Aerial Experimentation and Research Platform for Advanced Wireless (AERPAW) project. The AADM challenge was the second competition in which an autonomous UAV acted as a data mule, where the UAV downloaded data from multiple base stations (BSs) in a dynamic wireless environment. Participating teams designed flight control and decision-making algorithms for choosing which BSs to communicate with and how to plan flight trajectories to maximize data download within a mission completion time. The competition was conducted in two stages: Stage 1 involved development and experimentation using a digital twin (DT) environment, and in Stage 2, the final test run was conducted on the outdoor testbed. The total score for each team was compiled from both stages. The resulting dataset includes link quality and data download measurements, both in DT and physical environments. Along with the USRP measurements used in the contest, the dataset also includes UAV telemetry, Keysight RF sensors position estimates, link quality measurements from LoRa receivers, and Fortem radar measurements. It supports reproducible research on autonomous UAV networking, multi-cell association and scheduling, air-to-ground propagation modeling, DT-to-real-world transfer learning, and integrated sensing and communication, which serves as a benchmark for future autonomous wireless experimentation. 

Edge-cloud systems are increasingly deployed to meet the demands of real-time applications by processing latencysensitive tasks at the edge site, near the end-devices. When load exceeds capacity, offloading of requests to the cloud allows the system to balance the spike. As their popularity increases, edge servers become an attractive target for attackers whose goal is to degrade system performance. This paper investigates worst-case (i.e., damage-maximizing) attacks on reactive edge-cloud systems, focusing on two key performance metrics: expected end-to-end latency and the probability of violating service-level agreements (SLAs). We use a general modeling framework based on two layers of computation and analyze how adversarial removal of edge servers affects delay under reactive offloading mitigation. We adopt common queueing models and prove that the system’s performance remain convex in the attack size, even when accounting for reactive offloading by the edge. This enables a characterization of worst-case policies as concentrated attacks, targeting only a few critical sites to maximize damage, yielding greater performance degradation than spreading efforts across the network. Simulation results validate the analysis and demonstrate that the identified worst-case attack strategies can increase damage by up to 40% using the same attack resources. 

We consider a decentralized wireless network with several source-destination pairs sharing a limited number of orthogonal frequency bands. Sources learn to adapt their transmissions (specifically, their band selection strategy) over time, in a decentralized manner, without sharing information with each other. Sources can only observe the outcome of their own transmissions (i.e., success or collision), having no prior knowledge of the network size or of the transmission strategy of other sources. The goal of each source is to maximize their own throughput while striving for network-wide fairness. We propose a novel fully decentralized Reinforcement Learning (RL)-based solution that achieves fairness without coordination. The proposed Fair Share RL (FSRL) solution combines: (i) state augmentation with a semi-adaptive time reference; (ii) an architecture that leverages risk control and time difference likelihood; and (iii) a fairnessdriven reward structure. We evaluate FSRL in several network settings. Simulation results suggest that, when we compare FSRL with a common baseline RL algorithm from the literature, FSRL can be up to 89.0% fairer (as measured by Jain’s fairness index) in stringent settings with several sources and a single frequency band, and 48.1% fairer on average.