Approaching Throughput-optimality in Distributed CSMA Scheduling Algorithms with Collisions

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. One important, but 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 Markov chain model and give an explicit throughput formula which takes into account the cost of collisions and overhead. The formula has a simple form since the Markov chain is "almost" time-reversible. Second, we propose transmission-length control algorithms to approach throughput optimality in this case. Sufficient conditions are given to ensure the convergence and stability of the proposed algorithms. Finally, we characterize the relationship between the CSMA parameters (such as the maximum packet lengths) and the achievable capacity region.

To appear in IEEE/ACM Transactions on Networking. This is the longer version

Cited by in corpus (8)

• A Stackelberg Game Model for Overlay D2D Transmission with Heterogeneous Rate Requirements
• Explicit back-off rates for achieving target throughputs in CSMA/CA networks
• Properties of an Aloha-like stability region
• Medium Access over Time-varying Channels with Limited Sensing Cost
• Throughput Computation in CSMA Wireless Networks with Collision Effects
• A Common Information-Based Multiple Access Protocol Achieving Full Throughput and Linear Delay
• Throughput Optimal Decentralized Scheduling with Single-bit State Feedback for a Class of Queueing Systems
• CSMA using the Bethe Approximation: Scheduling and Utility Maximization