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.
This work has been partially funded by the Polish National Center for Research and Development grant no. POIR.04.01.04-00-0005/17.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Laiho, J., Wacker, A., Novosad, T.: Radio network planning and optimisation for UMTS, vol. 2. Wiley Online Library (2002)
Hurley, S.: Planning effective cellular mobile radio networks. IEEE Trans. Veh. Technol. 51(2), 243–253 (2002)
Alber, J., Fellows, M.R., Niedermeier, R.: Polynomial-time data reduction for dominating set. J. ACM (JACM) 51(3), 363–384 (2004)
CloudRF. https://cloudrf.com/LoRa_planning
Radio Mobile Online. https://www.ve2dbe.com/rmonline_s.asp
Grochla, K.P.K.: Heuristic algorithm for gateway location selection in large scale LoRa networks. In: Proceedings of the 2020 International Conference on Wireless Communications & Mobile Computing (IWCMC 2020). IEEE (2020)
Das, B., Bharghavan, V.: Routing in ad-hoc networks using minimum connected dominating sets. In: 1997 IEEE International Conference on Communications, 1997. ICC 1997 Montreal, Towards the Knowledge Millennium, vol. 1, pp. 376–380. IEEE (1997)
Hochbaum, D.S., Shmoys, D.B.: A best possible heuristic for the k-center problem. Math. Oper. Res. 10(2), 180–184 (1985)
Wan, P.J., Alzoubi, K.M., Frieder, O.: Distributed construction of connected dominating set in wireless ad hoc networks. Mob. Networks Appl. 9(2), 141–149 (2004)
Dai, F., Wu, J.: On constructing k-connected k-dominating set in wireless networks. In: Parallel and Distributed Processing Symposium, 2005. Proceedings. 19th IEEE International, 10-pp. IEEE (2005)
Foerster, K.T.: Approximating fault-tolerant domination in general graphs. In: Proceedings of the Meeting on Analytic Algorithmics and Combinatorics. Society for Industrial and Applied Mathematics, pp. 25–32 (2013)
Zhou, T., Sun, Y., He, S., Shi, Z., Chen, J., Tao, Z.: Gateway planning for hybrid LoRa networks. In: 2019 International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData), pp. 1071–1079. IEEE (2019)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Frankiewicz, A. et al. (2021). LP WAN Gateway Location Selection Using Modified K-Dominating Set Algorithm. In: Calzarossa, M.C., Gelenbe, E., Grochla, K., Lent, R., Czachórski, T. (eds) Modelling, Analysis, and Simulation of Computer and Telecommunication Systems. MASCOTS 2020. Lecture Notes in Computer Science(), vol 12527. Springer, Cham. https://doi.org/10.1007/978-3-030-68110-4_14
Download citation
DOI: https://doi.org/10.1007/978-3-030-68110-4_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-68109-8
Online ISBN: 978-3-030-68110-4
eBook Packages: Computer ScienceComputer Science (R0)