Random-Access Poisson Networks: Stability and Delay

We consider a Poisson network of sources, each with a destination at a given distance and a buffer of infinite capacity. Assuming independent Bernoulli arrivals, we characterize the stability region when one or two classes of users are present in the network. We then derive a fixed-point equation that determines the success probability of the typical source-destination link and evaluate the mean delay at each buffer.

[1]  W. Szpankowski Stability conditions for some distributed systems: buffered random access systems , 1994, Advances in Applied Probability.

[2]  Lang Tong,et al.  Stability and delay of finite-user slotted ALOHA with multipacket reception , 2005, IEEE Transactions on Information Theory.

[3]  François Baccelli,et al.  Stochastic Geometry and Wireless Networks, Volume 2: Applications , 2009, Found. Trends Netw..

[4]  François Baccelli,et al.  Stochastic geometry and wireless networks , 2009 .

[5]  Gaston H. Gonnet,et al.  On the LambertW function , 1996, Adv. Comput. Math..

[6]  Jeffrey G. Andrews,et al.  Stochastic geometry and random graphs for the analysis and design of wireless networks , 2009, IEEE Journal on Selected Areas in Communications.

[7]  R. M. Loynes,et al.  The stability of a queue with non-independent inter-arrival and service times , 1962, Mathematical Proceedings of the Cambridge Philosophical Society.

[8]  Wei Luo,et al.  Stability of N interacting queues in random-access systems , 1999, IEEE Trans. Inf. Theory.