.png){kind=icon}
返回
Combinatorial Resource Allocation Using Submodularity of Waterfilling
.png){kind=icon}
PRE
AI
DOI：10.1109/TWC.2015.2469291.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We show that the maximum mutual information (capacity) of parallel Gaussian channels obtained by the optimal water-filling algorithm for power allocation under a sum-power constraint is submodular. For a given power allocation, mutual information is known to be submodular. However, establishing the submodularity of the capacity, which additionally involves maximization of the mutual information over the power allocation, is challenging. Capacity of parallel Gaussian channels is equivalent to the maximum log-utility function used in resource allocation problems. Using this correspondence and the submodularity of the capacity, we find provable guarantees on multiple combinatorial resource allocation problems in wireless networks. In particular, we show that greedy algorithms give a 2-approximation for uplink OFDMA power and subcarrier allocation, FDMA capacity, down-link base-station association, with honest as well as strategic users who may or may not report their channel gains truthfully.
Keyword:
Approximation algorithm
FDMA capacity
OFDMA power and subcarrier allocation
submodularity
water-filling algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.7
论文数:
1.3W
被引数:
5.3W
机构
引用论文
分享收藏分享收藏A sub-optimal joint subcarrier and power allocation algorithm for multiuser OFDM一种用于多用户OFDM的次优联合子载波和功率分配算法
PREAI
分享收藏Introducing 2-(2-carboxyphenoxy)terephthalic acid as a new versatile building block for design of diverse coordination polymers: synthesis, structural features, luminescence sensing, and magnetism.png)
CrystEngComm
CrystEngCommIF0
PREAI
分享收藏
查看更多内容