Throughput Region of Random-Access Networks of General Topology

A random-access model is introduced and studied, which is a generalization of the classical slotted Aloha model. Unlike in the slotted Aloha, where two or more simultaneous transmissions on any subset of links collide and “erase” each other, a quite general interference structure is considered, where transmission on link i erases a simultaneous transmission on link j with some fixed probability φij. In particular, it is allowed that φij ≠ φji, which captures possible asymmetric interference in real-most notably wireless-communication networks. Results characterizing the maximum achievable link throughput region and its Pareto boundary are derived. In some cases, the Pareto boundary characterization is almost as simple and explicit as that derived in prior work for the classical slotted Aloha system.

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

[2]  Karel A. Post.  Convexity of the nonachievable rate region for the collision channel without feedback , 1985, IEEE Trans. Inf. Theory.

[3]  Alexander L. Stolyar,et al.  Random-access scheduling with service differentiation in wireless networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[4]  H. Vincent Poor,et al.  Queue Back-Pressure Random Access in Multihop Wireless Networks: Optimality and Stability , 2009, IEEE Transactions on Information Theory.

[5]  P. Gupta,et al.  Optimal Throughput Allocation in General Random-Access Networks , 2006, 2006 40th Annual Conference on Information Sciences and Systems.

[6]  WalrandJean,et al.  A distributed CSMA algorithm for throughput and utility maximization in wireless networks , 2010 .

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

[8]  Leandros Tassiulas,et al.  Achieving proportional fairness using local information in Aloha networks , 2004, IEEE Transactions on Automatic Control.

[9]  Jean C. Walrand,et al.  Distributed Random Access Algorithm: Scheduling and Congestion Control , 2009, IEEE Transactions on Information Theory.

[10]  Frank Kelly,et al.  Mathematical Modelling of the Internet , 2001 .

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

[12]  Alexander L. Stolyar.  Dynamic Distributed Scheduling in Random Access Networks , 2005 .

[13]  Stuart C. Schwartz,et al.  Stability properties of slotted Aloha with multipacket reception capability , 1988 .

[14]  Xin Wang,et al.  Distributed Algorithms for Max-Min Fair Rate Allocation in ALOHA Networks , 2004 .