Skip to main content
Article thumbnail
Location of Repository

A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks

By Libin Jiang and Jean Walrand

Abstract

In multi-hop 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 (MW) scheduling, although throughput-optimal, is difficult to implement in distributed networks; whereas a distributed greedy protocol similar to IEEE 802.11 does not guarantee the maximal throughput. In this paper, we introduce an adaptive CSMA scheduling algorithm that can achieve the maximal throughput distributedly under some assumptions. Major advantages of the algorithm include: (1) It applies to a very general interference model; (2) It is simple, distributed and asynchronous. Furthermore, we combine the algorithm with end-to-end flow control to achieve the optimal utility and fairness of competing flows. The effectiveness of the algorithm is verified by simulations. Finally, we consider some implementation issues in the setting of 802.11 networks

Year: 2008
OAI identifier: oai:CiteSeerX.psu:10.1.1.320.9133
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://robotics.eecs.berkeley.... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.