Spatial CSMA: A distributed scheduling algorithm for the SIR model with time-varying channels

Peruru Subrahmanya Swamy, Radha Krishna Ganti, Krishna Jagannathan
2015 2015 Twenty First National Conference on Communications (NCC)  
Recent work has shown that adaptive CSMA algorithms can achieve throughput optimality. However, these adaptive CSMA algorithms assume a rather simplistic model for the wireless medium. Specifically, the interference is typically modelled by a conflict graph, and the channels are assumed to be static. In this work, we propose a distributed and adaptive CSMA algorithm under a more realistic signal-to-interference ratio (SIR) based interference model, with time-varying channels. We prove that our
more » ... We prove that our algorithm is throughput optimal under this generalized model. Further, we augment our proposed algorithm by using a parallel update technique. Numerical results show that our algorithm outperforms the conflict graph based algorithms, in terms of supportable throughput and the rate of convergence to steady-state.
doi:10.1109/ncc.2015.7084891 dblp:conf/ncc/SwamyGJ15 fatcat:vvpmf4tv4vcjzcwospbyuom2n4