Logo image
Random access channel assignment on a collision erasure channel
Conference proceeding

Random access channel assignment on a collision erasure channel

Abhinanda Dutta, Steven Weber and IEEE
2020 INFORMATION THEORY AND APPLICATIONS WORKSHOP (ITA), pp 1-11
02 Feb 2020

Abstract

Computer Science, Information Systems Computer Science, Interdisciplinary Applications Computer Science, Theory & Methods Engineering, Electrical & Electronic Mathematics, Applied Science & Technology Computer Science Engineering Mathematics Physical Sciences Technology
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 radios to M available channels with the objective of maximizing the sum throughput. The difficulty lies in the facts that i) the radios connect to the access point (or gateway) over independent erasure channels and ii) the radios are subject to collision, i.e., if two or more packets arrive at the access point on the same channel then all such packets "collide" and are lost. The problem is approached by defining lower and upper bounds on the throughput, and then extremizing the bounds. Initial numerical results for M = 2 channels suggest i) there is notable variation in sum throughput across problem instances, but ii) the impact of scheduling on the throughput for a given problem instance is relatively small.

Metrics

20 Record Views
2 citations in Scopus

Details

UN Sustainable Development Goals (SDGs)

This publication has contributed to the advancement of the following goals:

#11 Sustainable Cities and Communities

InCites Highlights

Data related to this publication, from InCites Benchmarking & Analytics tool:

Web of Science research areas
Computer Science, Information Systems
Computer Science, Interdisciplinary Applications
Computer Science, Theory & Methods
Engineering, Electrical & Electronic
Mathematics, Applied
Logo image