Abstract-In this paper, we establish that the rate region of a large class of IEEE 802.11 mesh networks is log-convex, immediately allowing standard utility fairness methods to be generalized to this class of networks. This creates a solid theoretical underpinning for fairness analysis and resource allocation in this practically important class of networks. For the special case of max-min fairness, we use this new insight to obtain an almost complete characterization of the fair rate allocation and a remarkably simple, practically implementable method for achieving max-min fairness in 802.11 mesh networks. Index Terms-802.11, decentralized algorithms, max-min fairness, mesh networks, TXOP, utility fairness, WLANs.
802.11 rate region is proven log-convex, and station attempt probabilities and burst sizes in 802.11 mesh networks were derived for max-min fair regimes REF .
Max-Min Fairness in 802.11 Mesh Networks
IEEE/ACM Transactions on Networking
IEEE/ACM Transactions on Networking
Computer Science