A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks
Top Cited Papers
- 24 November 2009
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 18 (3), 960-972
- https://doi.org/10.1109/tnet.2009.2035046
Abstract
In multihop wireless networks, designing distributed scheduling algorithms to achieve the maximal throughput is a challenging problem because of the complex interference constraints among different links. Traditional maximal-weight scheduling (MWS), although throughput-optimal, is difficult to implement in distributed networks. On the other hand, a distributed greedy protocol similar to IEEE 802.11 does not guarantee the maximal throughput. In this paper, we introduce an adaptive carrier sense multiple access (CSMA) scheduling algorithm that can achieve the maximal throughput distributively. Some of the major advantages of the algorithm are that it applies to a very general interference model and that it is simple, distributed, and asynchronous. Furthermore, the algorithm is combined with congestion control to achieve the optimal utility and fairness of competing flows. Simulations verify the effectiveness of the algorithm. Also, the adaptive CSMA scheduling is a modular MAC-layer algorithm that can be combined with various protocols in the transport layer and network layer. Finally, the paper explores some implementation issues in the setting of 802.11 networks.Keywords
This publication has 35 references indexed in Scilit:
- Approaching throughput-optimality in a distributed CSMA algorithmPublished by Association for Computing Machinery (ACM) ,2009
- Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networksPublished by Association for Computing Machinery (ACM) ,2009
- Multihop Local Pooling for Distributed Throughput Maximization in Wireless NetworksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2008
- Cross-layer adaptive control for wireless mesh networksAd Hoc Networks, 2007
- Distributed link scheduling with constant overheadACM SIGMETRICS Performance Evaluation Review, 2007
- Maximizing throughput in wireless networks via gossipingPublished by Association for Computing Machinery (ACM) ,2006
- Sufficient conditions for stability of longest-queue-first scheduling: second-order properties using fluid limitsAdvances in Applied Probability, 2006
- Achieving 100% throughput in an input-queued switchIEEE Transactions on Communications, 1999
- Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networksIEEE Transactions on Automatic Control, 1992
- Cooling Schedules for Optimal AnnealingMathematics of Operations Research, 1988