Sparse Beamforming and User-Centric Clustering for Downlink Cloud Radio Access Network
Binbin Dai,Wei Yu +1 more
Reads0
Chats0
TLDR
The proposed dynamic clustering algorithm can achieve significant performance gain over existing naive clustering schemes and is shown to solve the weighted sum rate maximization problem through a generalized weighted minimum mean square error approach.Abstract:
This paper considers a downlink cloud radio access network (C-RAN) in which all the base-stations (BSs) are connected to a central computing cloud via digital backhaul links with finite capacities. Each user is associated with a user-centric cluster of BSs; the central processor shares the user's data with the BSs in the cluster, which then cooperatively serve the user through joint beamforming. Under this setup, this paper investigates the user scheduling, BS clustering, and beamforming design problem from a network utility maximization perspective. Differing from previous works, this paper explicitly considers the per-BS backhaul capacity constraints. We formulate the network utility maximization problem for the downlink C-RAN under two different models depending on whether the BS clustering for each user is dynamic or static over different user scheduling time slots. In the former case, the user-centric BS cluster is dynamically optimized for each scheduled user along with the beamforming vector in each time-frequency slot, whereas in the latter case, the user-centric BS cluster is fixed for each user and we jointly optimize the user scheduling and the beamforming vector to account for the backhaul constraints. In both cases, the nonconvex per-BS backhaul constraints are approximated using the reweighted l 1 -norm technique. This approximation allows us to reformulate the per-BS backhaul constraints into weighted per-BS power constraints and solve the weighted sum rate maximization problem through a generalized weighted minimum mean square error approach. This paper shows that the proposed dynamic clustering algorithm can achieve significant performance gain over existing naive clustering schemes. This paper also proposes two heuristic static clustering schemes that can already achieve a substantial portion of the gain.read more
Citations
More filters
Journal ArticleDOI
Delay Aware Resource Allocation With Radio Remote Head Cooperation in User-Centric C-RAN
TL;DR: A novel framework that considers these requirements simultaneously by integrating the notion of effective capacity into orthogonal frequency division multiple access cloud-radio access networks (C-RAN) where the users select the distributed radio remote heads (RRHs) based on their specific delay requirements to transmit over different subcarriers cooperatively is proposed.
Proceedings ArticleDOI
Dynamic clustering for max-min fairness with joint processing CoMP
TL;DR: A novel application of the successive second order cone programming (SSOCP) approach is proposed for the joint processing and clustering problem for dynamic base station clustering and beamformer design to maximize the minimum rate among all the users.
Journal ArticleDOI
Adaptive heading prediction of moving path for user-centric optimal cell selection toward 5G cooperative cellular communication
Ben-Jye Chang,Yi-Jhih Liou +1 more
TL;DR: Numerical results show that the proposed UE heading Prediction Optimal Cooperative set selection approach outperforms the compared approaches in system capacity, access delay, average dropping probability, reward and net-profit.
Posted Content
Sparse Joint Transmission for Cell-Free Massive MIMO: A Sparse PCA Approach
TL;DR: Sparse-JT achieves higher ergodic spectral efficiencies than those attained by multi-cell zero-forcing precoding with the user-centric AP clustering algorithm in all system configurations, and is guaranteed to identify a local-optimal solution for a relaxed sum-spectral maximization problem.
Journal ArticleDOI
Performance analysis of feedback-free collision resolution NDMA protocol
TL;DR: This work investigates the FF-NDMA protocol from a cellular network perspective in order to elucidate under what circumstances this scheme is more energy efficient than classical NDMA and HARQ- NDMA at low signal-to-noise ratio (SNR) and at medium SNR when the load increases.
References
More filters
Journal ArticleDOI
Enhancing Sparsity by Reweighted ℓ 1 Minimization
TL;DR: A novel method for sparse signal recovery that in many situations outperforms ℓ1 minimization in the sense that substantially fewer measurements are needed for exact recovery.
Journal ArticleDOI
Multi-Cell MIMO Cooperative Networks: A New Look at Interference
TL;DR: An overview of the theory and currently known techniques for multi-cell MIMO (multiple input multiple output) cooperation in wireless networks is presented and a few promising and quite fundamental research avenues are also suggested.
Journal ArticleDOI
An Iteratively Weighted MMSE Approach to Distributed Sum-Utility Maximization for a MIMO Interfering Broadcast Channel
TL;DR: A linear transceiver design algorithm for weighted sum-rate maximization that is based on iterative minimization of weighted mean-square error (MSE) and can be extended to a general class of sum-utility maximization problem.
BookDOI
Interior point algorithms: theory and analysis
TL;DR: This paper presents a meta-analyses of Linear Programming Algorithms and its applications to Convex Optimization, focusing on the areas of linear programming and nonconvex optimization.
Journal ArticleDOI
Weighted sum-rate maximization using weighted MMSE for MIMO-BC beamforming design
TL;DR: A relationship between weighted sum-rate and weighted MMSE in the MIMO-BC is established and two low complexity algorithms for finding a local weighted Sum-rate optimum based on alternating optimization are proposed.