Cargando…

K-Means Spreading Factor Allocation for Large-Scale LoRa Networks

Low-power wide-area networks (LPWANs) are emerging rapidly as a fundamental Internet of Things (IoT) technology because of their low-power consumption, long-range connectivity, and ability to support massive numbers of users. With its high growth rate, Long-Range (LoRa) is becoming the most adopted...

Descripción completa

Detalles Bibliográficos
Autores principales: Asad Ullah, Muhammad, Iqbal, Junnaid, Hoeller, Arliones, Souza, Richard Demo, Alves, Hirley
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2019
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6865214/
https://www.ncbi.nlm.nih.gov/pubmed/31671700
http://dx.doi.org/10.3390/s19214723
_version_ 1783472047510257664
author Asad Ullah, Muhammad
Iqbal, Junnaid
Hoeller, Arliones
Souza, Richard Demo
Alves, Hirley
author_facet Asad Ullah, Muhammad
Iqbal, Junnaid
Hoeller, Arliones
Souza, Richard Demo
Alves, Hirley
author_sort Asad Ullah, Muhammad
collection PubMed
description Low-power wide-area networks (LPWANs) are emerging rapidly as a fundamental Internet of Things (IoT) technology because of their low-power consumption, long-range connectivity, and ability to support massive numbers of users. With its high growth rate, Long-Range (LoRa) is becoming the most adopted LPWAN technology. This research work contributes to the problem of LoRa spreading factor (SF) allocation by proposing an algorithm on the basis of K-means clustering. We assess the network performance considering the outage probabilities of a large-scale unconfirmed-mode class-A LoRa Wide Area Network (LoRaWAN) model, without retransmissions. The proposed algorithm allows for different user distribution over SFs, thus rendering SF allocation flexible. Such distribution translates into network parameters that are application dependent. Simulation results consider different network scenarios and realistic parameters to illustrate how the distance from the gateway and the number of nodes in each SF affects transmission reliability. Theoretical and simulation results show that our SF allocation approach improves the network’s average coverage probability up to 5 percentage points when compared to the baseline model. Moreover, our results show a fairer network operation where the performance difference between the best- and worst-case nodes is significantly reduced. This happens because our method seeks to equalize the usage of each SF. We show that the worst-case performance in one deployment scenario can be enhanced by [Formula: see text] times.
format Online
Article
Text
id pubmed-6865214
institution National Center for Biotechnology Information
language English
publishDate 2019
publisher MDPI
record_format MEDLINE/PubMed
spelling pubmed-68652142019-12-09 K-Means Spreading Factor Allocation for Large-Scale LoRa Networks Asad Ullah, Muhammad Iqbal, Junnaid Hoeller, Arliones Souza, Richard Demo Alves, Hirley Sensors (Basel) Article Low-power wide-area networks (LPWANs) are emerging rapidly as a fundamental Internet of Things (IoT) technology because of their low-power consumption, long-range connectivity, and ability to support massive numbers of users. With its high growth rate, Long-Range (LoRa) is becoming the most adopted LPWAN technology. This research work contributes to the problem of LoRa spreading factor (SF) allocation by proposing an algorithm on the basis of K-means clustering. We assess the network performance considering the outage probabilities of a large-scale unconfirmed-mode class-A LoRa Wide Area Network (LoRaWAN) model, without retransmissions. The proposed algorithm allows for different user distribution over SFs, thus rendering SF allocation flexible. Such distribution translates into network parameters that are application dependent. Simulation results consider different network scenarios and realistic parameters to illustrate how the distance from the gateway and the number of nodes in each SF affects transmission reliability. Theoretical and simulation results show that our SF allocation approach improves the network’s average coverage probability up to 5 percentage points when compared to the baseline model. Moreover, our results show a fairer network operation where the performance difference between the best- and worst-case nodes is significantly reduced. This happens because our method seeks to equalize the usage of each SF. We show that the worst-case performance in one deployment scenario can be enhanced by [Formula: see text] times. MDPI 2019-10-30 /pmc/articles/PMC6865214/ /pubmed/31671700 http://dx.doi.org/10.3390/s19214723 Text en © 2019 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).
spellingShingle Article
Asad Ullah, Muhammad
Iqbal, Junnaid
Hoeller, Arliones
Souza, Richard Demo
Alves, Hirley
K-Means Spreading Factor Allocation for Large-Scale LoRa Networks
title K-Means Spreading Factor Allocation for Large-Scale LoRa Networks
title_full K-Means Spreading Factor Allocation for Large-Scale LoRa Networks
title_fullStr K-Means Spreading Factor Allocation for Large-Scale LoRa Networks
title_full_unstemmed K-Means Spreading Factor Allocation for Large-Scale LoRa Networks
title_short K-Means Spreading Factor Allocation for Large-Scale LoRa Networks
title_sort k-means spreading factor allocation for large-scale lora networks
topic Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6865214/
https://www.ncbi.nlm.nih.gov/pubmed/31671700
http://dx.doi.org/10.3390/s19214723
work_keys_str_mv AT asadullahmuhammad kmeansspreadingfactorallocationforlargescaleloranetworks
AT iqbaljunnaid kmeansspreadingfactorallocationforlargescaleloranetworks
AT hoellerarliones kmeansspreadingfactorallocationforlargescaleloranetworks
AT souzaricharddemo kmeansspreadingfactorallocationforlargescaleloranetworks
AT alveshirley kmeansspreadingfactorallocationforlargescaleloranetworks