Clustering‐based low‐complexity resource allocation in two‐tier femtocell networks with QoS provisioning
Clustering‐based low‐complexity resource allocation in two‐tier femtocell networks with QoS provisioning
复制标题
DOI：
10.1002/dac.3005
复制
发表时间：
2017-03
影响因子：
2.1
通讯作者：
Fengchao Fu;Zhaoming Lu;Yuanbao Xie;Wenpeng Jing;X. Wen
中科院分区：
文献类型：
--
作者：
Fengchao Fu;Zhaoming Lu;Yuanbao Xie;Wenpeng Jing;X. Wen
在本文中，我们研究了在两层毫微微蜂窝网络中具有延迟服务质量约束的上行链路传输的资源分配问题。特别地，为了提供统计延迟保证，采用有效容量代替传统的香农容量作为网络性能度量。为了使问题的计算效率和数值上易于处理，我们将问题分解为三个子问题，即集群配置子问题，集群内子信道分配子问题和集群间功率控制子问题。首先，我们提出了一种低复杂度的启发式半动态分簇方案，其中考虑了通过回程的信道状态信息反馈的延迟。我们在网络部分观测马尔可夫决策过程的框架下对这样的系统进行建模，并推导出一种减少最佳集群配置搜索范围的策略。然后，对于一个给定的集群配置，簇头处理每个集群内的子信道分配和功率控制。我们提出了一个比例公平的子信道分配方案。然后，将簇间功率控制子问题建模为一组精确的势博弈，并提出了一种与信道质量相关的定价机制来减轻簇间干扰。研究了该对策纳什均衡的存在唯一性，并设计了一个有效的保证收敛的分散算法。仿真结果表明，所提出的算法不仅具有较低的计算复杂度，而且性能接近穷举搜索解和其他现有的方案。版权所有© 2015约翰威利父子有限公司
In this paper, we study the resource allocation problem of the uplink transmission with delay quality‐of‐service constraints in two‐tier femtocell networks. Particularly, to provide statistical delay guarantees, the effective capacity is employed as the network performance measure instead of the conventional Shannon capacity. To make the problem computationally efficient and numerically tractable, we decompose the problem into three subproblems, namely, cluster configuration subproblem, intra‐cluster subchannel allocation subproblem and inter‐cluster power control subproblem. Firstly, we develop a low‐complexity heuristic semi‐dynamic clustering scheme, where the delay of the channel state information feedback via backhaul is considered. We model such system in the framework of networked partial observation Markov decision process and derive a strategy to reduce the search range for the best cluster configuration. Then, for a given cluster configuration, the cluster heads deal with subchannel allocation and power control within each cluster. We propose a subchannel allocation scheme with proportional fairness. Thereafter, the inter‐cluster power control subproblem is modeled as a set of exact potential games, and a channel quality related pricing mechanism is presented to mitigate inter‐cluster interference. The existence and uniqueness of Nash equilibriums for the proposed game are investigated, and an effective decentralized algorithm with guaranteed convergence is designed. Simulation results demonstrate that the proposed algorithms not only have much lower computational complexity but also perform close to the exhaustive search solutions and other existing schemes. Copyright © 2015 John Wiley & Sons, Ltd.