Scheduling Transmissions in Time-Slotted LoRa Wide Area Networks
Résumé
In this work, we formalize the LoRaWAN data scheduling optimisation problem with waiting times using linear programming. We derive an optimal algorithm for the special case of equivalent SF. We then investigate approximation algorithms for specific and general cases. We finally discuss about the general problem's complexity.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
