Searcharxiv⌕ Search

arXiv subjects

Manuel Ricardo

Publications and source records attributed to Manuel Ricardo.

28 records · Page 2Linked to original sources

Traffic-Aware UAV Placement Using a Generalizable Deep Reinforcement Learning Methodology

Unmanned Aerial Vehicles (UAVs) acting as Flying Access Points (FAPs) are being used to provide on-demand wireless connectivity in extreme scenarios. Despite ongoing research, the optimization of UAVs' positions according to dynamic users' traffic demands remains challenging. We propose the Traffic-aware UAV Placement Algorithm (TUPA), which positions a UAV acting as FAP according to the users' traffic demands, in order to maximize the network utility. Using a DRL approach enables the FAP to autonomously learn and adapt to dynamic conditions and requirements of networking scenarios. Moreover, the proposed DRL methodology allows TUPA to generalize knowledge acquired during training to unknown combinations of users' positions and traffic demands, with no additional training. TUPA is trained and evaluated using network simulator ns-3 and ns3-gym framework. The results demonstrate that TUPA increases the network utility, compared to baseline solutions, increasing the average network utility up to 4x in scenarios with heterogeneous traffic demands.

cs.NI↗

Energy-aware Relay Positioning in Flying Networks

The ability to move and hover has made rotary-wing Unmanned Aerial Vehicles (UAVs) suitable platforms to act as Flying Communications Relays (FCR), aiming at providing on-demand, temporary wireless connectivity when there is no network infrastructure available or a need to reinforce the capacity of existing networks. However, since UAVs rely on their on-board batteries, which can be drained quickly, they typically need to land frequently for recharging or replacing them, limiting their endurance and the flying network availability. The problem is exacerbated when a single FCR UAV is used. The FCR UAV energy is used for two main tasks: communications and propulsion. The literature has been focused on optimizing both the flying network performance and energy-efficiency from the communications point of view, overlooking the energy spent for the UAV propulsion. Yet, the energy spent for communications is typically negligible when compared with the energy spent for the UAV propulsion. In this article we propose Energy-aware RElay Positioning (EREP), an algorithm for positioning the FCR taking into account the energy spent for the UAV propulsion. Building upon the conclusion that hovering is not the most energy-efficient state, EREP defines the trajectory and speed that minimize the energy spent by the FCR UAV on propulsion, without compromising in practice the Quality of Service offered by the flying network. The EREP algorithm is evaluated using simulations. The obtained results show gains up to 26% in the FCR UAV endurance for negligible throughput and delay degradation.

cs.NI↗

Placement and Allocation of Communications Resources in Slicing-aware Flying Networks

Network slicing emerged in 5G networks as a key component to enable the use of multiple services with different performance requirements on top of a shared physical network infrastructure. A major challenge lies on ensuring wireless coverage and enough communications resources to meet the target Quality of Service (QoS) levels demanded by these services, including throughput and delay guarantees. The challenge is exacerbated in temporary events, such as disaster management scenarios and outdoor festivities, where the existing wireless infrastructures may collapse, fail to provide sufficient wireless coverage, or lack the required communications resources. Flying networks, composed of Unmanned Aerial Vehicles (UAVs), emerged as a solution to provide on-demand wireless coverage and communications resources anywhere, anytime. However, existing solutions mostly rely on best-effort networks. The main contribution of this paper is SLICER, an algorithm enabling the placement and allocation of communications resources in slicing-aware flying networks. The evaluation carried out by means of ns-3 simulations shows SLICER can meet the targeted QoS levels, while using the minimum amount of communications resources.

cs.NI↗

A Fast Gateway Placement Algorithm for Flying Networks

The ability to operate anywhere, anytime, as well as their capability to hover and carry cargo on board make Unmanned Aerial Vehicles (UAVs) suitable platforms to act as Flying Gateways (FGWs) to the Internet. The problem is the optimal placement of the FGWs within the flying network, such that the Quality of Service (QoS) offered is maximized. The literature has been focused on optimizing the placement of the Flying Access Points (FAPs), which establish high-capacity small cells to serve the users on the ground, overlooking the backhaul network design, including the FGW placement. The FGW placement problem is exacerbated in highly dynamic flying networks, where the dynamic traffic demand and the movements of the users may induce frequent changes in the placement of the FAPs. The main contribution of this paper is a fast gateway placement (F-GWP) algorithm for flying networks that determines the optimal position of a FGW. With F-GWP, backhaul communications paths with high enough capacity are established between the FAPs and the FGW, in order to accommodate the traffic demand of the users on the ground. Simulation and experimental results show F-GWP is two orders of magnitude faster than its state of the art counterpart, while ensuring the same flying network performance.

cs.NI↗

Traffic-aware Gateway Placement for High-capacity Flying Networks

The ability to operate virtually anywhere and carry payload makes Unmanned Aerial Vehicles (UAVs) perfect platforms to carry communications nodes, including Wi-Fi Access Points (APs) and cellular Base Stations (BSs). This is paving the way to the deployment of flying networks that enable communications to ground users on demand. Still, flying networks impose significant challenges in order to meet the Quality of Experience expectations. State of the art works addressed these challenges, but have been focused on routing and the placement of the UAVs as APs and BSs serving the ground users, overlooking the backhaul network design. The main contribution of this paper is a centralized traffic-aware Gateway UAV Placement (GWP) algorithm for flying networks with controlled topology. GWP takes advantage of the knowledge of the offered traffic and the future topologies of the flying network to enable backhaul communications paths with high enough capacity. The performance achieved using the GWP algorithm is evaluated using ns-3 simulations. The obtained results demonstrate significant gains regarding aggregate throughput and delay.

