Unmanned aerial vehicles (UAVs) are envisioned to provide diverse services from the air. The service quality may rely on the wireless performance which is affected by the UAV’s position. In this paper, we focus on the UAV placement problem in the Internet of Vehicles, where the UAV is deployed to monitor the road traffic and sends the monitored videos to vehicles. The studied problem is formulated as video resolution maximization by optimizing over the UAV’s position. Moreover, we take into account the maximal transmission delay and impose a probabilistic constraint. To solve the formulated problem, we first leverage the techniques in extreme value theory (EVT) and Gaussian process regression (GPR) to characterize the influence of the UAV’s position on the delay performance. Based on this characterization, we subsequently propose a proactive resolution selection and UAV placement approach, which adaptively places the UAV according to the geographic distribution of vehicles. Numerical results justify the joint usage of EVT and GPR for maximal delay characterization. Through investigating the maximal transmission delay, the proposed approach nearly achieves the optimal performance when vehicles are evenly distributed, and reduces 10% and 19% of the 999-th 1000-quantile over two baselines when vehicles are biased distributed.

Recent years have envisioned the widespread adoption of machine learning (ML) in unmanned aerial vehicle (UAV) swarms for task execution. However, it is hard for the traditional centralized ML approaches to be applied in UAV swarms due to the large latency, communication cost, and privacy disclosure when transmitting the raw data. As an alternative, over-the-air computation (AirComp)-enabled federated learning (FL) is expected as a communication-efficient solution by harnessing the interference. However, the benefit of AirComp is at the cost of compromised training performance due to the channel distortion caused by the fading channel and noise and straggler issues resulting from the aligned parameters. In addition, the limited energy budget and dynamic environment incorporating the mobility characteristic of UAVs and time-varying channel conditions make these issues more complex. To solve problems aforementioned, this work proposes an energy-and-communication-efficient device scheduling scheme for AirComp-enabled FL system in the UAV swarms. Specifically, we first derive the optimality gap to characterize the impact of channel distortion and device selection on training performance. Then based on this result, we formulate an optimization problem to minimize the optimality gap by scheduling an appropriate number of competent following UAVs in each round, considering the transmission and computation energy consumption as well. Simulation results validate that the proposed scheme can achieve superior training performance in terms of test accuracy compared with baselines, and shows robustness with the increasing scale of UAV swarm.

Long range (LoRa) is one of the most popular technologies for low-power wide area networks. It offers long-range communication with a low energy consumption, which makes it ideal for many applications in the Internet of Things. The performance of LoRa networks depends on the communication parameters used by individual nodes. Several works have proposed different solutions, typically running on a central network server, to select these parameters. However, existing approaches have not addressed the need to (re-)assign parameters when channel conditions suddenly vary due to additional traffic, changes in the weather or the presence of obstacles. Moreover, allocation strategies that require a central entity to decide communication parameters do not scale due to the large number of configuration packets that must be sent to the nodes. To address these issues, this article proposesNoReL, a distributed game-theoretic approach that allows nodes to autonomously update their parameters and maximize their packet delivery ratio.NoReLis based on a stochastic variant of no-regret learning, which is proven to reach an$\epsilon$-coarse correlated equilibrium in LoRa networks. Extensive simulations show thatNoReLachieves a higher delivery ratio than the state of the art in both static and dynamic environments, with an improvement up to 12%.

Real-time environment monitoring is a key application in Industrial Internet of Things, where sensors proactively collect and transmit environmental data to the controller. However, due to limited wireless resources, keeping sensors’ sampled data fresh at the controller is critical. This work aims to investigate the trade-off between the sensor’s data-sampling frequency and long-term data transmission energy consumption while maintaining information freshness. Leveraging the entropic risk measure (ERM), we jointly minimize the global transmission energy’s mean and variance subject to probabilistic constraints on information freshness. Furthermore, while jointly saving the model training energy, we adopt the federated learning (FL) paradigm and propose an FL-based two-stage iterative optimization framework to optimize the aforementioned objective. Specifically, we iteratively learn the sampling frequency via Bayesian optimization and minimize the long-term ERM of the global energy consumption via Lyapunov optimization. Numerical results show that the proposed FL-based scheme saves substantial executing energy with less performance loss. Quantitatively, compared with the centralized learning baseline, the proposed FL-based framework saves up to 69% model training energy at the expense of a mere increased objective outcome, i.e., 6.3% in the global data transmission energy consumption ($9.936\times 10^{-5}$in ERM) under 0.4% bias from the global optimal data-sampling frequency.

