Pith. sign in

REVIEW

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1704.01924 v5 pith:2FS6FQEP submitted 2017-04-06 cs.IT math.IT

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

classification cs.IT math.IT
keywords delaypowerdualfurthermorelagrangeproposedschemealgorithm
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original 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 $10^{-9}$ when the maximum tolerable delay is 1 ms. This is suitable for the future ultra-reliable low latency communications (URLLC).

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.