arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1808.01618eess.SYcs.SY
收藏

通过显式学习增强最大权算法用于具有切换成本的无线调度

Augmenting Max-Weight with Explicit Learning for Wireless Scheduling with Switching Costs

The University of Texas at Austin(德克萨斯大学奥斯汀分校);Indian Institute of Science, Bangalore(印度科学研究所班加罗尔分校)

Subhashini Krishnasamy, Akhil P T, Ari Arapostathis, Rajesh Sundaresan, Sanjay Shakkottai

AI总结:

本文研究了具有切换成本的无线网络调度问题,提出了一种结合显式学习和最大权算法的方法,以实现低能耗和队列稳定性。

摘要:

在小小区无线网络中,用户连接到多个基站(BSs)时,动态关闭部分BS子集以最小化能耗通常是有益的。我们考虑了两种能耗类型:(i)保持BS处于激活状态的成本,以及(ii)将BS从激活状态切换到非激活状态的成本。问题是在满足队列稳定性的情况下,以最低可能的能耗(激活和切换成本之和)运行网络。在该设置中,传统方法——最大权算法结合基于Lyapunov的稳定性论证——不足以证明队列稳定性,主要是由于切换成本引起的信道调度和BS激活决策之间的时序共演进。相反,我们开发了一种具有缓慢时序动态的学习和BS激活算法,以及一个基于最大权的信道调度器,具有快速时序动态。通过证明时间非齐次马尔可夫链的收敛性,我们表明学习、BS激活和队列长度的共演进动态导致近最优的平均能耗以及队列稳定性。

英文摘要:

In small-cell wireless networks where users are connected to multiple base stations (BSs), it is often advantageous to switch off dynamically a subset of BSs to minimize energy costs. We consider two types of energy cost: (i) the cost of maintaining a BS in the active state, and (ii) the cost of switching a BS from the active state to inactive state. The problem is to operate the network at the lowest possible energy cost (sum of activation and switching costs) subject to queue stability. In this setting, the traditional approach -- a Max-Weight algorithm along with a Lyapunov-based stability argument -- does not suffice to show queue stability, essentially due to the temporal co-evolution between channel scheduling and the BS activation decisions induced by the switching cost. Instead, we develop a learning and BS activation algorithm with slow temporal dynamics, and a Max-Weight based channel scheduler that has fast temporal dynamics. We show using convergence of time-inhomogeneous Markov chains, that the co-evolving dynamics of learning, BS activation and queue lengths lead to near optimal average energy costs along with queue stability.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