MétaCan
Menu
Back to cohort
Record W4292825909 · doi:10.1109/lwc.2022.3200912

On the Scalability of Duty-Cycled LoRa Networks With Imperfect SF Orthogonality

2022· article· en· W4292825909 on OpenAlexaff
Yathreb Bouazizi, Fatma Benkhelifa, Hesham ElSawy, Julie A. McCann

Bibliographic record

VenueIEEE Wireless Communications Letters · 2022
Typearticle
Languageen
FieldEngineering
TopicIoT Networks and Protocols
Canadian institutionsQueen's University
Fundersnot available
KeywordsScalabilityOrthogonalityKronecker deltaComputer scienceTheoretical computer scienceTopology (electrical circuits)AlgorithmMathematicsCombinatoricsPhysicsGeometry

Abstract

fetched live from OpenAlex

This letter uses stochastic geometry and queuing theory to study the scalability of long-range (LoRa) networks, accounting for duty cycling restrictions and imperfect spreading factor (SFs) orthogonality. The scalability is characterised by the joint boundaries of device density and traffic intensity per device. Novel cross-correlation factors are used to quantify imperfect SF-orthogonality. Our results show that a proper characterisation of LoRa orthogonality extends the scalability of the network. They also highlight that for low/medium densities decreasing the SF extends the spanned spectrum of sensing applications characterised by their traffic requirements (i.e., sensing rate). However, for high density$(>10^{4}$nodes/Km$^{2}$), the Pareto frontiers converge to a stability limit governed by the SF allocation scheme and the predefined capture thresholds. The results further evince the importance of capturing threshold distribution among the SFs to mitigate the unfair latency.

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 imitation

Not 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.

metaresearch head score (Codex)0.003
metaresearch head score (Gemma)0.010
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.006
Threshold uncertainty score0.014

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.010
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.002
Scholarly communication0.0010.003
Open science0.0010.002
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.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.

Opus teacher head0.017
GPT teacher head0.228
Teacher spread0.211 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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".

Quick stats

Citations12
Published2022
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Wireless Communications LettersSame topicIoT Networks and ProtocolsFrench-language works237,207