Max-min Fairness in 802.11 Mesh Networks

TL;DR

This paper characterizes max-min fair rate allocations in 802.11 mesh networks using the log-convexity of the rate region and proposes a practical method leveraging 802.11e/n MAC features for achieving fairness.

Contribution

It provides the first characterization of max-min fair rates in 802.11 mesh networks and introduces an implementable approach using TXOP packet bursting.

Findings

Max-min fair rate allocations are characterized for 802.11 mesh networks.

A practical method for achieving max-min fairness using MAC features is proposed.

The approach extends to time-based fairness in multi-rate networks.

Abstract

In this paper we build upon the recent observation that the 802.11 rate region is log-convex and, for the first time, characterise max-min fair rate allocations for a large class of 802.11 wireless mesh networks. By exploiting features of the 802.11e/n MAC, in particular TXOP packet bursting, we are able to use this characterisation to establish a straightforward, practically implementable approach for achieving max-min throughput fairness. We demonstrate that this approach can be readily extended to encompass time-based fairness in multi-rate 802.11 mesh networks.