Infrastructure

This chapter deals with models for network infrastructure. For wireless networks, this means distributing Base Stations (BS) across a territory with the aim of minimizing costs while maximizing radio coverage. The basics of radio transmission in the 5G network are initially explained. These models reflect the distance dependence in the PL-(Path-Loss-) metric. This allows for optimal positioning of the BS using the grid algorithm. For a set of m measurement points distributed in a territory and k possible positions for the BS, the best k ≤ K positions are calculated iteratively. The iteration process is visualized in an animation. After the positions of the BS have been determined, a network of all entry and exit points must be established. In section 6.2, the Kruskal and Steiner tree algorithms for network graphs with minimal line costs are explained. In real networks, the tree topology is extended with additional lines for performance and reliability reasons. This provides multiple possible paths to the exit router. With the Dijkstra algorithm in section 6.3, each router can determine its shortest path to the target router and use the correct exit line for the IP packet. In section 6.4, recommendations are given for the independent application of the grid method to the 5G propagation conditions and for an extension of the Dijkstra algorithm to include path cost output.