The goal of jointly providing fairness and efficiency in wireless networks can be seen as the problem of maximizing a given utility function. The main difficulty when solving this problem is that the capacity region of wireless networks is typically unknown and time-varying, which prevents the usage of traditional optimization tools. As a result, scheduling and congestion control algorithms are either too conservative because they under-estimate the capacity region, or suffer from congestion collapse because they over-estimate it. We propose a new adaptive congestion control algorithm, called Enhance & Explore (E&E). It maximizes the utility of the network without requiring any explicit characterization of the capacity region. E&E works above the MAC layer and is decoupled from the underlying scheduling mechanism. It provably converges to a state of optimal utility. We evaluate the performance of the algorithm in a WLAN setting, using both simulations and measurements on a real testbed composed of IEEE 802.11 wireless routers.
[1]
A. Robert Calderbank,et al.
Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures
,
2007,
Proceedings of the IEEE.
[2]
Eddie Kohler,et al.
The Click modular router
,
1999,
SOSP.
[3]
Julien Herzen,et al.
Enhance & explore: an adaptive algorithm to maximize the utility of wireless networks
,
2011,
MobiCom '11.
[4]
Martin Heusse,et al.
Performance anomaly of 802.11b
,
2003,
IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).
[5]
Adel Aziz,et al.
Aziala-net: deploying a scalable multi-hop wireless testbed platform for research purposes
,
2009,
MobiHoc S3 '09.