This work studies a real-time environment monitoring scenario in the industrial Internet of things, where wireless sensors proactively collect environmental data and transmit it to the controller. We adopt the notion of risk-sensitivity in financial mathematics as the objective to jointly minimize the mean, variance, and other higher-order statistics of the network energy consumption subject to the constraints on the age of information (AoI) threshold violation probability and the AoI exceedances over a pre-defined threshold. We characterize the extreme AoI staleness using results in extreme value theory and propose a distributed power allocation approach by weaving in together principles of Lyapunov optimization and federated learning (FL). Simulation results demonstrate that the proposed FL-based distributed solution is on par with the centralized baseline while consuming 28.50% less system energy and outperforms the other baselines.

While information delivery in industrial Internet of things demands reliability and latency guarantees, the freshness of the controller’s available information, measured by the age of information (AoI), is paramount for high-performing industrial automation. The problem in this work is cast as a sensor’s transmit power minimization subject to the peak-Aol requirement and a probabilistic constraint on queuing latency. We further characterize the tail behavior of the latency by a generalized Pareto distribution (GPD) for solving the power allocation problem through Lyapunov optimization. As each sensor utilizes its own data to locally train the GPD model, we incorporate federated learning and propose a local-model selection approach which accounts for correlation among the sensor’s training data. Numerical results show the tradeoff between the transmit power, peak AoI, and delay’s tail distribution. Furthermore, we verify the superiority of the proposed correlation-aware approach for selecting the local models in federated learning over an existing baseline.

While the notion of age of information (AoI) has recently been proposed for analyzing ultra-reliable low-latency communications (URLLC), most of the existing works have focused on the average AoI measure. Designing a wireless network based on average AoI will fail to characterize the performance of URLLC systems, as it cannot account for extreme AoI events, occurring with very low probabilities. In contrast, this paper goes beyond the average AoI to improve URLLC in a vehicular communication network by characterizing and controlling the AoI tail distribution. In particular, the transmission power minimization problem is studied under stringent URLLC constraints in terms of probabilistic AoI for both deterministic and Markovian traffic arrivals. Accordingly, an efficient novel mapping between AoI and queue-related distributions is proposed. Subsequently, extreme value theory (EVT) and Lyapunov optimization techniques are adopted to formulate and solve the problem considering both long and short packets transmissions. Simulation results show over a two-fold improvement, in shortening the AoI distribution tail, versus a baseline that models the maximum queue length distribution, in addition to a tradeoff between arrival rate and AoI.

Edge computing is an emerging concept based on distributed computing, storage, and control services closer to end network nodes. Edge computing lies at the heart of the fifth-generation (5G) wireless systems and beyond. While the current state-of-the-art networks communicate, compute, and process data in a centralized manner (at the cloud), for latency and compute-centric applications, both radio access and computational resources must be brought closer to the edge, harnessing the availability of computing and storage-enabled small cell base stations in proximity to the end devices. Furthermore, the network infrastructure must enable a distributed edge decision-making service that learns to adapt to the network dynamics with minimal latency and optimize network deployment and operation accordingly. This paper will provide a fresh look to the concept of edge computing by first discussing the applications that the network edge must provide, with a special emphasis on the ensuing challenges in enabling ultrareliable and low-latency edge computing services for mission-critical applications such as virtual reality (VR), vehicle-to-everything (V2X), edge artificial intelligence (AI), and so on. Furthermore, several case studies where the edge is key are explored followed by insights and prospect for future work.

