A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks
Cached
Download Links
| Citations: | 176 - 8 self |
BibTeX
@MISC{Jiang_adistributed,
author = {Libin Jiang and Jean Walrand},
title = { A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
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 endto-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.
Keyphrases
distributed csma algorithm utility maximization maximal throughput wireless network endto-end flow control different link challenging problem algorithm include complex interference constraint implementation issue general interference model distributed greedy protocol optimal utility multi-hop wireless network major advantage adaptive csma distributed network
