Approaching throughput-optimality in a distributed CSMA algorithm: collisions and stability

Authors:
Libin Jiang;Jean Walrand
Affiliations:
University of California, Berkeley, Berkeley, CA, USA;University of California, Berkeley, Berkeley, CA, USA
Venue:
Proceedings of the 2009 MobiHoc S3 workshop on MobiHoc S3
Year:
2009

Citing 0
Cited 4

A distributed CSMA algorithm for throughput and utility maximization in wireless networks

IEEE/ACM Transactions on Networking (TON)
Approaching throughput-optimality in distributed CSMA scheduling algorithms with collisions

IEEE/ACM Transactions on Networking (TON)
Performance of CSMA in multi-channel wireless networks

Queueing Systems: Theory and Applications
Stability and delay of distributed scheduling algorithms for networks of conflicting queues

Queueing Systems: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

It was shown recently that CSMA (Carrier Sense Multiple Access)-like distributed algorithms can achieve the maximal throughput in wireless networks (and task processing networks) under certain assumptions [1]. One idealized assumption is that the sensing time is negligible, so that there is no collision. In this paper, we study more practical CSMA-based scheduling algorithms with collisions. First, we provide a model and give an explicit throughput formula, which has a simple product-form due to the quasi-reversibility structure of the model. Second, we show that the algorithm in [1] can be extended to approach throughput optimality in this case. Finally, sufficient conditions are given to ensure the convergence and stability of the proposed algorithm. Such conditions are also provided for the algorithm in [1] to achieve throughput-optimality. (Detailed proofs of all theorems here can be found in [2, 3].)