1 December 2021 in Environment International
RBRoser Brugués-I-Pujolràs
+1
Selecting sampling points to monitor traces of SARS-CoV-2 in sewage at the intra-urban scale is no trivial task given the complexity of the networks and the multiple technical, economic and socio-environmental constraints involved. This paper proposes two algorithms for the automatic selection of sampling locations in sewage networks. The first algorithm, is for the optimal selection of a predefined number of sampling locations ensuring maximum coverage of inhabitants and minimum overlapping amongst selected sites (static approach). The second is for establishing a strategy of iterations of sample&analysis to identify patient zero and hot spots of COVID-19 infected inhabitants in cities (dynamic approach). The algorithms are based on graph-theory and are coupled to a greedy optimization algorithm. The usefulness of the algorithms is illustrated in the case study of Girona (NE Iberian Peninsula, 148,504 inhabitants). The results show that the algorithms are able to automatically propose locations for a given number of stations. In the case of Girona, always covering more than 60% of the manholes and with less than 3% of them overlapping amongst stations. Deploying 5, 6 or 7 stations results in more than 80% coverage in manholes and more than 85% of the inhabitants. For the dynamic sensor placement, we demonstrate that assigning infection probabilities to each manhole as a function of the number of inhabitants connected reduces the number of iterations required to detect the zero patient and the hot spot areas.
11 January 2025 in Computer Communications
20 July 2023 in Journal of Network and Systems Management
Autonomous network management is crucial for Fifth Generation (5G) and Beyond 5G (B5G) networks, where a constantly changing environment is expected and network configuration must adapt accordingly. Modeling tools are required to predict the impact on performance (packet and delay loss) when new traffic demands arrives and when changes in routing paths are applied in the network. Mathematical analysis and network simulators are techniques for modeling networks but both have limitations, as the former provides low accuracy and the latter requires high execution times. To overcome these limitations, machine learning (ML) algorithms, and more specifically, graph neural networks (GNNs), are proposed for network modeling due to their ability to capture complex relationships from graph-like data while predicting network properties with high accuracy and low computational requirements. However, one of the main issues when using GNNs is their lack of generalization capability to larger networks, i.e., when trained in small networks (in number of nodes, paths length, links capacity), the accuracy of predictions on larger networks is poor. This paper addresses the GNN generalization problem by the use of fundamental networking concepts. Our solution is built from a baseline GNN model called RouteNet (developed by Barcelona Neural Networking Center-Universitat Politècnica de Catalunya (BNN-UPC)) that predicts the average delay in network paths, and through a number of simple additions significantly improves the prediction accuracy in larger networks. The improvement ratio compared to the baseline model is 101, from a 187.28% to a 1.828%, measured by the Mean Average Percentage Error (MAPE). In addition, we propose a closed-loop control context where the resulting GNN model could be potentially used in different use cases.
17 March 2023 in npj Clean Water
Water scarcity and droughts are an increasing issue in many parts of the world. In the context of urban water systems, the transition to circularity may imply wastewater treatment and reuse. Planning and assessment of water reuse projects require decision-makers evaluating the cost and benefits of alternative scenarios. Manual or semi-automatic approaches are still common practice for planning both drinking and reclaimed water distribution networks. This work illustrates a decision support tool that, based on open data sources and graph theory coupled to greedy optimization algorithms, is able to automatically compute the optimal reclaimed water network for a given scenario. The tool provides not only the maximum amount of served reclaimed water per unit of invested cost, but also the length and diameters of the pipes required, the location and size of storage tanks, the population served, and the construction costs, i.e., everything under the same architecture. The usefulness of the tool is illustrated in two different but complementary cities in terms of size, density, and topography. The construction cost of the optimal water reclaimed network for a city of approximately 100,000 inhabitants is estimated to be in the range of €0.17–0.22/m3 (for a payback period of 30 years).
15 July 2024 in Data in Brief
This paper presents a comprehensive network slicing dataset designed to empower artificial intelligence (AI), and data-based performance prediction applications, in 5G and beyond (B5G) networks. The dataset, generated through a packet-level simulator, captures the complexities of network slicing considering the three main network slice types defined by 3GPP: Enhanced Mobile Broadband (eMBB), Ultra-Reliable Low Latency Communications (URLLC), and Massive Internet of Things (mIoT). It includes a wide range of network scenarios with varying topologies, slice instances, and traffic flows. The included scenarios consist of transport networks, excluding the Radio Access Network (RAN) infrastructure. Each sample consists of pairs of a network scenario and the associated performance metrics: the network configuration includes network topology, traffic characteristics, routing configurations, while the performance metrics are the delay, jitter, and loss for each flow. The dataset is generated with a custom network slicing admission control module, enabling the simulation of scenarios in multiple situations of over and underprovisioning. This network slicing dataset is a valuable asset for the research community, unlocking opportunities for innovations in 5G and B5G networks.
12 November 2025 in IEEE Vehicular Technology Magazine
Mobility performance has been a key focus in cellular networks up to 5G. To enhance handover (HO) performance, the Third Generation Partnership Project introduced a conditional HO and layer 1/layer 2 (L1/L2)-triggered mobility (LTM) mechanisms in 5G. While these reactive HO strategies address the tradeoff between HO failures and ping-pong effects, they often result in inefficient radio resource utilization due to additional HO preparations. To overcome these challenges, this article proposes a proactive HO framework for mobility management in open radio access network (O-RAN), leveraging user-cell link predictions to identify the optimal target cell for HO. We explore various categories of graph neural networks (GNNs) for link prediction and analyze the complexity of applying them to the mobility management domain. Two GNN models are compared using an anonymized real-world dataset and a synthetic dataset obtained with Keysight’s EXata emulation tool. The results show the models’ ability to capture the dynamic and graph-structured nature of cellular networks. Finally, we present key considerations for real-world deployment that outline future steps to enable the integration of GNN-based link prediction for mobility management in O-RAN networks.