LP WAN Gateway Location Selection Using Modified K-Dominating Set Algorithm

TL;DR

This paper presents a modified K-dominating set algorithm for optimal LP WAN gateway placement, considering redundancy and spectral efficiency, evaluated on real and synthetic network data.

Contribution

It introduces a novel greedy algorithm for selecting gateway locations in LP WAN networks using a modified K-dominating set approach.

Findings

Algorithm effectively covers network nodes with redundancy constraints.

Evaluations show good performance on real and synthetic network topologies.

The method improves coverage and efficiency in gateway placement.

Abstract

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.