Maximizing the stable throughput of heterogeneous nodes under airtime fairness in a CSMA environment

The stability region of non-persistent CSMA is analyzed in a general heterogeneous network, where stations have different mean packet arrival rates, packet transmission times probability distributions and transmission probabilities. The considered model of CSMA captures the behavior of the well known CSMA/CA, at least as far as stability and throughput evaluation are concerned. The analysis is done both with and without collision detection. Given the characterization of the stability region, throughput-optimal transmission probabilities are identified under airtime fairness, establishing asymptotic upper and lower bounds of the maximum achievable stable throughput. The bounds turn out to be insensitive to the probability distribution of packet transmission times. Numerical results highlight that the obtained bounds are tight not only asymptotically, but also for essentially all values of the number of stations. The insight gained leads to the definition of a distributed adaptive algorithm to adjust the transmission probabilities of stations so as to attain the maximum stable throughput

Decentralised Learning MACs for Collision-free Access in WLANs

By combining the features of CSMA and TDMA, fully decentralised WLAN MAC schemes have recently been proposed that converge to collision-free schedules. In this paper we describe a MAC with optimal long-run throughput that is almost decentralised. We then design two \changed{schemes} that are practically realisable, decentralised approximations of this optimal scheme and operate with different amounts of sensing information. We achieve this by (1) introducing learning algorithms that can substantially speed up convergence to collision free operation; (2) developing a decentralised schedule length adaptation scheme that provides long-run fair (uniform) access to the medium while maintaining collision-free access for arbitrary numbers of stations

Backlog-based random access in wireless networks : fluid limits and delay issues

We explore the spatio-temporal congestion dynamics of wireless networks with backlog-based random-access mechanisms. While relatively simple and inherently distributed in nature, suitably designed backlog-based access schemes provide the striking capability to match the optimal throughput performance of centralized scheduling algorithms in a wide range of scenarios. In the present paper, we show that the specific activity functions for which maximum stability has been established, may however yield excessive queue lengths and delays. The results reveal that more aggressive/persistent access schemes can improve the delay performance, while retaining the maximum stability guarantees in a rich set of scenarios. In order to gain qualitative insights and examine stability properties we will investigate fluid limits where the system dynamics are scaled in space and time. As it turns out, several distinct types of fluid limits can arise, exhibiting various degrees of randomness, depending on the structure of the network, in conjunction with the form of the activity functions. We further demonstrate that, counter to intuition, additional interference may improve the delay performance in certain cases. Simulation experiments are conducted to illustrate and validate the analytical findings