Capacity of time-slotted ALOHA packetized multiple-access systems over the AWGN channel

We study different notions of capacity for time-slotted ALOHA systems. In these systems, multiple users synchronously send packets in a bursty manner over a common additive white Gaussian noise (AWGN) channel. The users do not coordinate their transmissions, which may collide at the receiver. For such a system, we define both single-slot capacity and multiple-slot capacity. We then construct a coding and decoding scheme for single-slot capacity that achieves any rate within this capacity region. This coding and decoding scheme for a single time slot combines aspects of multiple access rate splitting and of broadcast codes for degraded AWGN channels. This design allows some bits to be reliably received even when collisions occur and more bits to be reliably received in the absence of collisions. The exact number of bits reliably received under both of these scenarios is part of the code design process, which we optimize to maximize the expected rate in each slot. Next, we examine the behavior of the system asymptotically over multiple slots. We show that there exist coding and decoding strategies such that regardless of the burstiness of the traffic, the system is stable as long as the average rate of the users is within the multiple access capacity region of the channel. In other words, we show that bursty traffic does not decrease the Cover-Wyner capacity region of the multiple access channel. A vast family of codes, which includes the type of codes we introduce for the single-slot transmission, achieve the capacity region, in a sense we define, for multiple-slot transmissions. These codes are stabilizing, using only local information at each of the individual queues. The use of information regarding other queues or the use of scheduling does not improve the multiple-slot capacity region.

[1]  J. Wolfowitz Coding Theorems of Information Theory , 1962, Ergebnisse der Mathematik und Ihrer Grenzgebiete.

[2]  Jacob Wolfowitz Coding Theorems of Information Theory , 1962 .

[3]  D. A. Bell,et al.  Information Theory and Reliable Communication , 1969 .

[4]  Norman M. Abramson,et al.  THE ALOHA SYSTEM: another alternative for computer communications , 1899, AFIPS '70 (Fall).

[5]  Rudolf Ahlswede,et al.  Multi-way communication channels , 1973 .