To overcome devices' limitations in performing computation-intense applications, mobile edge computing (MEC) enables users to offload tasks to proximal MEC servers for faster task computation. However, the current MEC system design is based on average-based metrics, which fails to account for the ultra-reliable low-latency requirements in mission-critical applications. To tackle this, this paper proposes a new system design, where probabilistic and statistical constraints are imposed on task queue lengths, by applying extreme value theory. The aim is to minimize users' power consumption while trading off the allocated resources for local computation and task offloading. Due to wireless channel dynamics, users are reassociated to MEC servers in order to offload tasks using higher rates or accessing proximal servers. In this regard, a user-server association policy is proposed, taking into account the channel quality as well as the servers' computation capabilities and workloads. By marrying tools from Lyapunov optimization and matching theory, a two-timescale mechanism is proposed, where a user-server association is solved in the long timescale, while a dynamic task offloading and resource allocation policy are executed in the short timescale. The simulation results corroborate the effectiveness of the proposed approach by guaranteeing highly reliable task computation and lower delay performance, compared to several baselines.

While the notion of age of information (AoI) has recently emerged as an important concept for analyzing ultra-reliable low-latency communications (URLLC), the majority of the existing works have focused on the average AoI measure. However, an average AoI based design falls short in properly characterizing the performance of URLLC systems as it cannot account for extreme events that occur with very low probabilities. In contrast, in this paper, the main objective is to go beyond the traditional notion of average AoI by characterizing and optimizing a URLLC system while capturing the AoI tail distribution. In particular, the problem of vehicles' power minimization while ensuring stringent latency and reliability constraints in terms of probabilistic AoI is studied. To this end, a novel and efficient mapping between both AoI and queue length distributions is proposed. Subsequently, extreme value theory (EVT) and Lyapunov optimization techniques are adopted to formulate and solve the problem. Simulation results shows a nearly two-fold improvement in terms of shortening the tail of the AoI distribution compared to a baseline whose design is based on the maximum queue length among vehicles, when the number of vehicular user equipment (VUE) pairs is 80. The results also show that this performance gain increases significantly as the number of VUE pairs increases.

We investigate the problem of multi-hop scheduling in self-backhauled millimeter wave (mmWave) networks. Owing to the high path loss and blockage of mmWave links, multi-hop paths/routes between the macro base station and the intended users via full-duplex small cells need to be carefully selected. This paper addresses the fundamental question: “how to select the best paths and how to allocate rates over these paths subject to latency constraints?” To answer this question, we propose a new system design, which factors in mmWave-specific channel variations and network dynamics. The problem is cast as a network utility maximization subject to a bounded delay constraint and network stability. The studied problem is decoupled into: (i) a path/route selection and (ii) rate allocation, whereby learning the best paths is done by means of a reinforcement learning algorithm, and the rate allocation is solved by applying the successive convex approximation method. Via numerical results, our approach ensures reliable communication with a guaranteed probability of 99.9999%, and reduces latency by 50.64% and 92.9% as compared to baselines.

Software-defined networking (SDN) provides an agile and programmable way to optimize radio access networks via a control-data plane separation. Nevertheless, reaping the benefits of wireless SDN hinges on making optimal use of the limited wireless fronthaul capacity. In this paper, the problem of fronthaul-aware resource allocation and user scheduling is studied. To this end, a two-timescale fronthaul-aware SDN control mechanism is proposed in which the controller maximizes the time-averaged network throughput by enforcing a coarse correlated equilibrium in the long timescale. Subsequently, leveraging the controller's recommendations, each base station schedules its users using Lyapunov stochastic optimization in the short timescale, i.e., at each time slot. Simulation results show that significant network throughput enhancements and up to 40% latency reduction are achieved with the aid of the SDN controller. Moreover, the gains are more pronounced for denser network deployments.

