Article

User capacity scaling laws for fading multiple-access channels

Dept. of Electr. & Comput. Eng., Univ. of Manitoba, Winnipeg, MB, Canada
IEEE Transactions on Wireless Communications (Impact Factor: 2.76). 10/2009; DOI: 10.1109/TWC.2009.080399
Source: IEEE Xplore

ABSTRACT 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 with the number of users and differs only by constants depending on the distributions. We also show that the scheduling policy maximizing the number of simultaneous active transmitters can be implemented in a distributed fashion.

0 Bookmarks
 · 
74 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, the maximum number of active links supporting a minimum rate is asymptotically obtained in a single-hop wireless network with an arbitrary structure. It is assumed that each source-destination pair communicates through a fading channel; consequently, destinations receive interference from all other active source-destination pairs. Under the assumption of independent Rayleigh fading channels for different source-destination pairs, it is shown that the optimal number of active links is of the order log N with probability approaching one as the total number of nodes, N , tends to infinity. The achievable total throughput is also scales logarithmically with the total number of links/nodes in the network.
  • [Show abstract] [Hide abstract]
    ABSTRACT: It has already been shown that in rate-constrained multi-user channels, under the assumption of independent Rayleigh fading channels for different terminals, the number of active users (i.e. the user capacity) scales with double logarithmically with the total number of users. However, to achieve the aforementioned result, it is assumed that channel state information (CSI) is perfectly known to the receivers. Due to this fact that the gain channel is time variant, CSI can be estimated by empirical algorithms of the channel estimation like Minimum Mean Square Error (MMSE). Considering the errors stemmed from the channel estimation, this paper intends to assess the role of the channel estimator in the analysis of the number of the active users.
    Electrical Engineering (ICEE), 2013 21st Iranian Conference on; 01/2013
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, a broadcast channel is considered in which receivers are randomly distributed on the plane. It is assumed that the x and y coordinates of receivers positions are Gaussian-distributed random variables with the same variance. Hence, the distance between each transmitter–receiver pair and consequently, the path loss term is random. It is shown that as the total number of receivers, n, in the broadcast channel goes to infinity, the maximum number of active receivers (i.e. user capacity) scales with (α/Rmin)lnbn where b = (Rmin P1/α)/(α σ2). Convergence of numerical results to the theoretical bounds in practical situations and the user capacity dependency on system parameters are shown in simulations results.
    AEU - International Journal of Electronics and Communications 01/2014; 68(1):79–83. DOI:10.1016/j.aeue.2013.09.002 · 0.70 Impact Factor

Full-text (4 Sources)

Download
56 Downloads
Available from
Jul 4, 2014