arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1312.7685cs.DCcs.ITcs.NImath.ITmath.OC
收藏

开放频谱接入的全分布式最优信道分配

Fully distributed optimal channel assignment for open spectrum access

Oshri Naparstek, Amir Leshem

摘要:

在本文中,我们解决的问题,完全分布式分配的用户的子带,使系统的总速率最大化。我们引入了一个修改后的拍卖算法,可以应用在一个完全分布式的方式使用机会CSMA分配方案,是$ε$最优的。我们分析了该算法的预期时间复杂度,并提出了一种具有较低预期复杂度的算法变体。然后,我们表明,在独立同分布瑞利信道的情况下,一个简单的贪婪计划是渐近最优的$\SNR$增加或用户的数量增加到无穷大。最后,我们提供的建议算法的模拟结果。

英文摘要:

In this paper we address the problem of fully distributed assignment of users to sub-bands such that the sum-rate of the system is maximized. We introduce a modified auction algorithm that can be applied in a fully distributed way using an opportunistic CSMA assignment scheme and is $ε$ optimal. We analyze the expected time complexity of the algorithm and suggest a variant to the algorithm that has lower expected complexity. We then show that in the case of i.i.d Rayleigh channels a simple greedy scheme is asymptotically optimal as $\SNR$ increases or as the number of users is increased to infinity. We conclude by providing simulated results of the suggested algorithms.

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

↑