A low-complexity cell clustering algorithm in dense small cell networks

Ryuma Seno, Tomoaki Ohtsuki, Wenjie Jiang, Yasushi Takatori

研究成果: Article査読

6 被引用数 (Scopus)

抄録

Clustering plays an important role in constructing practical network systems. In this paper, we propose a novel clustering algorithm with low complexity for dense small cell networks, which is a promising deployment in next-generation wireless networking. Our algorithm is a matrix-based algorithm where metrics for the clustering process are represented as a matrix on which the clustering problem is represented as the maximization of elements. The proposed algorithm simplifies the exhaustive search for all possible clustering formations to the sequential selection of small cells, which significantly reduces the clustering process complexity. We evaluate the complexity and the achievable rate with the proposed algorithm and show that our algorithm achieves almost optimal performance, i.e., almost the same performance achieved by exhaustive search, while substantially reducing the clustering process complexity.

本文言語English
論文番号262
ジャーナルEurasip Journal on Wireless Communications and Networking
2016
1
DOI
出版ステータスPublished - 2016 12月 1

ASJC Scopus subject areas

  • 信号処理
  • コンピュータ サイエンスの応用
  • コンピュータ ネットワークおよび通信

フィンガープリント

「A low-complexity cell clustering algorithm in dense small cell networks」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル