On Achievability for Downlink Cloud Radio Access Networks With Base Station Cooperation

Wang, Chien-Yi; Wigger, Michèle; Zaidi, Abdellatif

doi:10.1109/tit.2018.2836675

Cited by 21 publications

(28 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Problem ( 11) is NP-hard [48]. Therefor, we make use one of the exiting algorithms, e.g., [45]- [47], to solve (11) heuristically in linear time with respect to its size as shown in Algorithm 2.…”

Section: Theorem 2 the Coordinated Scheduling Problem In (mentioning

confidence: 99%

“…The RRHs in the compression-based strategy transmit only compressed versions of the encoded messages to the users [6], [7]. Different coding schemes [8]- [11] have been studied in the literature as a means to maximize the achievable rates. For example, in [9], the authors proposed two lattice-based coding schemes that maximize the achievable sum rate in uplink multi-cell networks.…”

Section: Introductionmentioning

confidence: 99%

“…For example, in [9], the authors proposed two lattice-based coding schemes that maximize the achievable sum rate in uplink multi-cell networks. In [11], the authors built on the code proposed in [10] to further improve the sum rate maximization.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Throughput Maximization in Cloud-Radio Access Networks Using Cross-Layer Network Coding

Al-Abiad

Douik

Sorour

et al. 2022

IEEE Trans. on Mobile Comput.

View full text Add to dashboard Cite

Cloud radio access networks (C-RANs) are promising paradigms for the fifth-generation (5G) networks due to their interference management capabilities. In a C-RAN, a central processor (CP) is responsible for coordinating multiple Remote Radio Heads (RRHs) and scheduling users to their radio resource blocks (RRBs). In this paper, we develop a novel cross-layer network coding (CLNC) approach that proposes to optimize RRH's transmit powers and user's rates in making the coding decisions. As such, cross-layer throughput of the network is maximized. The joint user scheduling, file encoding, and power adaptation problem is solved by designing a subgraph for each RRB, in which each vertex represents potential user-RRH associations, encoded files, transmission rates, and power levels (PLs) for one RRB. It is then shown that the C-RAN throughput maximization problem is equivalent to a maximum-weight clique problem over the union of all such subgraphs, called herein the CRAN-CLNC graph. Numerical results revealed that the proposed joint and iterative schemes offer improved throughput performances as compared to the existing algorithms in the literature. Compared to our proposed joint scheme, our proposed iterative scheme has a certain degradation, roughly in the range of 9% -14%. This small degradation in the throughput performance of the iterative scheme comes at the achieved low computational complexity as compared to the high complexity of the joint scheme.

show abstract

Section: Theorem 2 the Coordinated Scheduling Problem In (mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Throughput Maximization in Cloud-Radio Access Networks Using Cross-Layer Network Coding

Al-Abiad

Douik

Sorour

et al. 2022

IEEE Trans. on Mobile Comput.

View full text Add to dashboard Cite

show abstract

“…We show in Appendix A that the above scheme has a vanishing error probability as n → ∞ if, in addition to (8)- (10), we have:…”

Section: Decodingmentioning

confidence: 99%

“…We refer to [1][2][3] and the references therein for an overview of the challenges and coding techniques for C-RANs. Several coding schemes have been proposed in recent years for the downlink of C-RANs including message sharing [4], backhaul compression [5], hybrid schemes [6] and generalized data sharing using Marton's coding [7,8]. The paper [9] gives an upper bound on the sum-rate of two-relay C-RANs with two users and numerically compares the performance of the aforementioned schemes with the upper bound.…”

Section: Introductionmentioning

confidence: 99%

Capacity Bounds on the Downlink of Symmetric, Multi-Relay, Single-Receiver C-RAN Networks

Bidokhti

Kramer

Shamai

2017

Entropy

View full text Add to dashboard Cite

Abstract:The downlink of symmetric Cloud Radio Access Networks (C-RANs) with multiple relays and a single receiver is studied. Lower and upper bounds are derived on the capacity. The lower bound is achieved by Marton's coding, which facilitates dependence among the multiple-access channel inputs. The upper bound uses Ozarow's technique to augment the system with an auxiliary random variable. The bounds are studied over scalar Gaussian C-RANs and are shown to meet and characterize the capacity for interesting regimes of operation.

show abstract

Network-enabled MIMO systems with distributed data processing

2018

View full text Add to dashboard Cite

On Achievability for Downlink Cloud Radio Access Networks With Base Station Cooperation

Cited by 21 publications

References 20 publications

Throughput Maximization in Cloud-Radio Access Networks Using Cross-Layer Network Coding

Throughput Maximization in Cloud-Radio Access Networks Using Cross-Layer Network Coding

Capacity Bounds on the Downlink of Symmetric, Multi-Relay, Single-Receiver C-RAN Networks

Network-enabled MIMO systems with distributed data processing

Contact Info

Product

Resources

About