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.
14 September 2022 in IEEE Transactions on Network Science and Engineering
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.
A community network (CN) is a bottom-up network created by a community of people with the goal of gaining control of their communications and overcoming digital divide. CNs are blooming, they range from small ones (tens of nodes) to gigantic ones (tens of thousands of nodes). They are made primarily of wireless links but in some cases, they mix wired and wireless technologies. CNs are generally unplanned and nonlayered, and the community tries to mirror the same approach in its governance, avoiding unnecessary management structures and relying on self-organization and spontaneous interactions. CNs are peer production platforms, a community of people that pools resources and contributes to build a shared value. While this value is generally immaterial (as in WikiPedia) CNs instead realize a distributed, peer-to-peer physical communication network. This paper analyses ninux.org, the largest CN in Italy, and one of the eldest in Europe. The goal of this paper is to understand if the spontaneous growth of the network and the community leads to a technically robust network and a socially robust community, or it hides the presence of (potentially interdependent) points of failure. We will show that, in spite of the original motivations of the ninux community, the network is fragile under several aspects, and we suggest ways to improve it.
10 September 2018 in IEEE/ACM Transactions on Networking
One of the key features of a routing protocol is its ability to recover from link or node failures, recomputing routes efficiently without creating temporary loops. Indeed, in real conditions, there is always a trade-off between the overhead due to the periodic generation of control messages and route convergence time. This paper formalizes the problem of the choice of timers for control message generation as an optimization problem that minimizes the route convergence time, constrained to a constant signaling overhead. The solution requires the knowledge of nodes’ centrality in the topology and can be obtained with a computational complexity low enough to allow on-line computation of the timers. Results on both synthetic and real topologies show a significant decrease of the transient duration with the consequent performance gain in terms of reduced number of unreachable destinations and routing loops. Our proposal is general and it can be applied to enhance any link-state routing protocol, albeit it is more suited for wireless networks. As a concrete example, we present the extension of OLSRv2 with our proposal, named Pop-Routing, and discuss its performance and the stability of centrality metrics in three large-scale real wireless mesh networks. This exhaustive analysis on traces of the topology evolution of real networks for one entire week shows that pop-routing outperforms the non-enhanced protocol in every situation, even when it runs with sub-optimal timers due to centrality computation on stale information.