Complexity reduction of pico cell clustering for interference alignment in heterogeneous networks

Ryuma Seno, Tomoaki Ohtsuki, Wenjie Jiang, Yasushi Takatori

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

Interference Alignment (IA) in heterogeneous networks (HetNets) is a promising technique that improves the spectral efficiency significantly. We showed in [1] that transmit antennas at pico BSs could be utilized more efficiently by clustering pico cells in IA in HetNet where the clustering formation was optimized so as to minimize the rate loss caused by inter-cluster interference. In [1], the optimum clustering formation was selected by comparing all possible formations, that is, the value of the objective function for all possible formations was calculated. Therefore, we required the enormous complexity to construct pico cell clusters. In this paper, we propose a novel algorithm for clustering pico cells that reduces the complexity of the clustering process. In particular, we define rate-loss matrix that represents the rate loss caused by inter-pico interference, and translate the optimization problem to the construction of rate-loss matrix. Clearly, the proposed algorithm is sub-optimum in terms of achievable rate compared to all-search algorithm used in [1]. However, the simulation results show that the difference of achievable rate between the proposed algorithm and all-search algorithm is negligible and becomes smaller as the cluster size decreases. We evaluate the complexity of proposed algorithm quantitatively comparing to all-search algorithm, and show that our algorithm reduces the complexity of clustering process significantly while achieving almost same performance.

Original languageEnglish
Title of host publication2015 21st Asia-Pacific Conference on Communications, APCC 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages267-271
Number of pages5
ISBN (Print)9784885523014
DOIs
Publication statusPublished - 2016 Feb 17
Event21st Asia-Pacific Conference on Communications, APCC 2015 - Kyoto, Japan
Duration: 2015 Oct 142015 Oct 16

Other

Other21st Asia-Pacific Conference on Communications, APCC 2015
CountryJapan
CityKyoto
Period15/10/1415/10/16

Fingerprint

Heterogeneous networks
Antennas

Keywords

  • complexity reduction
  • heterogeneous networks
  • interference alignment

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Seno, R., Ohtsuki, T., Jiang, W., & Takatori, Y. (2016). Complexity reduction of pico cell clustering for interference alignment in heterogeneous networks. In 2015 21st Asia-Pacific Conference on Communications, APCC 2015 (pp. 267-271). [7412523] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/APCC.2015.7412523

Complexity reduction of pico cell clustering for interference alignment in heterogeneous networks. / Seno, Ryuma; Ohtsuki, Tomoaki; Jiang, Wenjie; Takatori, Yasushi.

