论文标题
LP WAN网关位置选择使用修改的K-domination Set算法
LP WAN Gateway Location Selection Using Modified K-Dominating Set Algorithm
论文作者
论文摘要
LP WAN网络使用网关或基站与大型距离分布的设备进行通信，最大数十公里。选择无线网络中最佳网关位置的选择应允许为给定的一组节点提供完整的覆盖范围，并考虑到限制，例如每个访问点所服务的节点的数量或所需的冗余。在本文中，我们描述了使用$ k $ dominating set的概念在网络中选择基站的问题。在我们的模型中，我们包括有关所需冗余效率和光谱效率的信息。我们考虑对所得连接的其他要求，并提供解决问题的贪婪算法。该算法以随机生成的网络拓扑以及使用样本真实智能计量网络的坐标进行评估。
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.
