A multi-greedy spectrum auction algorithm for cognitive small cell networks
A multi-greedy spectrum auction algorithm for cognitive small cell networks
复制标题
认知小蜂窝网络的多重贪婪频谱拍卖算法
DOI：
10.1177/1550147717717215
复制
发表时间：
2017
影响因子：
2.3
通讯作者：
Chen Hongbin
中科院分区：
文献类型：
--
作者：
Zhao Feng;Liu Bo;Chen Hongbin
由宏小区和小小区组成的认知小小区网络被预见为满足宽带服务和新应用的不断增长的需求的候选解决方案。然而，传统的固定频谱分配策略使得可用于小小区的频谱资源不足。因此，迫切需要一种高效的频谱分配方法，允许大量小小区与宏小区共享频谱资源。本文提出了一种实时频谱拍卖模型，旨在将稀缺的频谱资源快速分配给小小区。构建了合作共赢的局面，控制了频谱利用率和收益之间的权衡。这样的问题被制定为一个NP-难优化问题，提出了一个低复杂度的多贪婪算法来获得价格和频谱分配。该算法可以实现无冲突的频谱分配，最大化的效用和频谱分配效率。仿真结果表明，与Vickrey-Clarke-格罗夫斯算法相比，该算法具有更高的实用性和频谱分配效率。
Cognitive small cell networks consisting of macro- and small cells are foreseen as a candidate solution to meet ever increasing requirements of broadband services and new applications. However, the traditional fixed spectrum allocation policy makes available spectrum resources for small cells insufficient. Therefore, an efficient spectrum allocation method is urgently needed that allows a large number of small cells to share spectrum resources with macro-cells. In this article, a real-time spectrum auction model is presented which aims at assigning the scarce spectrum resources to small cells quickly. The co-win situation is constructed, and the trade-off between spectrum utilization and revenues is controlled. Such a problem is formulated as an NP-hard optimization problem for which a low-complexity multi-greedy algorithm is proposed to obtain prices and spectrum allocations. The proposed algorithm can achieve conflict-free spectrum allocations that maximize the utility and spectrum allocation efficiency. Compared with the Vickrey–Clarke–Groves algorithm, simulation results show the higher utility and spectrum allocation efficiency of the proposed algorithm.