OFDMA is a popular coding scheme for mobile wireless communications. In OFDMA, one must allocate the available resources (bandwidth and power) dynamically, as user requests arrive and depart in a stochastic manner. Several exact and heuristic methods exist to do this, but they all perform poorly in the “over-loaded” case, in which the user demand is close to or exceeds the system capacity. To address this case, we present a dynamic local search heuristic. A particular feature of our heuristic is that it takes fairness into consideration. Simulations on realistic data show that our heuristic is fast enough to be used in real-time, and consistently delivers allocations of good quality.

中文翻译：

---

过载OFDMA系统中公平动态资源分配的启发式方法

OFDMA是一种用于移动无线通信的流行编码方案。在OFDMA中，当用户请求以随机方式到达和离开时，必须动态分配可用资源（带宽和功率）。存在几种精确且启发式的方法来执行此操作，但是在“过载”情况下（用户需求接近或超过系统容量），它们都表现不佳。为了解决这种情况，我们提出了一种动态的本地搜索试探法。我们的启发式方法的一个特殊特征是它考虑了公平性。对实际数据的仿真表明，我们的启发式方法足够快，可以实时使用，并且始终如一地提供高质量的分配。