# Multi-Channel Random Access with Replications

## TL;DR

This paper introduces a multi-channel random access algorithm that uses message replicas to reduce access delay, providing theoretical bounds and a practical approach that approaches optimal performance.

## Contribution

It proposes a novel access control algorithm utilizing message replicas and develops theoretical bounds for delay performance in multi-channel settings.

## Key findings

- The hypothetical algorithm provides a lower estimate for access delay.
- The proposed feasible algorithm achieves low delay close to the theoretical lower bound.
- Performance can be approximated by a simple lower bound for many channels.

## Abstract

This paper considers a class of multi-channel random access algorithms, where contending devices may send multiple copies (replicas) of their messages to the central base station. We first develop a hypothetical algorithm that delivers a lower estimate for the access delay performance within this class. Further, we propose a feasible access control algorithm achieving low access delay by sending multiple message replicas, which approaches the performance of the hypothetical algorithm. The resulting performance is readily approximated by a simple lower bound, which is derived for a large number of channels.