The University of Southampton
University of Southampton Institutional Repository

Power-and rate-adaptation improves the effective capacity of C-RAN for Nakagami-mFading channels

Power-and rate-adaptation improves the effective capacity of C-RAN for Nakagami-mFading channels
Power-and rate-adaptation improves the effective capacity of C-RAN for Nakagami-mFading channels

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 (BBU) pool through optical links. The RRHs jointly support the users by efficiently exploiting the enhanced spatial degrees of freedom. Our proposed scheme aims for 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 (KKT) equations, the optimal transmission power of each RRH can be obtained in closed-form. Furthermore, an online tracking method is provided for approximating the average power of each RRH for the sake of updating the Lagrange dual variables. For the special case of two RRHs, the expression of the average power of each RRH can be calculated in 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: 1) no delay constraint; 2) 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 <formula><tex>$10^{-9}$</tex></formula> when the maximum tolerable delay is 1 ms. This is suitable for the future ultra-reliable low latency communications (URLLC).

C-RAN, Cross-layer design, Delay constraints, Delays, Effective capacity, Fading channels, Probability, Quality of service, Resource management, Transmitters, URLLC, Wireless communication
0018-9545
10841-10855
Ren, Hong
0cd70e56-a7d7-478e-bcd8-54c13866bb48
Liu, Nan
72d3ab9e-1827-4fc4-957c-b54a9fb03a41
Pan, Cunhua
f7d52330-7fd8-42eb-8a5a-e094829a9fea
Elkashlan, Maged
27c756ff-bfd3-4844-8769-ace5ad28c840
Nallanathan, Arumugam
e8b671a0-2b56-41b7-a2e4-37c72d60ee57
You, Xiaohu
4b34d278-a357-4608-8711-d4d25bff20b6
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1
Ren, Hong
0cd70e56-a7d7-478e-bcd8-54c13866bb48
Liu, Nan
72d3ab9e-1827-4fc4-957c-b54a9fb03a41
Pan, Cunhua
f7d52330-7fd8-42eb-8a5a-e094829a9fea
Elkashlan, Maged
27c756ff-bfd3-4844-8769-ace5ad28c840
Nallanathan, Arumugam
e8b671a0-2b56-41b7-a2e4-37c72d60ee57
You, Xiaohu
4b34d278-a357-4608-8711-d4d25bff20b6
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1

Ren, Hong, Liu, Nan, Pan, Cunhua, Elkashlan, Maged, Nallanathan, Arumugam, You, Xiaohu and Hanzo, Lajos (2018) Power-and rate-adaptation improves the effective capacity of C-RAN for Nakagami-mFading channels. IEEE Transactions on Vehicular Technology, 67 (11), 10841-10855. (doi:10.1109/TVT.2018.2869793).

Record type: Article

Abstract

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 (BBU) pool through optical links. The RRHs jointly support the users by efficiently exploiting the enhanced spatial degrees of freedom. Our proposed scheme aims for 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 (KKT) equations, the optimal transmission power of each RRH can be obtained in closed-form. Furthermore, an online tracking method is provided for approximating the average power of each RRH for the sake of updating the Lagrange dual variables. For the special case of two RRHs, the expression of the average power of each RRH can be calculated in 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: 1) no delay constraint; 2) 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 <formula><tex>$10^{-9}$</tex></formula> when the maximum tolerable delay is 1 ms. This is suitable for the future ultra-reliable low latency communications (URLLC).

Text
08466036 - Version of Record
Available under License Creative Commons Attribution.
Download (1MB)

More information

Accepted/In Press date: 13 September 2018
e-pub ahead of print date: 14 September 2018
Published date: November 2018
Keywords: C-RAN, Cross-layer design, Delay constraints, Delays, Effective capacity, Fading channels, Probability, Quality of service, Resource management, Transmitters, URLLC, Wireless communication

Identifiers

Local EPrints ID: 426913
URI: http://eprints.soton.ac.uk/id/eprint/426913
ISSN: 0018-9545
PURE UUID: a7438cc9-0add-4645-b3ca-3a0fe81de5af
ORCID for Lajos Hanzo: ORCID iD orcid.org/0000-0002-2636-5214

Catalogue record

Date deposited: 14 Dec 2018 17:30
Last modified: 18 Mar 2024 02:36

Export record

Altmetrics

Contributors

Author: Hong Ren
Author: Nan Liu
Author: Cunhua Pan
Author: Maged Elkashlan
Author: Arumugam Nallanathan
Author: Xiaohu You
Author: Lajos Hanzo ORCID iD

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×