Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 196

The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.

Multi-Hop LoRa Networks Enabled by Concurrent Transmission

Open access
Liao, Chun-Hao, Zhu, Guibing, Kuwabara, Daiki, Suzuki, Makoto, Morikawa, Hiroyuki · 2017 · IEEE Access

Abstract

In this paper, we strive to construct an efficient multi-hop network based on the sub-GHz low-power wide-area technology. Specifically, we investigate the combination of LoRa, a physical-layer standard that can provide several-kilometer outdoor coverage, and concurrent transmission (CT), a recently proposed multi-hop protocol that can significantly improve the network efficiency. The main contributions of this paper are threefold. 1) Since the CT enhances the network efficiency by allowing synchronized packet collisions, the performance of the physical-layer receiver under such packet collisions needs to be carefully examined to ensure the network reliability. We first extensively evaluate the LoRa receiver performance under CT to verify that LoRa is compatible to CT. Specifically, we find that, due to the time-domain and frequency-domain energy spreading effect, LoRa is robust to the packet collisions resulting from CT. 2) We further find the receiver performance under CT can be further improved by introducing timing offsets between the relaying packets. In view of this, we propose a timing delay insertion method, the offset-CT method, that adds random timing delay before the packets while preventing the timing offset from diverging over the multi-hop network. 3) We conduct proof-of-concept experiments to demonstrate the feasibility of CT-based LoRa multi-hop network and the performance improvement brought by the proposed offset-CT method.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/access.2017.2755858

Cites

3 of 3 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 3 references

Cited by

Metadata

Authors
Liao, C.-H., Zhu, G., Kuwabara, D., Suzuki, M., & Morikawa, H.
Venue
IEEE Access
Published
2017
Volume
5
Pages
21430-21446
ISSN
2169-3536 (ISSN-L)
OpenAlex
W2756782458
Cited by
196
References
3
FWCI
9.17
Type
journal article
Language
en
Open access
gold

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.