01441nas a2200205   4500000000100000000000100001008004100002260002200043100002200065700001400087700002200101700002700123700002200150700001800172700002500190700001700215245008000232856003700312520088600349       2020                            d  c01/2021bSpringer1 aArtur Frankiewicz1 aAdam Glos1 aKrzysztof Grochla1 aZbigniew Łaskarzewski1 aJaroslaw Miszczak1 aKonrad Połys1 aPrzemysław Sadowski1 aAnna Strzoda00aLP WAN Gateway Location Selection Using Modified K-Dominating Set Algorithm  uhttps://arxiv.org/abs/2010.045533 a<p>The LP WAN networks use gateways or base stations to communicate with devices distributed on large distances, up&nbsp;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 <em>k</em>-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.</p>