Downlink resource allocation under time-varying interference: Fairness and throughput optimality
Downlink resource allocation under time-varying interference: Fairness and throughput optimality
复制标题
DOI：
10.1109/twc.2017.2770094
复制
发表时间：
2014-09
期刊：
影响因子：
--
通讯作者：
R. Raman;K. Jagannathan
中科院分区：
文献类型：
--
作者：
R. Raman;K. Jagannathan
我们解决了存在时变干扰时的下行链路资源分配问题。我们考虑这样一种场景，其中由基站服务的用户面临来自使用相同信道的相邻基站的干扰。我们将来自相邻基站的干扰建模为由于其空闲和忙碌周期而产生的开/关更新过程。用户将他们的下行链路SINR值反馈给他们的基站，但这些值已经过时。在此设置中，我们描述了第2层如何以最佳方式利用报告的SINR值，这些SINR值可能由于时变干扰而不可靠。特别地，我们在两个著名的范例中提出了资源分配策略。首先，我们研究了α-公平调度问题，并提出了一种确保渐近收敛于最优α-公平吞吐量的策略。其次，我们提出了吞吐量最优的资源分配策略，即在所考虑的干扰场景下，能够稳定地支持最大可能的业务速率集的策略。从过时的SINR值估计中断概率在这两种调度范例中都扮演着重要的角色，我们使用更新理论中的工具来实现这一点。
We address the problem of downlink resource allocation in the presence of time-varying interference. We consider a scenario where users served by a base station face interference from a neighbouring base station that uses the same channels. We model the interference from the neighbouring base station as an ON/OFF renewal process, that arises due to its idle and busy cycles. The users feedback their downlink SINR values to their base station, but these values are outdated. In this setting, we characterize how Layer 2 can optimally exploit the reported SINR values, which could be unreliable due to time-varying interference. In particular, we propose resource allocation policies in two well-known paradigms. First, we address the problem of α-fair scheduling, and propose a policy that ensures asymptotic convergence to the optimal α-fair throughput. Second, we propose a throughput optimal resource allocation policy, i.e., a policy that can stably support the largest possible set of traffic rates under the interference scenario considered. Estimating the outage probability from the outdated SINR values plays an important role in both scheduling paradigms, and we accomplish this using tools from renewal theory.