2015 21st Asia-Pacific Conference on Communications, APCC 2015. Institute of Electrical and Electronics Engineers Inc., 2016. p. 267-271 7412523.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Seno, R, Ohtsuki, T, Jiang, W & Takatori, Y 2016, Complexity reduction of pico cell clustering for interference alignment in heterogeneous networks. in 2015 21st Asia-Pacific Conference on Communications, APCC 2015., 7412523, Institute of Electrical and Electronics Engineers Inc., pp. 267-271, 21st Asia-Pacific Conference on Communications, APCC 2015, Kyoto, Japan, 15/10/14. https://doi.org/10.1109/APCC.2015.7412523
Seno R, Ohtsuki T, Jiang W, Takatori Y. Complexity reduction of pico cell clustering for interference alignment in heterogeneous networks. In 2015 21st Asia-Pacific Conference on Communications, APCC 2015. Institute of Electrical and Electronics Engineers Inc. 2016. p. 267-271. 7412523 https://doi.org/10.1109/APCC.2015.7412523
Seno, Ryuma ; Ohtsuki, Tomoaki ; Jiang, Wenjie ; Takatori, Yasushi. / Complexity reduction of pico cell clustering for interference alignment in heterogeneous networks. 2015 21st Asia-Pacific Conference on Communications, APCC 2015. Institute of Electrical and Electronics Engineers Inc., 2016. pp. 267-271
@inproceedings{338cabe079f64bfd9a5f120e3aded3f4,
title = "Complexity reduction of pico cell clustering for interference alignment in heterogeneous networks",
abstract = "Interference Alignment (IA) in heterogeneous networks (HetNets) is a promising technique that improves the spectral efficiency significantly. We showed in [1] that transmit antennas at pico BSs could be utilized more efficiently by clustering pico cells in IA in HetNet where the clustering formation was optimized so as to minimize the rate loss caused by inter-cluster interference. In [1], the optimum clustering formation was selected by comparing all possible formations, that is, the value of the objective function for all possible formations was calculated. Therefore, we required the enormous complexity to construct pico cell clusters. In this paper, we propose a novel algorithm for clustering pico cells that reduces the complexity of the clustering process. In particular, we define rate-loss matrix that represents the rate loss caused by inter-pico interference, and translate the optimization problem to the construction of rate-loss matrix. Clearly, the proposed algorithm is sub-optimum in terms of achievable rate compared to all-search algorithm used in [1]. However, the simulation results show that the difference of achievable rate between the proposed algorithm and all-search algorithm is negligible and becomes smaller as the cluster size decreases. We evaluate the complexity of proposed algorithm quantitatively comparing to all-search algorithm, and show that our algorithm reduces the complexity of clustering process significantly while achieving almost same performance.",
keywords = "complexity reduction, heterogeneous networks, interference alignment",
author = "Ryuma Seno and Tomoaki Ohtsuki and Wenjie Jiang and Yasushi Takatori",
year = "2016",
month = "2",
day = "17",
doi = "10.1109/APCC.2015.7412523",
language = "English",
isbn = "9784885523014",
pages = "267--271",
booktitle = "2015 21st Asia-Pacific Conference on Communications, APCC 2015",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Complexity reduction of pico cell clustering for interference alignment in heterogeneous networks

AU - Seno, Ryuma

AU - Ohtsuki, Tomoaki

AU - Jiang, Wenjie

AU - Takatori, Yasushi

PY - 2016/2/17

Y1 - 2016/2/17

N2 - Interference Alignment (IA) in heterogeneous networks (HetNets) is a promising technique that improves the spectral efficiency significantly. We showed in [1] that transmit antennas at pico BSs could be utilized more efficiently by clustering pico cells in IA in HetNet where the clustering formation was optimized so as to minimize the rate loss caused by inter-cluster interference. In [1], the optimum clustering formation was selected by comparing all possible formations, that is, the value of the objective function for all possible formations was calculated. Therefore, we required the enormous complexity to construct pico cell clusters. In this paper, we propose a novel algorithm for clustering pico cells that reduces the complexity of the clustering process. In particular, we define rate-loss matrix that represents the rate loss caused by inter-pico interference, and translate the optimization problem to the construction of rate-loss matrix. Clearly, the proposed algorithm is sub-optimum in terms of achievable rate compared to all-search algorithm used in [1]. However, the simulation results show that the difference of achievable rate between the proposed algorithm and all-search algorithm is negligible and becomes smaller as the cluster size decreases. We evaluate the complexity of proposed algorithm quantitatively comparing to all-search algorithm, and show that our algorithm reduces the complexity of clustering process significantly while achieving almost same performance.

AB - Interference Alignment (IA) in heterogeneous networks (HetNets) is a promising technique that improves the spectral efficiency significantly. We showed in [1] that transmit antennas at pico BSs could be utilized more efficiently by clustering pico cells in IA in HetNet where the clustering formation was optimized so as to minimize the rate loss caused by inter-cluster interference. In [1], the optimum clustering formation was selected by comparing all possible formations, that is, the value of the objective function for all possible formations was calculated. Therefore, we required the enormous complexity to construct pico cell clusters. In this paper, we propose a novel algorithm for clustering pico cells that reduces the complexity of the clustering process. In particular, we define rate-loss matrix that represents the rate loss caused by inter-pico interference, and translate the optimization problem to the construction of rate-loss matrix. Clearly, the proposed algorithm is sub-optimum in terms of achievable rate compared to all-search algorithm used in [1]. However, the simulation results show that the difference of achievable rate between the proposed algorithm and all-search algorithm is negligible and becomes smaller as the cluster size decreases. We evaluate the complexity of proposed algorithm quantitatively comparing to all-search algorithm, and show that our algorithm reduces the complexity of clustering process significantly while achieving almost same performance.

KW - complexity reduction

KW - heterogeneous networks

KW - interference alignment

UR - http://www.scopus.com/inward/record.url?scp=84964669365&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84964669365&partnerID=8YFLogxK

U2 - 10.1109/APCC.2015.7412523

DO - 10.1109/APCC.2015.7412523

M3 - Conference contribution

AN - SCOPUS:84964669365

SN - 9784885523014

SP - 267

EP - 271

BT - 2015 21st Asia-Pacific Conference on Communications, APCC 2015

PB - Institute of Electrical and Electronics Engineers Inc.

ER -