K-means spreading factor allocation for large-scale LoRa networks
Asad Ullah, Muhammad; Iqbal, Junnaid; Hoeller, Arliones; Demo Souza, Richard; Alves, Hirley (2019-10-30)
Asad Ullah, M.; Iqbal, J.; Hoeller, A.; Souza, R.D.; Alves, A.H. K-Means Spreading Factor Allocation for Large-Scale LoRa Networks. Sensors 2019, 19, 4723. https://doi.org/10.3390/s19214723
© 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/).
https://creativecommons.org/licenses/by/4.0/
https://urn.fi/URN:NBN:fi-fe2019110136208
Tiivistelmä
Abstract
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 1.53 times.
Kokoelmat
- Avoin saatavuus [34543]