Latency of Concatenating Unlicensed LPWAN with Cellular IoT: An Experimental QoE Study
Bibliographic record
Abstract
Developing low-power wide-area network (LPWAN) solutions that are efficient to adopt, deploy and maintain are vital for smart cities. The poor quality-of-service of unlicensed LPWAN, and the high service cost of LTE-M/NB-IoT are key disadvantages of these technologies. Concatenating unlicensed with licensed LPWANs can overcome these limitations and harness their benefits. However, a concatenated LPWAN architecture will inevitably result in excess latency which may impact users’ quality-of-experience (QoE). To evaluate the real-life feasibility of this system, we first propose a concatenated LPWAN architecture and experimentally measure the statistics of end-to-end (E2E) latencies. The concatenated delay margin is determined by benchmarking the latencies with different LPWAN architecture schemes, namely with unlicensed IoT (standalone LoRa), cellular IoT (standalone LTE-M), and concatenated IoT (LoRa interfaced with LTE-M). Through extensive experimental measurement campaigns of 30,000 data points of E2E latencies, we show that the excess delay due to LPWAN interfacing introduces on average less than 300 milliseconds. With a users’ QoE satisfaction of 95%, we also found that concatenated LPWAN outperforms unlicensed IoT by roughly 1.5 s. Overall, the result suggests that a concatenated LPWAN is technically feasible and offers an affordable alternative for real-world smart city deployment.
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.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 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".