Abstract
With the growing connectivity demands, Unmanned Aerial Vehicles (UAVs) have emerged as a prominent component in the deployment of Next Generation On-demand Wireless Networks. However, current UAV positioning solutions typically neglect the impact of Rate Adaptation (RA) algorithms or simplify its effect by considering ideal and non-implementable RA algorithms. This work proposes the Rate Adaptation aware RL-based Flying Gateway Positioning (RARL) algorithm, a positioning method for Flying Gateways that applies Deep Q-Learning, accounting for the dynamic data rate imposed by the underlying RA algorithm. The RARL algorithm aims to maximize the throughput of the flying wireless links serving one or more Flying Access Points, which in turn serve ground terminals. The performance evaluation of the RARL algorithm demonstrates that it is capable of taking into account the effect of the underlying RA algorithm and achieve the maximum throughput in all analysed static and mobile scenarios. © ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2024.

Abstract

Abstract
<p>Flying networks, composed of Unmanned Aerial Vehicles (UAVs) acting as mobile Base Stations and Access Points, have emerged to provide on-demand wireless connectivity, especially due to their positioning capability. Still, existing solutions are focused on improving aggregate network performance using a best-effort approach. This may compromise the use of multiple services with different performance requirements. Network slicing has emerged in 5G networks to address the problem, allowing to meet different Quality of Service (QoS) levels on top of a shared physical network infrastructure. However, Mobile Network Operators typically use fixed Base Stations to satisfy the requirements of different network slices, which may not be feasible due to limited resources and the dynamism of some scenarios.</p> <p>We propose an algorithm for enabling the joint placement and allocation of communications resources in Slicing-aware Flying Access and Backhaul networks – SurFABle. SurFABle allows the computation of the amount of communications resources needed, namely the number of UAVs acting as Flying Access Points and Flying Gateways, and their placement. The performance evaluation carried out by means of ns-3 simulations and an experimental testbed shows that SurFABle makes it possible to meet heterogeneous QoS levels of multiple network slices using the minimum number of UAVs.</p>

Abstract
<p>Flying networks, composed of Unmanned Aerial Vehicles (UAVs) acting as mobile Base Stations and Access Points, have emerged to provide on-demand wireless connectivity, especially due to their positioning capability. Still, existing solutions are focused on improving aggregate network performance using a best-effort approach. This may compromise the use of multiple services with different performance requirements. Network slicing has emerged in 5G networks to address the problem, allowing to meet different Quality of Service (QoS) levels on top of a shared physical network infrastructure. However, Mobile Network Operators typically use fixed Base Stations to satisfy the requirements of different network slices, which may not be feasible due to limited resources and the dynamism of some scenarios.</p> <p>We propose an algorithm for enabling the joint placement and allocation of communications resources in Slicing-aware Flying Access and Backhaul networks – SurFABle. SurFABle allows the computation of the amount of communications resources needed, namely the number of UAVs acting as Flying Access Points and Flying Gateways, and their placement. The performance evaluation carried out by means of ns-3 simulations and an experimental testbed shows that SurFABle makes it possible to meet heterogeneous QoS levels of multiple network slices using the minimum number of UAVs.</p>

Abstract
The increasing complexity of recent Wi-Fi amendments is making the use of traditional algorithms and heuristics unfeasible to address the Rate Adaptation (RA) problem. This is due to the large combination of configuration parameters along with the high variability of the wireless channel. Recently, several works have proposed the usage of Reinforcement Learning (RL) techniques to address the problem. However, the proposed solutions lack sufficient technical explanation. Also, the lack of standard frameworks enabling the reproducibility of results and the limited availability of source code, makes the fair comparison with state of the art approaches a challenge. This paper proposes a framework, named RateRL, that integrates state of the art libraries with the well-known Network Simulator 3 (ns-3) to enable the implementation and evaluation of RL-based RA algorithms. To the best of our knowledge, RateRL is the first tool available to assist researchers during the implementation, validation and evaluation phases of RL-based RA algorithms and enable the fair comparison between competing algorithms.

Abstract
Despite the trend towards ubiquitous wireless connectivity, there are scenarios where the communications infrastructure is damaged and wireless coverage is insufficient or does not exist, such as in natural disasters and temporary crowded events. Flying networks, composed of Unmanned Aerial Vehicles (UAV), have emerged as a flexible and cost-effective solution to provide on-demand wireless connectivity in these scenarios. UAVs have the capability to operate virtually everywhere, and the growing payload capacity makes them suitable platforms to carry wireless communications hardware. The state of the art in the field of flying networks is mainly focused on the optimal positioning of the flying nodes, while the wireless link parameters are configured with default values. On the other hand, current link adaptation algorithms are mainly targeting fixed or low mobility scenarios. We propose a novel rate adaptation approach for flying networks, named Trajectory Aware Rate Adaptation (TARA), which leverages the knowledge of flying nodes’ movement to predict future channel conditions and perform rate adaptation accordingly. Simulation results of 100 different trajectories show that our solution increases throughput by up to 53% and achieves an average improvement of 14%, when compared with conventional rate adaptation algorithms such as Minstrel-HT. © ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2024.