Power- and Rate-Adaptation Improves the Effective Capacity of C-RAN for Nakagami-m Fading Channels

被引:11
|
作者
Ren, Hong [1 ,2 ]
Liu, Nan [1 ]
Pan, Cunhua [2 ]
Elkashlan, Maged [2 ]
Nallanathan, Arumugam [2 ]
You, Xiaohu [1 ]
Hanzo, Lajos [3 ]
机构
[1] Southeast Univ, Nanjing 210096, Jiangsu, Peoples R China
[2] Queen Mary Univ London, London E1 4NS, England
[3] Univ Southampton, Sch Elect & Comp Sci, Southampton SO17 1BJ, Hants, England
基金
中国国家自然科学基金; 英国工程与自然科学研究理事会; 欧洲研究理事会;
关键词
URLLC; effective capacity; delay constraints; cross-layer design; C-RAN; DISTRIBUTED ANTENNA SYSTEMS; RADIO ACCESS NETWORKS; GAUSSIAN CHANNELS; SIDE INFORMATION; COGNITIVE RADIO; OPTIMIZATION; ALLOCATION; AVERAGE; DELAY; PEAK;
D O I
10.1109/TVT.2018.2869793
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
We propose a power-and rate-adaptation scheme for cloud radio access networks (C-RANs), where each radio remote head (RRH) is connected to the baseband unit pool through optical links. The RRHs jointly support the users by efficiently exploiting the enhanced spatial degrees of freedom. Our proposed scheme aims at maximizing the effective capacity (EC) of the user subject to both per-RRH average- and peak-power constraints, where the EC is defined as the maximum arrival rate that can be supported by the C-RAN under the statistical delay requirement. We first transform the EC maximization problem into an equivalent convex optimization problem. By using the Lagrange dual decomposition method and solving the Karush-Kuhn-Tucker equations, the optimal transmission power of each RRH can be obtained in the closed form. Furthermore, an online tracking method is provided for approximating the average power of each RRH. For the special case of two RRHs, the expression of the average power of each RRH can be calculated in the explicit form. Hence, the Lagrange dual variables can be computed in advance in this special case. Furthermore, we derive the power allocation for two important extreme cases: first, no delay constraint and, second, extremely stringent delay requirements. Our simulation results show that the proposed scheme significantly outperforms the conventional algorithm without considering the delay requirements. Furthermore, when appropriately tuning the value of the delay exponent, our proposed algorithm is capable of guaranteeing a delay outage probability below 10(- 9) when the maximum tolerable delay is 1 ms. This is suitable for the future ultra-reliable low-latency communications.
引用
收藏
页码:10841 / 10855
页数:15
相关论文
共 23 条