PROJECT TITLE :

Node-Based Distributed Channel Access With Enhanced Delay Characteristics - 2018

ABSTRACT:

Recent studies in wireless scheduling have shown that carrier-sense multiple access (CSMA) can be created throughput optimal by optimizing over activation rates. However, those throughput optimal CSMA algorithms were found to suffer from poor delay performance, particularly at high throughputs where the delay will potentially grow exponentially in the scale of the network. Motivated by these shortcomings, in this Project we propose a node-based mostly version of the throughput optimal CSMA (NB-CSMA) as opposed to ancient link-based mostly CSMA algorithms, where links were treated as separate entities. Our algorithm is fully distributed and corresponds to Glauber dynamics with “Block updates”. We tend to show analytically and via simulations that NB-CSMA outperforms conventional link-based CSMA in terms of delay for any fastened-size network. We have a tendency to also characterize the fraction of the capacity region for that the typical queue lengths (and the typical delay) grow polynomially in the scale of the network, for networks with bounded-degree conflict graphs. This fraction isn't any smaller than the fraction known for link-primarily based CSMA, and is considerably larger for several instances of practical wireless ad-hoc networks. Finally, we have a tendency to limit our focus to the special case of collocated networks, analyze the mean starvation time employing a Markov chain with rewards framework and use the results to quantitatively demonstrate the improvement of NB-CSMA over the baseline link-based mostly algorithm.