Remote Radio Head Activation and User Association in Dense C-RANs

Cloud radio access networks (C-RANs) is a promising technology for improving the performance of future mobile networks. In this paper, we focus on the joint remote radio head (RRH) activation and user association problem in dense C-RANs. Considering that a certain required minimum data rate may not...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on vehicular technology Ročník 69; číslo 10; s. 12216 - 12228
Hlavní autoři: Wu, Zhikun, Fei, Zesong, Zheng, Zhong, Li, Bin, Han, Zhu
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.10.2020
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
activation
Algorithms
association
Cloud computing
Cloud radio access networks
Computational complexity
distributed
Interference
max-sum algorithm
Optimization
Power consumption
Power demand
Radio
Signal processing algorithms
Signal to noise ratio
Throughput
User satisfaction
Wireless networks
ISSN:0018-9545, 1939-9359
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Cloud radio access networks (C-RANs) is a promising technology for improving the performance of future mobile networks. In this paper, we focus on the joint remote radio head (RRH) activation and user association problem in dense C-RANs. Considering that a certain required minimum data rate may not be satisfied universally for all users in some situation, we aim to first maximize the number of users whose minimum data rate constraints can be guaranteed, and then maximize the system profit, which is a combination of the system throughput and the total power consumption. Due to the NP-hard feature of the problem, the conventional algorithms are impractical when the network size is large due to large computational complexity. Therefore, we adopt the max-sum algorithm to efficiently solve the joint RRH activation and user association problem, which can be implemented efficiently in a distributed manner. The signaling overhead of the max-sum algorithm can be reduced further by simplifying message updating rules and by shortening messages exchanged between nodes. Considering the fact that the high density of RRH deployment may hinder the convergence rate of the max-sum algorithm, we also propose a simplified algorithm by decomposing the original problem into two sub-problems, and each can be solved by the max-sum algorithm individually. Simulation results prove the efficiencies of the proposed algorithms.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0018-9545
1939-9359
DOI:10.1109/TVT.2020.3016188