4.6 Article

Optimal Data Collection Time in LoRa Networks-A Time-Slotted Approach

Journal

SENSORS
Volume 21, Issue 4, Pages -

Publisher

MDPI
DOI: 10.3390/s21041193

Keywords

LoRa; scheduling; resource allocation

Funding

  1. Science Foundation Ireland (SFI)
  2. European Regional Development Fund [13/RC/2077]
  3. CONFIRM fund [16/RC/3918]
  4. European Union [713567]

Ask authors/readers for more resources

This paper discusses the issue of data transmission in LoRa IoT technology when gateways are not always available, proposing a time-slotted transmission scheduling mechanism to improve data collection efficiency. Simulation experiments show that the mechanism can significantly reduce data collection time, achieving at least 10 times faster collection for networks with 100 or more nodes.
LoRa is a low-power and long range radio communication technology designed for low-power Internet of Things devices. These devices are often deployed in remote areas where the end-to-end connectivity provided through one or more gateways may be limited. In this paper, we examine the case where the gateway is not available at all times. As a consequence, the sensing data need to be buffered locally and transmitted as soon as a gateway becomes available. However, due to the Aloha-style transmission policy of current LoRa-based standards, such as the LoRaWAN, delivering a large number of packets in a short period of time by a large number of nodes becomes impossible. To avoid bursts of collisions and expedite data collection, we propose a time-slotted transmission scheduling mechanism. We formulate the data scheduling optimisation problem, taking into account LoRa characteristics, and compare its performance to low complexity heuristics. Moreover, we conduct a set of simulations to show the benefits of synchronous communications on the data collection time and the network performance. The results show that the data collection can reliably be achieved at least 10 times faster compared to an Aloha-based approach for networks with 100 or more nodes. We also develop a proof-of-concept to assess the overhead cost of communicating the schedule to the nodes and we present experimental results.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available