一般情况下具有不经意功率的无线容量
Wireless Capacity with Oblivious Power in General Metrics
摘要：
无线网络的容量是考虑干扰的同时通信的最大可能量。形式上，我们处理以下问题。给定一组链路，每个链路都是位于度量空间中的发送器-接收器对，并将功率分配给发送器。我们寻求一个最大的子集的链接是可行的SINR模型：即，在每个链路上接收到的信号应该大于来自其他链路的干扰的总和。我们给出了一个常数因子的近似，适用于任何长度单调，次线性功率分配和任何距离度量。我们用这个给本质上紧的功率控制下使用不经意的功率分配的容量最大化的特征。具体来说，我们表明，平均功率分配是最佳的双向链路的容量最大化，并给出了一个紧密的$θ(\log n)$ -近似调度双向链路的功率控制使用不经意的权力。对于单向链路，我们给出了一个接近最优的$O(\log n + \log \log Δ)$近似的功率控制问题，使用平均功率，其中$Δ$是最长和最短的链路的比例。结合起来，这些结果明确了无线通信问题的集中复杂性。
英文摘要：
The capacity of a wireless network is the maximum possible amount of simultaneous communication, taking interference into account. Formally, we treat the following problem. Given is a set of links, each a sender-receiver pair located in a metric space, and an assignment of power to the senders. We seek a maximum subset of links that are feasible in the SINR model: namely, the signal received on each link should be larger than the sum of the interferences from the other links. We give a constant-factor approximation that holds for any length-monotone, sub-linear power assignment and any distance metric. We use this to give essentially tight characterizations of capacity maximization under power control using oblivious power assignments. Specifically, we show that the mean power assignment is optimal for capacity maximization of bi-directional links, and give a tight $θ(\log n)$-approximation of scheduling bi-directional links with power control using oblivious power. For uni-directional links we give a nearly optimal $O(\log n + \log \log Δ)$-approximation to the power control problem using mean power, where $Δ$ is the ratio of longest and shortest links. Combined, these results clarify significantly the centralized complexity of wireless communication problems.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
