子模块注水算法及其在在线基站配置中的应用
Sub-Modularity of Waterfilling with Applications to Online Basestation Allocation
摘要：
我们表明，流行的注水算法最大化并行高斯信道中的互信息是子模块。子模块的注水算法，然后用于推导出在线基站分配算法，其中移动用户被分配到许多可能的基站之一，立即和可替换地到达后，不知道未来的用户信息。分配的目标是在每个基站的功率分配下最大化系统的和速率。我们目前的在线算法的竞争比最多为2相比，离线算法，所有未来的用户到来的知识。
英文摘要：
We show that the popular water-filling algorithm for maximizing the mutual information in parallel Gaussian channels is sub-modular. The sub-modularity of water-filling algorithm is then used to derive online basestation allocation algorithms, where mobile users are assigned to one of many possible basestations immediately and irrevocably upon arrival without knowing the future user information. The goal of the allocation is to maximize the sum-rate of the system under power allocation at each basestation. We present online algorithms with competitive ratio of at most 2 when compared to offline algorithms that have knowledge of all future user arrivals.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
