Stability of Scheduled Multi-access Communication over Quasi-static Flat Fading Channels with Random Coding and Independent Decoding

TL;DR

This paper analyzes the stability of scheduled multiaccess communication over quasi-static fading channels with random coding, showing that certain policies achieve optimal stability regions characterized by interference-limited capacity in the large alphabet limit.

Contribution

It demonstrates that state-independent scheduling policies attain the asymptotic stability region and characterizes this region in the context of quasi-static fading channels with random coding.

Findings

Stability region aligns with interference-limited capacity in large alphabet limit

State-independent policies achieve the asymptotic stability region

Stability region is independent of received signal powers in immediate access limit

Abstract

The stability of scheduled multiaccess communication with random coding and independent decoding of messages is investigated. The number of messages that may be scheduled for simultaneous transmission is limited to a given maximum value, and the channels from transmitters to receiver are quasi-static, flat, and have independent fades. Requests for message transmissions are assumed to arrive according to an i.i.d. arrival process. Then, we show the following: (1) in the limit of large message alphabet size, the stability region has an interference limited information-theoretic capacity interpretation, (2) state-independent scheduling policies achieve this asymptotic stability region, and (3) in the asymptotic limit corresponding to immediate access, the stability region for non-idling scheduling policies is shown to be identical irrespective of received signal powers.