Our system is currently under heavy load due to increased usage. We're actively working on upgrades to improve performance. Thank you for your patience.
2022
DOI: 10.1109/tcomm.2022.3146289
|View full text |Cite
|
Sign up to set email alerts
|

Performance Analysis and Resource Allocation for a Relaying LoRa System Considering Random Nodal Distances

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
11
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
5
1
1

Relationship

1
6

Authors

Journals

citations
Cited by 9 publications
(11 citation statements)
references
References 45 publications
0
11
0
Order By: Relevance
“…Nodes are clustered into high and low SF groups, with the GWs and relays selecting clusters using the naive Bayes algorithm. [22] introduces a two-hop amplify-and-forward relaying LoRa network, where the GW optimizes SF and power allocation to maximize data rates. The LoRaHop protocol presented in [23] extends LoRaWAN protocols by forming a mesh network that enables concurrent transmissions to relay UL and down-link (DL) packets without collision, allowing any node to transmit to the GW without interference.…”
Section: Related Workmentioning
confidence: 99%
“…Nodes are clustered into high and low SF groups, with the GWs and relays selecting clusters using the naive Bayes algorithm. [22] introduces a two-hop amplify-and-forward relaying LoRa network, where the GW optimizes SF and power allocation to maximize data rates. The LoRaHop protocol presented in [23] extends LoRaWAN protocols by forming a mesh network that enables concurrent transmissions to relay UL and down-link (DL) packets without collision, allowing any node to transmit to the GW without interference.…”
Section: Related Workmentioning
confidence: 99%
“…Since the sum throughput expression in (36) is intractable, we consider a derivative-free optimization method to obtain the optimal solution, which is practical without the computation of gradients [52]. It is difficult to solve the optimization problem using the exhaustive search method in an acceptable time with the increase in network scale.…”
Section: B Proposed Pso-pa Algorithmmentioning
confidence: 99%
“…With the proposed GA-TAPA algorithm, which keeps the feature of GA, the numerical optimized results can be obtained. This derivative-free optimization is practical because it does not require the computation of gradients [41].…”
Section: B Proposed Algorithmmentioning
confidence: 99%