Throughput Optimized Random Access Channel Assignment

Channel assignment for wireless radios employing random access is found in several contexts, including low-power wide area network (LPWAN) protocols such as LoRaWAN. This paper considers the assignment of a set of N colocated random access radios, each with offered load \chi , to M identical wireles...

Full description

Saved in:
Bibliographic Details
Published in2022 58th Annual Allerton Conference on Communication, Control, and Computing (Allerton) pp. 1 - 8
Main Authors Dutta, Abhinanda, Weber, Steven
Format Conference Proceeding
LanguageEnglish
Published IEEE 27.09.2022
Subjects
Channel allocation
channel assignment
collision channel
expected throughput
Load modeling
Low-power wide area networks
Protocols
random access
Throughput
wireless
Wireless communication
wireless scheduling
Online AccessGet full text
DOI10.1109/Allerton49937.2022.9929354

Cover

More Information
Summary:Channel assignment for wireless radios employing random access is found in several contexts, including low-power wide area network (LPWAN) protocols such as LoRaWAN. This paper considers the assignment of a set of N colocated random access radios, each with offered load \chi , to M identical wireless channels with the objective of maximizing the sum throughput, subject to the classical collision model in which a transmission attempt is successful if it is the only attempt in that time slot on that channel. The approximately optimal throughput assignment is characterized, where the approximation is due to the integrality relaxation of the combinatorial problem, in terms of (N, M, \chi) .
DOI:10.1109/Allerton49937.2022.9929354