论文标题
IEEE 802.11AX中的下行链接OFDMA的调度策略,带有吞吐量约束
A Scheduling Policy for Downlink OFDMA in IEEE 802.11ax with Throughput Constraints
论文作者
论文摘要
为了满足WiFi网络中对高吞吐量的不断增长的需求,IEEE 802.11AX(11AX)标准引入了正交频分部多访问(OFDMA)。在这封信中,我们解决了11ax的下行链路ofdma中的站点 - 资源单元调度问题,但要遵守最小吞吐量要求。为了处理受约束问题的不可行的实例,我们提出了一种基于加权最大公平性的新型调度策略,从而最大程度地提高了可实现和最小所需的吞吐量之间的最小分数。因此,即使无法实现吞吐量约束,提议的策略也具有明确的行为。数值结果展示了我们方法在流行的比例公平性和限制的总和最大化策略上的优点。
In order to meet the ever-increasing demand for high throughput in WiFi networks, the IEEE 802.11ax (11ax) standard introduces orthogonal frequency division multiple access (OFDMA). In this letter, we address the station-resource unit scheduling problem in downlink OFDMA of 11ax subject to minimum throughput requirements. To deal with the infeasible instances of the constrained problem, we propose a novel scheduling policy based on weighted max-min fairness, which maximizes the minimum fraction between the achievable and minimum required throughputs. Thus, the proposed policy has a well-defined behavior even when the throughput constraints cannot be fulfilled. Numerical results showcase the merits of our approach over the popular proportional fairness and constrained sum-rate maximization strategies.