User capacity scaling laws for fading multiple-access channels

In this paper, the maximum number of simultaneous active transmitters (i.e. user capacity) is obtained in the many user case for fading multiple-access channels in which a minimum rate must be maintained for all active users. The results are presented in the form of scaling laws as the number of transmitters increases and three commonly used fading models, namely, Rayleigh, Rician and Nakagami are considered. It is shown that in all three cases, the user capacity scales double logarithmically in the number of users and differs only by constants depending on the distributions. We also show that a scheduling policy that maximizes the number of simultaneous active transmitters can be implemented in a distributed fashion.

User capacity, Multiple-access channels, power allocation, throughput