ArticleSensors (Basel, Switzerland)2022
SF-Partition-Based Clustering and Relaying Scheme for Resolving Near-Far Unfairness in IoT Multihop LoRa Networks.
Article in Sensors (Basel, Switzerland), 2022. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 3 papers.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
3 citing papers in PubMed.
- ConvLoRa: Convolutional Neural Network-Based Collision Demodulation for LoRa Uplinks in LEO-IoT.Sensors (Basel, Switzerland) · 2026Article
- A Nature-Inspired Approach to Energy-Efficient Relay Selection in Low-Power Wide-Area Networks (LPWAN).Sensors (Basel, Switzerland) · 2024Article
- Implicit Overhearing Node-Based Multi-Hop Communication Scheme in IoT LoRa Networks.Sensors (Basel, Switzerland) · 2023Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
5 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
Long range (LoRa) is one of the most successful low-power wide-area networking technologies because it is ideally suited for long-distance, low-bit rate, and low-power communications in the unlicensed sub-GHz spectrum utilized for Internet of things (IoT) networks. The effectiveness of LoRa depends on the link budget (i.e., spreading factor (SF), bandwidth (BW), and transmission power (TX)). Due to the near-far effect, the allocation of a link budget to LoRa devices (LDs) in large coverage regions is unfair between them depending on their distance to the GW. Thus, more transmission opportunities are given to some LDs to the detriment of other LD's opportunities. Numerous studies have been conducted to address the prevalent near-far fairness problem. Due to the absence of a tractable analytical model for fairness in the LoRa network, however, it is still difficult to solve this problem completely. Thus, we propose an SF-partition-based clustering and relaying (SFPCR) scheme to achieve enormous LD connectivity with fairness in IoT multihop LoRa networks. For the SF partition, the SFPCR scheme determines the suitable partitioning threshold point for bridging packet delivery success probability gaps between SF regions, namely, the lower SF zone (LSFZ) and the higher SF zone (HSFZ). To avoid long-distance transmissions to the GW, the HSFZ constructs a density-based subspace clustering that generates clusters of arbitrary shape for adjacent LDs and selects cluster headers by using a binary score representation. To support reliable data transmissions to the GW by multihop communications, the LSFZ offers a relay LD selection that ideally chooses the best relay LD to extend uplink transmissions from LDs in the HSFZ. Through simulations, we show that the proposed SFPCR scheme exhibits the highest success probability of 65.7%, followed by the FSRC scheme at 44.6%, the mesh scheme at 34.2%, and lastly the cluster-based scheme at 29.4%, and it conserves the energy of LDs compared with the existing schemes.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.