Academic
Publications
Max-min Fairness in 802.11 Mesh Networks

Max-min Fairness in 802.11 Mesh Networks,Computing Research Repository,Douglas J. Leith,Qizhi Cao,Vijay G. Subramanian

Max-min Fairness in 802.11 Mesh Networks   (Citations: 2)
BibTex | RIS | RefWorks Download
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.
Journal: Computing Research Repository - CORR , vol. abs/1002.1, 2010
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...Proof: See technical report [10] for proof...

    Douglas J. Leithet al. Realising max-min fairness in 802.11e mesh networks

    • ...By increasing Ni (along rays), one can show that the efficiency of the network is maximised subject to the fixed per packet overhead Li/Tc - see [21] for details...
    • ...3 (see [21]) this optimisation can be transformed into a convex problem such that all the constraints are satisfied with equality at the optimal solution(s), if the problem is feasible...
    • ...Theorem 1: The WLAN rate-region R is log-convex. Proof: See [21] for details...
    • ...log-convex for any ¯ � 1. Proof: See [21] for details...
    • ...We note that the proof above can be readily extended to show that other similar constraints on � (or x) and N vectors also yield a convex set under our transformation - see [21]...
    • ...Corollary 2: The mesh network rate-region R(G) is logconvex. Proof: See [21] for details...
    • ...Before proceeding we make the following assumptions; these are relaxed in [21], but they are useful for gaining initial insight into the nature of the max-min fair allocation...
    • ...3) Non-bottlenecked flows are always unsaturated. Proof: See [21]...

    Douglas J. Leithet al. Utility fairness in 802.11-based wireless mesh networks

Sort by: