2021
DOI: 10.1109/jiot.2020.3020189
|View full text |Cite
|
Sign up to set email alerts
|

A Novel Collision-Aware Adaptive Data Rate Algorithm for LoRaWAN Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
25
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
8
2

Relationship

1
9

Authors

Journals

citations
Cited by 53 publications
(25 citation statements)
references
References 30 publications
0
25
0
Order By: Relevance
“…The ADR algorithm is specifically designed to increase the data rate and reduce the energy consumed by the ED. It is not specified in the standard; however, Semtech provides a recommendation in [23] and most of NSs, to the best of our knowledge, operate based on it; its performance has been evaluated in [24]. Note that ADR should be used only if an ED operates in sufficiently stable RF conditions (e.g., static devices with fixed locations).…”
mentioning
confidence: 99%
“…The ADR algorithm is specifically designed to increase the data rate and reduce the energy consumed by the ED. It is not specified in the standard; however, Semtech provides a recommendation in [23] and most of NSs, to the best of our knowledge, operate based on it; its performance has been evaluated in [24]. Note that ADR should be used only if an ED operates in sufficiently stable RF conditions (e.g., static devices with fixed locations).…”
mentioning
confidence: 99%
“…In [142], a new ADR algorithm called CA-ADR is proposed for the LoRaWAN network to assign data rates to EDs by taking the collision probability at the MAC layer into account. The new algorithm was compared to two benchmark solutions using simulation and experimental approaches under different performance metrics.…”
Section: ) Allocation Schemementioning
confidence: 99%
“…R k is the probability that an ED of SF k is active (i.e. in transmission mode); T in,k is the average packet inter arrival time and it is assumed to be the same for all SFs, i.e., T in,k = T in , ∀k; R k is the bit rate of SF k and is given by R k = k Bw 2 k 4 4+Cr [2]; and L pac,k is the packet length (in bits) of SF k and is given by [21] L pac,k = k ((N pre + 4.25)+8+…”
Section: A Coverage Probabilitymentioning
confidence: 99%