The LP WAN networks use gateways or base stations to communicate with devices distributed on large distances, up to tens of kilometres. The selection of optimal gateway locations in wireless networks should allow providing the complete coverage for a given set of nodes, taking into account the limitations, such as the number of nodes served per access point or required redundancy. In this paper, we describe the problem of selecting the base stations in a network using the concept of k-dominating set. In our model, we include information about the required redundancy and spectral efficiency. We consider the additional requirements on the resulting connections and provide the greedy algorithm for solving the problem. The algorithm is evaluated in randomly generated network topologies and using the coordinates of sample real smart metering networks.
BT - Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems DA - 01/2021 DO - 10.1007/978-3-030-68110-4_14 LA - eng N2 -The LP WAN networks use gateways or base stations to communicate with devices distributed on large distances, up to tens of kilometres. The selection of optimal gateway locations in wireless networks should allow providing the complete coverage for a given set of nodes, taking into account the limitations, such as the number of nodes served per access point or required redundancy. In this paper, we describe the problem of selecting the base stations in a network using the concept of k-dominating set. In our model, we include information about the required redundancy and spectral efficiency. We consider the additional requirements on the resulting connections and provide the greedy algorithm for solving the problem. The algorithm is evaluated in randomly generated network topologies and using the coordinates of sample real smart metering networks.
PB - Springer PY - 2020 T2 - Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems TI - LP WAN Gateway Location Selection Using Modified K-Dominating Set Algorithm UR - https://arxiv.org/abs/2010.04553 ER -