认知无线电中的无线容量和接纳控制
Wireless Capacity and Admission Control in Cognitive Radio
摘要：
我们给出了算法与恒定因素的性能保证几个容量和吞吐量问题的SINR模型。所有的算法都是基于一个新的LP制定能力问题。首先，我们给出了一个新的常数因子近似算法选择的最大子集的链路，可以同时进行调度，在任何非递减和次线性的功率分配。对于均匀功率的情况下，我们将其扩展到可变QoS要求和链路相关噪声项的情况。第二，我们近似的认知无线电相关的问题：找到一个最大的一组链接，可以同时调度，而不影响一组给定的先前分配的链接。最后，我们得到了线性幂分配下加权容量的常数因子近似。
英文摘要：
We give algorithms with constant-factor performance guarantees for several capacity and throughput problems in the SINR model. The algorithms are all based on a novel LP formulation for capacity problems. First, we give a new constant-factor approximation algorithm for selecting the maximum subset of links that can be scheduled simultaneously, under any non-decreasing and sublinear power assignment. For the case of uniform power, we extend this to the case of variable QoS requirements and link-dependent noise terms. Second, we approximate a problem related to cognitive radio: find a maximum set of links that can be simultaneously scheduled without affecting a given set of previously assigned links. Finally, we obtain constant-factor approximation of weighted capacity under linear power assignment.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
