A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks
Libin Jiang and Jean Walrand
MURI BAA 07-036.18
In multi-hop wireless networks, distributed scheduling for maximal throughput is challenging because of the complex interference relationships among different links. Traditional maximal-weight (MW) scheduling is difficult to implement in distributed networks. In , we introduce an adaptive CSMA algorithm that can achieve the maximal throughput distributed under some assumptions. The algorithm applies to a very general interference model. 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, and some implementation issues are considered in the setting of 802.11 networks. In summary, this work shows the feasibility of achieving the optimal throughput and utility in a general class of wireless networks with a simple, distributed and asynchronous CSMA algorithm.
- L. Jiang and J. Walrand, "A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks," Allerton Conference on Communication, Control, and Computing, 2008 (to appear).