arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2010.04553cs.NIcs.DM
收藏

基于改进K-支配集算法的LP WAN网关位置选择

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

Artur Frankiewicz, Adam Glos, Krzysztof Grochla, Zbigniew Łaskarzewski, Jarosław Miszczak, Konrad Połys, Przemysław Sadowski, Anna Strzoda

摘要:

LP WAN网络使用网关或基站与分布在数十公里远的距离上的设备进行通信。无线网络中最佳网关位置的选择应该允许为给定的节点集合提供完整的覆盖,同时考虑到诸如每个接入点服务的节点数量或所需冗余等限制。本文利用$k$ -支配集的概念描述了网络中的基站选择问题。在我们的模型中,我们包括所需的冗余和频谱效率的信息。我们考虑了对最终连接的附加要求,并提供了解决该问题的贪心算法。随机生成的网络拓扑结构,并使用样本真正的智能计量网络的坐标的算法进行评估。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