A Comprehensive Comparison in Time-Slotted Frame Protocols in LoRaWAN IoT Technology
Bibliographic record
Abstract
The technologies underpinning low-power wide-area networks (LPWANs) play a crucial role in IoT applications because they fulfil the four major facets that afford successful IoT deployments: long-range, free frequency ISM bands, low-cost, and low energy consumption. Industrial and academic sectors alike have shown keen interest in Long Range Wide Area Network (LoRaWAN) technology due to its networking independence and open standard specification among LPWAN options. In this paper we investigate seven time-slotted medium access protocols as an alternative to LoRaWAN, concentrating on the issues, obstacles, and perspectives for creating time-slotted protocols that utilise LoRa as the physical layer. The Time Slot LoRa Protocols (TSLP) that have been simulated or have a proof-of-concept implementation on testbeds are the primary subject of this paper. Our focus is on Time Slot Frame (TSF) information design, guard time, acknowledgements slot and associated design considerations, as well as demonstrating how each handles numerous LoRa parameter settings, including Spreading Factor (SF), Carrier Frequency (CF), Bandwidth (BW) and Code Rate (CR). Additional information on joining techniques, Scheduling algorithms, synchronisations including acknowledgement, propagation latency, and how these protocols handle Roaming and encryption is also included. As a result of this comprehensive discussion on the factors that should be taken into account, problems to be overcome and potential when building time-slotted protocols, this comparison reveals notable issues and future opportunities which should be of interest to researchers in the field.
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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.004 | 0.007 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.003 | 0.003 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".