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

Yathreb Bouazizi; Fatma Benkhelifa; Hesham ElSawy; Julie A. McCann

doi:10.1109/lwc.2022.3200912

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

Yathreb Bouazizi, Fatma Benkhelifa, Hesham ElSawy, Julie A. McCann

Research Centre for Computational Science and Mathematical Modelling

Research output: Contribution to journal › Article › peer-review

3 Citations (Scopus)

70 Downloads (Pure)

Abstract

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

Original language	English
Pages (from-to)	2310-2314
Number of pages	5
Journal	IEEE Wireless Communications Letters
Volume	11
Issue number	11
Early online date	23 Aug 2022
DOIs	https://doi.org/10.1109/lwc.2022.3200912
Publication status	Published - 1 Nov 2022

Bibliographical note

© 2022 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

Copyright © and Moral Rights are retained by the author(s) and/ or other copyright owners. A copy can be downloaded for personal non-commercial research or study, without prior permission or charge. This item cannot be reproduced or quoted extensively from without first obtaining permission in writing from the copyright holder(s). The content must not be changed in any way or sold commercially in any format or medium without the formal permission of the copyright holders.

This document is the author’s post-print version, incorporating any revisions agreed during the peer-review process. Some differences between the published version and this version may remain and you are advised to consult the published version if you wish to cite from it.

Keywords

LoRa
SF-allocation
coverage probability
queuing theory
stability analysis
stochastic geometry

ASJC Scopus subject areas

Control and Systems Engineering
Electrical and Electronic Engineering

Access to Document

10.1109/lwc.2022.3200912

Post-PrintAccepted author manuscript, 1.22 MB

Cite this

@article{f20d2bda64b949cf978828f304f26083,

title = "On the Scalability of Duty-Cycled LoRa Networks with Imperfect SF Orthogonality",

abstract = "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 (>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.",

keywords = "LoRa, SF-allocation, coverage probability, queuing theory, stability analysis, stochastic geometry",

author = "Yathreb Bouazizi and Fatma Benkhelifa and Hesham ElSawy and McCann, {Julie A.}",

note = "{\textcopyright} 2022 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. Copyright {\textcopyright} and Moral Rights are retained by the author(s) and/ or other copyright owners. A copy can be downloaded for personal non-commercial research or study, without prior permission or charge. This item cannot be reproduced or quoted extensively from without first obtaining permission in writing from the copyright holder(s). The content must not be changed in any way or sold commercially in any format or medium without the formal permission of the copyright holders. This document is the author{\textquoteright}s post-print version, incorporating any revisions agreed during the peer-review process. Some differences between the published version and this version may remain and you are advised to consult the published version if you wish to cite from it. ",

year = "2022",

month = nov,

day = "1",

doi = "10.1109/lwc.2022.3200912",

language = "English",

volume = "11",

pages = "2310--2314",

journal = "IEEE Wireless Communications Letters",

issn = "2162-2337",

publisher = "IEEE",

number = "11",

}

TY - JOUR

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

AU - Bouazizi, Yathreb

AU - Benkhelifa, Fatma

AU - ElSawy, Hesham

AU - McCann, Julie A.

N1 - © 2022 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. Copyright © and Moral Rights are retained by the author(s) and/ or other copyright owners. A copy can be downloaded for personal non-commercial research or study, without prior permission or charge. This item cannot be reproduced or quoted extensively from without first obtaining permission in writing from the copyright holder(s). The content must not be changed in any way or sold commercially in any format or medium without the formal permission of the copyright holders. This document is the author’s post-print version, incorporating any revisions agreed during the peer-review process. Some differences between the published version and this version may remain and you are advised to consult the published version if you wish to cite from it.

PY - 2022/11/1

Y1 - 2022/11/1

N2 - 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 (>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.

AB - 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 (>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.

KW - LoRa

KW - SF-allocation

KW - coverage probability

KW - queuing theory

KW - stability analysis

KW - stochastic geometry

UR - http://www.scopus.com/inward/record.url?scp=85137606096&partnerID=8YFLogxK

U2 - 10.1109/lwc.2022.3200912

DO - 10.1109/lwc.2022.3200912

M3 - Article

SN - 2162-2337

VL - 11

SP - 2310

EP - 2314

JO - IEEE Wireless Communications Letters

JF - IEEE Wireless Communications Letters

IS - 11

ER -

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

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this