Wireless channel dynamics for relay selection under ultra-reliable low-latency communication

↓ Direkt till sidans innehåll
↓ Direkt till sidans sekundära innehåll (sidomenyn)

Search: id:"swepub:oai:lup.lub.lu.se:c3aa0a71-81e8-43a5-a2d4-5a94460896b0" > Wireless channel dy...

1 of 1
Previous record
Next record
To hitlist

Details
MARC

Rigge, PaulUniversity of California, Berkeley (author)

Wireless channel dynamics for relay selection under ultra-reliable low-latency communication

Article/chapterEnglish2020

Publisher, publication year, extent ...

2020
electronicrdacarrier

Numbers

LIBRIS-ID:oai:lup.lub.lu.se:c3aa0a71-81e8-43a5-a2d4-5a94460896b0
https://lup.lub.lu.se/record/c3aa0a71-81e8-43a5-a2d4-5a94460896b0URI
https://doi.org/10.1109/PIMRC48278.2020.9217210DOI

Supplementary language notes

Language:English
Summary in:English

Part of subdatabase

SwePubSwePub

Classification

Subject category:kon swepub-publicationtype
Subject category:ref swepub-contenttype

Notes

Ultra-reliable, low-latency communication (URLLC) is being developed to support critical control applications over wireless networks. Exploiting spatial diversity through relays is a promising technique for achieving the stringent requirements of URLLC, but coordinating relays reliably and with low overhead is a challenge. Adaptive relay selection techniques have been proposed as a way to simplify implementation while still achieving the requirements of URLLC. Identifying good relays with low overhead and high confidence is critical for such adaptive relay selection techniques.Channel dynamics must be taken into account by adaptive relay selection algorithms because channel quality may degrade in the time it takes to estimate the relay's channel and schedule a transmission. Spatial channel dynamics are well studied in many settings such as RADAR and the fast-fading wireless channels, but less so in the URLLC context where rare events neglected in other models may be important. In this work, we perform measurements to validate channel models in the slow fading regime of interest. We compare measurements to Jakes's model and discuss the appropriateness of Jakes's model for URLLC relay selection. This is further applied to demonstrate that easily implementable relay selection techniques perform well in practical settings.Polynomial interpolation and neural-net-based algorithms were evaluated as channel prediction algorithms. These techniques perform orders of magnitude better than relay selection on average (nominal) SNR.

Subject headings and genre

Added entries (persons, corporate bodies, meetings, titles ...)

Swamy, Vasuki NarasimhaIntel Corporation, USA (author)
Nelson, ChristianLund University,Lunds universitet,Kommunikationsteknologi,Forskargrupper vid Lunds universitet,Communications Engineering,Lund University Research Groups(Swepub:lu)ch0455ne (author)
Tufvesson, FredrikLund University,Lunds universitet,Kommunikationsteknologi,Forskargrupper vid Lunds universitet,Communications Engineering,Lund University Research Groups(Swepub:lu)es-ftu (author)
Sahai, AnantUniversity of California, Berkeley (author)
Nikolic, BorivojeUniversity of California, Berkeley (author)
University of California, BerkeleyIntel Corporation, USA (creator_code:org_t)

Related titles

In:2020 IEEE 31st Annual International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC 20202020-August9781728144900

Internet link

Find in a library

2020 IEEE 31st Annual International Symposium on Personal, Indoor and Mobile Rad... (Search for host publication in LIBRIS)

To the university's database

1 of 1
Previous record
Next record
To hitlist

Find more in SwePub

By the author/editor: Rigge, Paul; Swamy, Vasuki Na ...; Nelson, Christia ...; Tufvesson, Fredr ...; Sahai, Anant; Nikolic, Borivoj ...

About the subject

ENGINEERING AND TECHNOLOGY: ENGINEERING AND ...; and Electrical Engin ...; and Communication Sy ...

Articles in the publication: 2020 IEEE 31st A ...

By the university: Lund University

Search outside SwePub

Extend your search to:: Google; Google Book Search; Google Scholar

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

LIBRIS.kb.se