On the Scalability of Duty-Cycled LoRa Networks With Imperfect SF Orthogonality
- Resource Type
- Authors
- Yathreb Bouazizi; Fatma Benkhelifa; Hesham ElSawy; Julie A. McCann
- Source
- IEEE Wireless Communications Letters. 11:2310-2314
- Subject
- Technology
Science & Technology
Computer Science, Information Systems
stochastic geometry
coverage probability
Engineering, Electrical & Electronic
0805 Distributed Computing
stability analysis
LoRa
0906 Electrical and Electronic Engineering
Engineering
SF-allocation
Control and Systems Engineering
Computer Science
Telecommunications
1005 Communications Technologies
queuing theory
Electrical and Electronic Engineering
- Language
- ISSN
- 2162-2345
2162-2337
This papers uses stochastic geometry and queuing theory to study he 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 SForthogonality. 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 (> 104 nodes/Km2 ), 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.