LMLeonardo Maccari

Leonardo Maccari

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Leonardo Maccari has a total of 33 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Next-Generation Wireless Backhaul Design for Rural Areas

    by Gabriele Gemmi, Llorenç Cerdà-Alabern, Leonardo Maccari

    Rural areas often face significant challenges in accessing reliable broadband Internet due to high infrastructure costs and low population density. To address this issue, we propose a model for evaluating the performance and the cost of a mesh-based, last-and middle-mile replacement for broadband connection in these underserved regions. We use open data from ten underserved municipalities to assess the demand, plan the mesh network, and estimate the allocated capacity per user. We consider two designs: a low-cost network using the classical 5 unlicensed band, and a high-performance one using mmWave frequency. For both designs, we estimate the Operating Expenditure and the amortized Capital Expenditure using realistic device prices and operating cost estimations. We compare the price of the mesh-based solution with alternatives based on xDSL and satellite connectivity and show that it has competitive prices compared to existing offers, covering a larger portion of households than DSL. We open-source both the code and the elaborated data to reproduce, extend, and improve our results in different settings.


  • Open Access

    Optimizing and Managing Wireless Backhaul for Resilient Next-Generation Cellular Networks

    by Gabriele Gemmi, Michele Polese, Tommaso Melodia, Leonardo Maccari

    Next-generation wireless networks target high network availability, ubiquitous coverage, and extremely high data rates for mobile users. This requires exploring new frequency bands, e.g., mmWaves, moving toward ultra-dense deployments in urban locations, and providing ad hoc, resilient connectivity in rural scenarios. The design of the backhaul network plays a key role in advancing how the access part of the wireless system supports next-generation use cases. Wireless backhauling, such as the newly introduced Integrated Access and Backhaul (IAB) concept in 5G, provides a promising solution, also leveraging the mmWave technology and steerable beams to mitigate interference and scalability issues. At the same time, however, managing and optimizing a complex wireless backhaul introduces additional challenges for the operation of cellular systems. This paper presents a strategy for the optimal creation of the backhaul network considering various constraints related to network topology, robustness, and flow management. We evaluate its feasibility and efficiency using synthetic and realistic network scenarios based on 3D modeling of buildings and ray tracing. We implement and prototype our solution as a dynamic IAB control framework based on the Open Radio Access Network (RAN) architecture, and demonstrate its functionality in Colosseum, a large-scale wireless network emulator with hardware in the loop.

  • Open Access

    On the Properties of Next Generation Wireless Backhaul

    by Gabriele Gemmi, Renato Lo Cigno, Leonardo Maccari

    With the advent of 5G, cellular networks require a high number of base stations, possibly interconnected with wireless links, an evolution introduced in the last revision of 5G as the Integrated Access and Backhaul (IAB). Researchers are now working to optimize the complex topologies of the backhaul network, using synthetic models for the underlying visibility graph, i.e., the graph of possible connections between the base stations. The goal of this paper is to provide a novel methodology to generate visibility graphs starting from real data (and the data sets themselves together with the source code for their manipulation), in order to base the IAB design and optimization on assumptions that are as close as possible to reality. We introduce a GPU-based method to create visibility graphs from open data, we analyze the properties of the realistic visibility graphs, and we show that different geographic areas produce very different graphs. We run state-of-the-art algorithms to create wireless backhaul networks on top of visibility graphs, and we show that the results that exploit synthetic models are far from those that use our realistic graphs. Our conclusion is that the data-based approach we propose is essential to design mobile networks that work in a variety of real-world situations.


  • Open Access

    On Cost-Effective, Reliable Coverage for LoS Communications in Urban Areas

    by Gabriele Gemmi, Renato Lo Cigno, Leonardo Maccari

    The use of ultra high frequencies in 5G and future networks to improve transmission speeds and capacity requires that users’ equipment remain in Line of Sight with the access antennas most of the service time. This requirement implies a change in perspective to plan the coverage: Antennas cannot be placed on roofs or remote antenna sites, and a robust coverage is based on multi-antenna visibility from any point. This paper tackles the problem of public street coverage in urban areas with a data-driven methodology. Starting from 3D digital maps, we formalize the problem of antenna placement as a set coverage problem and leverage powerful heuristics to implement a general algorithm that allows the exploration of different policies, returning the detailed coverage, the antenna placement, and the cost of the coverage. Results on 15 areas in 3 Italian cities show the properties of different policies and confirm for the first time on large scale real data the feasibility of Line of Sight communications with a sustainable number of antennas per km.


  • On the Performance and Effectiveness of Digital Contact Tracing in the Second Wave of COVID-19 in Italy

    by Leonardo Maccari

    Contact-tracing smartphone applications have been developed and used as a complement to manual contact tracing in the COVID-19 pandemic. The goal of these apps is to trace contacts between people and notify the mobile phone owners when one of their contacts tested positive. People who receive a notification should behave as exposed people, take a test, and possibly isolate themselves until they receive the result. Unfortunately, identifying contacts based on distance is technically a daunting task: apps can be configured conservatively (a very small number of people are notified, limiting the effectiveness of the app) or they may be more tolerant and produce a high number of notifications but also of false positives. We review the data available from Immuni, the Italian app, which provides detailed figures on the notifications sent and the positive users, and we show that Immuni was configured to generate a very large amount of notifications. We estimate the testing resources that the health system would have needed if the app was downloaded by 100% of the adult population, and every notified person would require a test. In such conditions, Immuni would have generated a number of tests orders of magnitude higher than what was available. We compare the performance of Immuni with the currently available literature on other apps and observe that contact-tracing apps had a limited impact on the second wave of the COVID-19 pandemic. As contact tracing exposes citizens to privacy risks, we discuss some ways to reshape the goal of the apps to achieve a better tradeoff between social benefit and risk.


  • WIP: Analysis of Feasible Topologies for Backhaul Mesh Networks

    by Gabriele Gemmi, Renato Lo Cigno, Leonardo Maccari

    Mesh backhauls are getting attention for 5G networks, but not only. A backhaul mesh is attractive due to its multiple potential paths that grants redundancy and robustness. The real topology and its properties, however, is heavily influenced by the characteristics of the place where it is deployed, a fact that is rarely taken into account by scientific literature, mainly due to the lack of detailed topographic data. This WIP analyzes the impact of true topography on small backhaul meshes in nine different locations in Italy. Initial results stress how true data influence results and can help designing better networks and better services.


  • Exact Distributed Load Centrality Computation: Algorithms, Convergence, and Applications to Distance Vector Routing

    by Leonardo Maccari, Lorenzo Ghiro, Alessio Guerrieri, Alberto Montresor, Renato Lo Cigno

    Many optimization techniques for networking protocols take advantage of topological information to improve performance. Often, the topological information at the core of these techniques is a centrality metric such as the Betweenness Centrality (BC) index. BC is, in fact, a centrality metric with many well-known successful applications documented in the literature, from resource allocation to routing. To compute BC, however, each node must run a centralized algorithm and needs to have the global topological knowledge; such requirements limit the feasibility of optimization procedures based on BC. To overcome restrictions of this kind, we present a novel distributed algorithm that requires only local information to compute an alternative similar metric, called Load Centrality (LC). We present the new algorithm together with a proof of its convergence and the analysis of its time complexity. The proposed algorithm is general enough to be integrated with any distance vector (DV) routing protocol. In support of this claim, we provide an implementation on top of Babel, a real-world DV protocol. We use this implementation in an emulation framework to show how LC can be exploited to reduce Babel's convergence time upon node failure, without increasing control overhead. As a key step towards the adoption of centrality-based optimization for routing, we study how the algorithm can be incrementally introduced in a network running a DV routing protocol. We show that even when only a small fraction of nodes participate in the protocol, the algorithm accurately ranks nodes according to their centrality.


  • Open Access

    Infective flooding in low-duty-cycle networks, properties and bounds

    by Luca Baldesi, Leonardo Maccari, Renato Lo Cigno