Maximum Asymptotic Stable Throughput of Opportunistic Slotted ALOHA and Applications to CDMA Networks

In this paper we study the maximum asymptotic stable throughput of an opportunistic slotted ALOHA protocol. We provide a characterization of the maximum stable throughput as the number of users in the system goes to infinity. We then apply our findings to CDMA networks with the signal-to-interference-ratio (SIR) threshold model. It is shown that the slotted ALOHA protocol with the power/transmission control rule that equalizes the reception powers achieves 1 - O(logN/radicN) channel utilization, which is defined as the throughput divided by the optimal throughput N achieved by scheduling. This implies that the slotted ALOHA is asymptotically optimal in the sense that its channel utilization converges to 1 as the spreading gain goes to infinity

[1]  Randall A. Berry,et al.  A distributed splitting algorithm for exploiting multiuser diversity , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[2]  Lang Tong,et al.  Exploiting decentralized channel state information for random access , 2005, IEEE Transactions on Information Theory.

[3]  Lang Tong,et al.  Sensitivity and Coding of Opportunistic ALOHA in Sensor Networks with Mobile Access , 2005, J. VLSI Signal Process..

[4]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[5]  Lang Tong,et al.  Sensor networks with mobile access: optimal random access and coding , 2004, IEEE Journal on Selected Areas in Communications.

[6]  Raymond Knopp,et al.  Information capacity and power control in single-cell multiuser communications , 1995, Proceedings IEEE International Conference on Communications ICC '95.

[7]  Randall Berry,et al.  Exploiting multiuser diversity for medium access control in wireless networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[8]  David Tse,et al.  Linear Multiuser Receivers: Effective Interference, Effective Bandwidth and User Capacity , 1999, IEEE Trans. Inf. Theory.