Metraipolis › archive › dc_6f4a9da3dbb2

FLoRa: Flight-Assisted Data Collection from Duty Cycling LoRa Nodes under Energy Constraints — arXiv:2610.09226

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.09226
License (as archived)
CC0-1.0
Archived
2026-10-08T12:36:46.855Z
SHA-256 of the archived text
6c72a674d2907734c7b7c0211d4ec290d3397dffcda89fe59fbb68d2540c38f7
Stable URL of this page
https://metraipolis.com/documento/dc_6f4a9da3dbb2

How to cite

FLoRa: Flight-Assisted Data Collection from Duty Cycling LoRa Nodes under Energy Constraints — arXiv:2610.09226 — arXiv (en), https://arxiv.org/abs/2610.09226 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_6f4a9da3dbb2 (Metraipolis archive dc_6f4a9da3dbb2, sha256 6c72a674d2907734c7b7c0211d4ec290d3397dffcda89fe59fbb68d2540c38f7)
BibTeX
@misc{dc6f4a9da3dbb2,
  title = {FLoRa: Flight-Assisted Data Collection from Duty Cycling LoRa Nodes under Energy Constraints — arXiv:2610.09226},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.09226},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_6f4a9da3dbb2; sha256 6c72a674d2907734c7b7c0211d4ec290d3397dffcda89fe59fbb68d2540c38f7},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.09226. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Data collection using Unmanned Aerial Vehicles (UAVs) is challenging when LoRa IoT Devices (IoTDs) duty-cycle to conserve battery. Under energy constraints, a UAV must decide which IoTDs to visit, in what order, where to hover, and how many times to probe each node, while time-based data freshness decays. Tractably solving this problem requires a multi-level optimization architecture: discrete combinatorial optimization for routing, continuous global optimization for spatial positioning, and sequential decision-making under uncertainty. We propose FLoRa, a Flight-assisted LoRa data collection architecture using Simulated Annealing (SA) for path planning, Covariance Matrix Adaptation Evolution Strategy (CMA-ES) for hover positioning, and Partially Observable Markov Decision Processes (POMDPs) for probing IoTDs. To quantify collection utility from duty-cycling nodes, we introduce the Value of Information for Pull-based systems (VIP), a metric that rewards fresh data and penalizes failed probes, imposing well-posedness and preventing indefinite probing when an IoTD is off. Tracking hard battery constraints on every POMDP sample path requires state augmentation, worsening the curse of dimensionality. For tractability, SA and CMA-ES work on the hard battery constraints, while at the POMDP layer we relax them into soft average constraints via Lagrangian relaxation. Since solving the network-wide POMDP is computationally complex, we decompose it into node-level POMDPs by approximating inter-node time dependency using a forward-decomposition technique. Evaluation shows FLoRa outperforms metaheuristic, greedy, and deep reinforcement learning baselines by 30.6%, 27.8%, and 15.2% in total expected VIP, while increasing node coverage by 24.5%, 29.2%, and 8.8%, and successful collections by 24.3%, 25.6%, and 15.2%, respectively.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno).
Categorie arXiv: Networking and Internet Architecture (cs.NI) ; Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2610.09226 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T12:14:15.381Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).