LoRa Network Planning: Gateway Placement and Device Configuration
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
LoRa is a leading Low-Power Wide-Area Network technology for IoT applications that require communication over long distances at low power. While there exist several studies on the performance, scalability and security of LoRa networks, the important problem of how to efficiently plan and deploy LoRa networks has not received much attention so far. In this work, we address this problem, which consists of the joint problems of gateway placement, spreading factor assignment, and power allocation. We formulate the problem as a mixed-integer non-linear optimization problem, which can be solved only for small networks. By systematically analyzing the structural properties of the optimal problem, specifically on regularly-structured networks, we develop an approximate algorithm for planning large-scale LoRa networks efficiently. Simulation results are provided to show the behavior and performance of our algorithm in different network scenarios. We have also compared our algorithm with the commonly used ADR algorithm, which shows 15% and 20% improvement in average throughput and energy efficiency of the network, respectively.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it