[6]  Patrick P. Bergmans,et al.  A simple converse for broadcast channels with additive white Gaussian noise (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[7]  M. Ferguson,et al.  On the Control, Stability, and Waiting Time in a Slotted ALOHA Random-Access System , 1975, IEEE Trans. Commun..

[8]  Leonard Kleinrock,et al.  Packet Switching in a Multiaccess Broadcast Channel: Dynamic Control Procedures , 1975, IEEE Trans. Commun..

[9]  Thomas M. Cover,et al.  An achievable rate region for the broadcast channel , 1975, IEEE Trans. Inf. Theory.

[10]  Norman Abramson,et al.  The Throughput of Packet Broadcasting Channels , 1977, IEEE Trans. Commun..

[11]  John Ippocratis Capetanakis The multiple access broadcast channel : protocol and capacity considerations. , 1977 .

[12]  J. Hayes,et al.  An Adaptive Technique for Local Distribution , 1978, IEEE Trans. Commun..

[13]  Jacob Wolfowitz,et al.  Multiple Access Channels , 1978 .

[14]  Anthony Ephremides,et al.  Analysis, stability, and optimization of slotted ALOHA with a finite number of buffered users , 1980 .

[15]  A. Ephremides,et al.  Analysis, stability, and optimization of slotted ALOHA with a finite number of buffered users , 1980, 1980 19th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.

[16]  J. Massey Collision-Resolution Algorithms and Random-Access Communications , 1981 .

[17]  Nicholas Pippenger,et al.  Bounds on the performance of protocols for a multiple-access broadcast channel , 1981, IEEE Trans. Inf. Theory.

[18]  Linn I. Sennott,et al.  A queueing model for analysis of a bursty multiple-access communication channel , 1981, IEEE Trans. Inf. Theory.

[19]  Dipankar Raychaudhuri,et al.  Performance Analysis of Random Access Packet-Switched Code Division Multiple Access Systems , 1981, IEEE Trans. Commun..

[20]  Bruce Hajek,et al.  Decentralized dynamic control of a multiaccess broadcast channel , 1982 .

[21]  Erdal Arıkan Multi-access in packet radio networks , 1982 .

[22]  D. Towsley,et al.  On the instability of slotted ALOHA multiaccess algorithm , 1983 .

[23]  Toby Berger,et al.  Delay analysis of interval-searching contention resolution algorithms , 1985, IEEE Trans. Inf. Theory.

[24]  Pierre A. Humblet,et al.  A Class of Efficient Contention Resolution Algorithms for Multiple Access Channels , 1985, IEEE Trans. Commun..

[25]  BORIS S. TSYBAKOV Survey of USSR contributions to random multiple-access communications , 1985, IEEE Trans. Inf. Theory.

[26]  János Komlós,et al.  An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels , 1985, IEEE Trans. Inf. Theory.

[27]  James L. Massey,et al.  The collision channel without feedback , 1985, IEEE Trans. Inf. Theory.

[28]  Donald F. Towsley,et al.  On the throughput of degenerate intersection and first-come first-served collision resolution algorithms , 1985, IEEE Trans. Inf. Theory.

[29]  Bruce E. Hajek Stochastic approximation methods for decentralized control of multiaccess communications , 1985, IEEE Trans. Inf. Theory.

[30]  John A. Silvester,et al.  Slotted Random Access Spread-Spectrum Networks: An Analytical Framework , 1987, IEEE J. Sel. Areas Commun..

[31]  Ronald L. Rivest,et al.  Network control by Bayesian broadcast , 1987, IEEE Trans. Inf. Theory.

[32]  Anthony Ephremides,et al.  On the stability of interacting queues in a multiple-access system , 1988, IEEE Trans. Inf. Theory.

[33]  Sang Wu Kim Stabilization of Slotted ALOHA Spread-Spectrum Communication Networks , 1990, IEEE J. Sel. Areas Commun..

[34]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[35]  Venkat Anantharam The stability region of the finite-user slotted ALOHA protocol , 1991, IEEE Trans. Inf. Theory.

[36]  Richard L. Tweedie,et al.  Markov Chains and Stochastic Stability , 1993, Communications and Control Engineering Series.

[37]  Lazaros F. Merakos,et al.  Throughput performance of multiuser detection in unslotted contention channels , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[38]  Shlomo Shamai,et al.  Information theoretic considerations for cellular mobile radio , 1994 .

[39]  Sergio Verdú,et al.  A general formula for channel capacity , 1994, IEEE Trans. Inf. Theory.

[40]  Felix Tarköy Information-theoretic aspects of spread ALOHA , 1995, PIMRC.

[41]  Rudiger Urbanke,et al.  Single user coding for the discrete memoryless multiple access channel , 1995, Proceedings of 1995 IEEE International Symposium on Information Theory.

[42]  Rüdiger L. Urbanke,et al.  A rate-splitting approach to the Gaussian multiple-access channel , 1996, IEEE Trans. Inf. Theory.

[43]  Shlomo Shamai,et al.  A broadcast strategy for the Gaussian slowly fading channel , 1997, Proceedings of IEEE International Symposium on Information Theory.

[44]  Vijay K. Bhargava,et al.  Maximum-likelihood decoding and code combining for DS/SSMA slotted ALOHA , 1994, IEEE Trans. Commun..

[45]  David Tse,et al.  Multiaccess Fading Channels-Part II: Delay-Limited Capacities , 1998, IEEE Trans. Inf. Theory.

[46]  A. Goldsmith,et al.  Capacity definitions and coding strategies for general channels with receiver side information , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[47]  G. Caire,et al.  Concatenated coding for packet transmission over the collision channel , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[48]  E. Biglieri,et al.  Minimum outage probability for slowly-varying fading channels , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[49]  Ari Hottinen,et al.  Utilization of spread ALOHA with multiuser detection , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[50]  Thomas M. Cover,et al.  Comments on Broadcast Channels , 1998, IEEE Trans. Inf. Theory.

[51]  Shlomo Shamai,et al.  Fading Channels: Information-Theoretic and Communication Aspects , 1998, IEEE Trans. Inf. Theory.

[52]  Shlomo Shamai,et al.  A low delay algorithm for the multiple access channel with Rayleigh fading , 1998, Ninth IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (Cat. No.98TH8361).

[53]  Seong-Jun Oh,et al.  Dynamic spreading gain control in multiservice CDMA networks , 1999, IEEE J. Sel. Areas Commun..

[54]  Andrea J. Goldsmith,et al.  Capacity of time-slotted ALOHA systems , 1999, WCNC. 1999 IEEE Wireless Communications and Networking Conference (Cat. No.99TH8466).

[55]  Randall Berry,et al.  Power and delay trade-offs in fading channels , 2000 .

[56]  Shlomo Shamai A broadcast approach for the multiple-access slow fading channel , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[57]  Hiroshi Suzuki,et al.  Slotted ALOHA mobile packet communication systems with multiuser detection in a base station , 2000, IEEE Trans. Veh. Technol..

[58]  I. Bettesh,et al.  Outage analysis for multiple access channel with Rayleigh fading , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[59]  M. Medard,et al.  Capacity of time-slotted ALOHA systems , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[60]  Giuseppe Caire,et al.  ARQ protocols for the Gaussian collision channel , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[61]  Elif Uysal-Biyikoglu,et al.  Energy-efficient packet transmission over a wireless link , 2002, TNET.

[62]  David Tse,et al.  Opportunistic beamforming using dumb antennas , 2002, IEEE Trans. Inf. Theory.

[63]  M. Médard,et al.  Reliable Architectures for Networks under Stress , 2003 .

[64]  A. Sridharan Broadcast Channels , 2022 .