4.6 Article

RRH Clustering Using Affinity Propagation Algorithm with Adaptive Thresholding and Greedy Merging in Cloud Radio Access Network

期刊

SENSORS
卷 21, 期 2, 页码 -

出版社

MDPI
DOI: 10.3390/s21020480

关键词

machine learning; clustering; affinity propagation; C-RAN; exterior interference

资金

  1. Technology Advancement Research Program - Ministry of Land, Infrastructure, and Transport of the Korean government [20CTAP-C151968-02]
  2. National Research Foundation of Korea (NRF) - Korean government (MSIT) [2018R1D1A3B07050327]
  3. National Research Foundation of Korea [2018R1D1A3B07050327] Funding Source: Korea Institute of Science & Technology Information (KISTI), National Science & Technology Information Service (NTIS)

向作者/读者索取更多资源

The proposed improved affinity propagation clustering algorithm addresses the issue of high computational complexity in joint transmission by fixing preferences and adapting threshold values to system parameters. Additionally, a greedy merging algorithm is used to mitigate inter-cluster interference. Experimental results demonstrate that the algorithm outperforms existing ones in terms of performance and energy efficiency.
Affinity propagation (AP) clustering with low complexity and high performance is suitable for radio remote head (RRH) clustering for real-time joint transmission in the cloud radio access network. The existing AP algorithms for joint transmission have the limitation of high computational complexities owing to re-sweeping preferences (diagonal components of the similarity matrix) to determine the optimal number of clusters as system parameters such as network topology. To overcome this limitation, we propose a new approach in which preferences are fixed, where the threshold changes in response to the variations in system parameters. In AP clustering, each diagonal value of a final converged matrix is mapped to the position (x,y coordinates) of a corresponding RRH to form two-dimensional image. Furthermore, an environment-adaptive threshold value is determined by adopting Otsu's method, which uses the gray-scale histogram of the image to make a statistical decision. Additionally, a simple greedy merging algorithm is proposed to resolve the problem of inter-cluster interference owing to the adjacent RRHs selected as exemplars (cluster centers). For a realistic performance assessment, both grid and uniform network topologies are considered, including exterior interference and various transmitting power levels of an RRH. It is demonstrated that with similar normalized execution times, the proposed algorithm provides better spectral and energy efficiencies than those of the existing algorithms.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据