In practical implementations of single-antenna full-duplex (FD) radios, the imperfect isolation between the transmit (TX) and receive (RX) ports of the circulator causes the leakage of a strong self-interference (SI) component. This issue reduces both the spectral and energy efficiency of the device. State-of-the-art SI cancellation (SIC) solutions mitigate this problem, however they also constrain the maximum TX power of the FD radio. To address these issues and restrictions, we propose an energy recycling FD architecture that improves both the SIC capability and the spectral/energy efficiency of FD devices by means of a suitable radio frequency (RF) energy harvesting. The benefits brought by such solution are analyzed in an uplink (UL) scenario where two FD access points (APs), operating according to the proposed FD architecture, exchange signaling messages via a wireless link while communicating with two half-duplex (HD) mobile users (MUs). Our findings highlight non-negligible performance enhancements as compared to state-of-the-art approaches. Specifically, the proposed architecture is shown to yield a rate enhancement up to 29% for both UL transmission and signaling, and the recycling of up to 50% of the wasted energy at the circulator.

In this work, a novel energy-recycling single-antenna full-duplex (FD) radio is designed, in which a new three-port element including a power divider and an energy harvester is added between the circulator and the receiver (RX) chain. The presence of this new element brings advantages over the state of the art in terms of both spectral efficiency and energy consumption. In particular, it provides the means of performing both an arbitrary attenuation of the incoming signal, which in turn increases the effectiveness of the state-of-the-art self-interference cancellation strategies subsequently adopted in the RX chain, and the recycling of a non-negligible portion of the energy leaked through the nonideal circulator. The performance of this architecture is analyzed in a practically relevant four-node scenario in which two nodes operate in FD and two nodes in half-duplex (HD). Analytical approximations are derived for both the achievable rates of the transmissions performed by the FD and HD radios and the energy recycled by the FD radios. The accuracy of these derivations is confirmed by numerical simulations. Quantitatively, achievable rate gains up to 40% over the state-of-the-art alternatives, in the considered scenario, are highlighted. Furthermore, up to 50% of the leaked energy at the circulator, i.e., 5% of the energy of the transmitted signal, can be recycled.

In this work, we consider a multiple-input single-output system in which an access point (AP) performs a simultaneous wireless information and power transfer (SWIPT) to serve a user terminal (UT) that is not equipped with external power supply. To assess the efficacy of the SWIPT, we target a practically relevant scenario characterized by imperfect channel state information (CSI) at the transmitter, the presence of penalties associated to the CSI acquisition procedures, and non-zero power consumption for the operations performed by the UT, such as CSI estimation, uplink signaling and data decoding. We analyze three different cases for the CSI knowledge at the AP: no CSI, and imperfect CSI in case of time-division duplexing and frequency-division duplexing communications. Closed-form representations of the ergodic downlink rate and both the energy shortage and data outage probability are derived for the three cases. Additionally, analytic expressions for the ergodically optimal duration of power transfer and channel estimation/feedback phases are provided. Our numerical findings verify the correctness of our derivations, and also show the importance and benefits of CSI knowledge at the AP in SWIPT systems, albeit imperfect and acquired at the expense of the time available for the information transfer.

Mobile devices or sensor nodes are usually energy-constrained, and in some scenarios it is inconvenient or impractical to charge or replace batteries. To tackle this problem, the idea of transferring power to mobile devices wirelessly via radio frequency signals has recently gained much attention. In this paper, we consider a point-to-point communication system in which the transferred power is used for the receiver to feedback the quantized channel state information (CSI) to the transmitter, and then the transmitter utilizes the CSI to beamform the signals. Two power and information transfer architectures are considered: time-switching and power splitting. We derive bounds of the average achievable rates under the fading channel.

Mobile devices are usually energy-constrained. In order to avoid exhausting energy and lose the network connection, the idea of transferring power to mobile devices wirelessly via radio signals has recently gather much attention. In this paper, we consider the scenario in a point-to-point communication system that the transferred power is used for the receiver to feedback the quantized channel state information (CSI) to the transmitter. The transmitter then utilizes the CSI to beamform the signals. Although feedbacking more bits yields better CSI, it requires more power and a larger portion of time spent on the wireless power transfer, affecting the overall achievable rate. We derive bounds of the average achievable rate of the forward channel and investigate its relation to the average transmission power for wireless power transfer and the quantization bit number.