Proportional Fairness in Multi-Rate Wireless LANs
Proportional Fairness in Multi-Rate Wireless LANs
复制标题
DOI：
10.1109/infocom.2008.154
复制
发表时间：
2008-04
期刊：
影响因子：
--
通讯作者：
Erran L. Li;Martin Pál;Y. Yang
中科院分区：
文献类型：
--
作者：
Erran L. Li;Martin Pál;Y. Yang
在多速率无线局域网中，基于吞吐量的公平带宽分配会导致聚合吞吐量急剧降低。为了在以公平的方式服务用户的同时平衡总吞吐量，已提出在每个接入点(AP)应用比例公平或基于时间的公平调度。然而，由于无线局域网的实际部署可以由AP网络组成，因此本文考虑在这种更广泛的设置中的比例公平性。我们的技术是智能地将用户与AP相关联，以在AP网络中实现最佳比例公平。针对周期离线优化问题，我们提出了两种近似算法。我们的算法是文献中的第一近似算法，对NP-Hard问题具有严格的最坏情况保证。我们的仿真结果表明，我们的算法可以获得比802.11b中最大最小公平分配算法高2.3倍的总吞吐量。在保持总吞吐量的同时，我们的近似算法在公平性方面显著优于802.11b标准中的默认用户-AP关联方法。
In multi-rate wireless LANs, throughput-based fair bandwidth allocation can lead to drastically reduced aggregate throughput. To balance aggregate throughput while serving users in a fair manner, proportional fair or time-based fair scheduling has been proposed to apply at each access point (AP). However, since a realistic deployment of wireless LANs can consist of a network of APs, this paper considers proportional fairness in this much wider setting. Our technique is to intelligently associate users with APs to achieve optimal proportional fairness in a network of APs. We propose two approximation algorithms for periodical offline optimization. Our algorithms are the first approximation algorithms in the literature with a tight worst-case guarantee for the NP-hard problem. Our simulation results demonstrate that our algorithms can obtain an aggregate throughput which can be as much as 2.3 times more than that of the max-min fair allocation in 802.11b. While maintaining aggregate throughput, our approximation algorithms outperform the default user-AP association method in the 802.11b standard significantly in terms of fairness.