cs.NI↗

Joint Traffic-Aware UAV Placement and Predictive Routing for Aerial Networks

Aerial networks, composed of Unmanned Aerial Vehicles (UAVs) acting as Wi-Fi access points or cellular base stations, are emerging as an interesting solution to provide on-demand wireless connectivity to users, when there is no network infrastructure available, or to enhance the network capacity. This article proposes a traffic-aware topology control solution for aerial networks that holistically combines the placement of UAVs with a predictive and centralized routing protocol. The synergy created by the combination of the UAV placement and routing solutions allows the aerial network to seamlessly update its topology according to the users' traffic demand, whilst minimizing the disruption caused by the movement of the UAVs. As a result, the Quality of Service (QoS) provided to the users is improved. The components of the proposed solution are described and evaluated individually in this article by means of simulation and an experimental testbed. The results show that all the components improve the QoS provided to the users when compared to the corresponding baseline solutions.

cs.NI↗

On the Reproduction of Real Wireless Channel Occupancy in ns-3

In wireless networking R&D we typically depend on simulation and experimentation to evaluate and validate new networking solutions. While simulations allow full control over the scenario conditions, real-world experiments are influenced by external random phenomena and may produce hardly repeatable and reproducible results, impacting the validation of the solution under evaluation. Previously, we have proposed the Trace-based Simulation (TS) approach to address the problem. TS uses traces of radio link quality and position of nodes to accurately reproduce past experiments in ns-3. Yet, in its current version, the TS approach is not compatible with scenarios where the radio spectrum is shared with concurrent networks, as it does not reproduce their channel occupancy. In this paper, we introduce the InterferencePropagationLossModel and a modified MacLow to allow reproducing the channel occupancy experienced in past experiments. To validate the proposed models, the network throughput was measured in different experiments performed in the w-iLab.t testbed, controlling the channel occupancy introduced by concurrent networks. The experimental results were then compared with the network throughput achieved using the improved TS approach, the legacy TS approach, and pure simulation, validating the new proposed models and confirming their relevance to reproduce experiments previously executed in real environments.

cs.NI↗

A Routing Metric for Inter-flow Interference-aware Flying Multi-hop Networks

The growing demand for broadband communications anytime, anywhere has paved the way to the usage of Unmanned Aerial Vehicles (UAVs) for providing Internet access in areas without network infrastructure and enhancing the performance of existing networks. However, the usage of Flying Multi-hop Networks (FMNs) in such scenarios brings up significant challenges concerning network routing, in order to permanently provide the Quality of Service expected by the users. The problem is exacerbated in crowded events, where the FMN may be formed by many UAVs to address the traffic demand, causing inter-flow interference within the FMN. Typically, estimating inter-flow interference is not straightforward and requires the exchange of probe packets, thus increasing network overhead. The main contribution of this paper is an inter-flow interference-aware routing metric, named I2R, designed for centralized routing in FMNs with controllable topology. I2R does not require any control packets and enables the configuration of paths with minimal Euclidean distance formed by UAVs with the lowest number of neighbors in carrier-sense range, thus minimizing inter-flow interference in the FMN. Simulation results show the I2R superior performance, with significant gains in terms of throughput and end-to-end delay, when compared with state of the art routing metrics.

cs.NI↗

Repeatable and Reproducible Wireless Networking Experimentation through Trace-based Simulation

To properly validate wireless networking solutions we depend on experimentation. Simulation very often produces less accurate results due to the use of models that are simplifications of the real phenomena they try to model. Networking experimentation may offer limited repeatability and reproducibility. Being influenced by external random phenomena such as noise, interference, and multipath, real experiments are hardly repeatable. In addition, they are difficult to reproduce due to testbed operational constraints and availability. Without repeatability and reproducibility, the validation of the networking solution under evaluation is questionable. In this paper, we show how the Trace-based Simulation (TS) approach can be used to accurately repeat and reproduce real experiments and, consequently, introduce a paradigm shift when it comes to the evaluation of wireless networking solutions. We present an extensive evaluation of the TS approach using the Fed4FIRE+ w-iLab.2 testbed. The results show that it is possible to repeat and reproduce real experiments using ns-3 trace-based simulations with more accuracy than in pure simulation, with average accuracy gains above 50%.

cs.NI↗

Power Interference Modeling for CSMA/CA based Networks using Directional Antenna

In IEEE 802.11 based wireless networks adding more access points does not always guarantee an increase of network capacity. In some cases, additional access points may contribute to degrade the aggregated network throughput as more interference is introduced. This paper characterizes the power interference in CSMA/CA based networks consisting of nodes using directional antenna. The severity of the interference is quantized via an improved form of the Attacking Case metric as the original form of this metric was developed for nodes using omnidirectional antenna. The proposed metric is attractive because it considers nodes using directional or omnidirectional antenna, and it enables the quantization of interference in wireless networks using multiple transmission power schemes. The improved Attacking Case metric is useful to study the aggregated throughput of IEEE 802.11 based networks; reducing Attacking Case probably results in an increase of aggregated throughput. This reduction can be implemented using strategies such as directional antenna, transmit power control, or both.

cs.NI↗