Lightweight Carrier Sensing in LoRa: Implementation and Performance Evaluation
Bibliographic record
Abstract
In LoRa, leading communication technology for the Internet of Things (IoT), the so-called Class A devices are proposed for applications that require low energy consumption. However, the MAC layer of Class A devices is based on pure ALOHA, which performs poorly when the network includes a large number of devices. In this paper, we propose a Lightweight Carrier Sensing (LSC) mechanism for LoRa end devices, which does not include back-off and, thus, results in negligible overhead on end devices. LCS is based on the Channel Activity Detection (CAD) procedure already implemented at the hardware level in all modems based on the standard LoRa chipset. We first theoretically analyze the benefits of LCS on a simplified LoRa network to understand its benefits over pure ALOHA. We present the design and implementation of the proposed LCS and provide measurement results to demonstrate its feasibility in real-world LoRa networks. We have also implemented LCS in a detailed custom-build LoRa simulator to study LCS impact on network energy consumption and scalability in large-scale LoRa networks. Our results show that not only LCS supports more end devices, but also results in significantly lower energy consumption compared to ALOHA, thus efficiently improving network scalability without additional complexity or overhead.
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.002 | 0.005 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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 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".