A Fast Terminal Matching Method for Interference Coordination Based on Wavelet Transform and Graph Theory in Ultra-Dense Multi-Cell Scenarios

The intensive deployment of cells in a wireless communication system may significantly increase the network capacity, but it may cause more complex and severe inter-cell interference. In order to effectively coordinate the interference, terminals in different cells are matched with the purpose of av...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Junxiang Gou, Lusheng Wang, Hai Lin, Min Peng, Caihong Kai
Formato:	article
Lenguaje:	EN
Publicado:	IEEE 2021
Materias:	Ultra-dense network interference coordination wavelet transform graph theory multiple-dimensional assignment problem Electrical engineering. Electronics. Nuclear engineering TK1-9971
Acceso en línea:	https://doaj.org/article/a3143abfbc46457f91a97af1e2e8bfa6
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:a3143abfbc46457f91a97af1e2e8bfa6
record_format	dspace
spelling	oai:doaj.org-article:a3143abfbc46457f91a97af1e2e8bfa62021-11-18T00:06:17ZA Fast Terminal Matching Method for Interference Coordination Based on Wavelet Transform and Graph Theory in Ultra-Dense Multi-Cell Scenarios2169-353610.1109/ACCESS.2021.3124361https://doaj.org/article/a3143abfbc46457f91a97af1e2e8bfa62021-01-01T00:00:00Zhttps://ieeexplore.ieee.org/document/9594836/https://doaj.org/toc/2169-3536The intensive deployment of cells in a wireless communication system may significantly increase the network capacity, but it may cause more complex and severe inter-cell interference. In order to effectively coordinate the interference, terminals in different cells are matched with the purpose of avoiding severe interference, called terminal matching, and a fast method is proposed in this article for multi-cell scenarios. By constructing a fully weighted graph of all the base stations with interferences as the weights, the minimum spanning tree method in graph theory is used to identify the coordination relationship among all the cells, and multiple coordination pairs can be obtained. For each coordination pair, terminal matching is modeled as a two-dimensional assignment problem between the coefficients after wavelet decomposition and Hungarian algorithm is applied to obtain their optimal match. Wavelet transform is used to extract the scale transformation coefficients describing the terminal features in each single cell, so that the optimization process can be accelerated because the amount of these coefficients is dramatically reduced after several layers of wavelet decomposition. The minimum Hamilton path method in graph theory is used to rank the terminals in each cell based on their key features, so that the coefficients lose as minimum useful information as possible during wavelet decomposition. Simulation results show that the performance of the proposed method reaches approximately the optimal matching obtained by traversing all the coordination possibilities among all the cells. Compared with the simulated annealing algorithm, the performance loss in terms of system spectral efficiency is only about 2%, but the proposed method requires only less than one thousandth of its computational time.Junxiang GouLusheng WangHai LinMin PengCaihong KaiIEEEarticleUltra-dense networkinterference coordinationwavelet transformgraph theorymultiple-dimensional assignment problemElectrical engineering. Electronics. Nuclear engineeringTK1-9971ENIEEE Access, Vol 9, Pp 150649-150662 (2021)
institution	DOAJ
collection	DOAJ
language	EN
topic	Ultra-dense network interference coordination wavelet transform graph theory multiple-dimensional assignment problem Electrical engineering. Electronics. Nuclear engineering TK1-9971
spellingShingle	Ultra-dense network interference coordination wavelet transform graph theory multiple-dimensional assignment problem Electrical engineering. Electronics. Nuclear engineering TK1-9971 Junxiang Gou Lusheng Wang Hai Lin Min Peng Caihong Kai A Fast Terminal Matching Method for Interference Coordination Based on Wavelet Transform and Graph Theory in Ultra-Dense Multi-Cell Scenarios
description	The intensive deployment of cells in a wireless communication system may significantly increase the network capacity, but it may cause more complex and severe inter-cell interference. In order to effectively coordinate the interference, terminals in different cells are matched with the purpose of avoiding severe interference, called terminal matching, and a fast method is proposed in this article for multi-cell scenarios. By constructing a fully weighted graph of all the base stations with interferences as the weights, the minimum spanning tree method in graph theory is used to identify the coordination relationship among all the cells, and multiple coordination pairs can be obtained. For each coordination pair, terminal matching is modeled as a two-dimensional assignment problem between the coefficients after wavelet decomposition and Hungarian algorithm is applied to obtain their optimal match. Wavelet transform is used to extract the scale transformation coefficients describing the terminal features in each single cell, so that the optimization process can be accelerated because the amount of these coefficients is dramatically reduced after several layers of wavelet decomposition. The minimum Hamilton path method in graph theory is used to rank the terminals in each cell based on their key features, so that the coefficients lose as minimum useful information as possible during wavelet decomposition. Simulation results show that the performance of the proposed method reaches approximately the optimal matching obtained by traversing all the coordination possibilities among all the cells. Compared with the simulated annealing algorithm, the performance loss in terms of system spectral efficiency is only about 2%, but the proposed method requires only less than one thousandth of its computational time.
format	article
author	Junxiang Gou Lusheng Wang Hai Lin Min Peng Caihong Kai
author_facet	Junxiang Gou Lusheng Wang Hai Lin Min Peng Caihong Kai
author_sort	Junxiang Gou
title	A Fast Terminal Matching Method for Interference Coordination Based on Wavelet Transform and Graph Theory in Ultra-Dense Multi-Cell Scenarios
title_short	A Fast Terminal Matching Method for Interference Coordination Based on Wavelet Transform and Graph Theory in Ultra-Dense Multi-Cell Scenarios
title_full	A Fast Terminal Matching Method for Interference Coordination Based on Wavelet Transform and Graph Theory in Ultra-Dense Multi-Cell Scenarios
title_fullStr	A Fast Terminal Matching Method for Interference Coordination Based on Wavelet Transform and Graph Theory in Ultra-Dense Multi-Cell Scenarios
title_full_unstemmed	A Fast Terminal Matching Method for Interference Coordination Based on Wavelet Transform and Graph Theory in Ultra-Dense Multi-Cell Scenarios
title_sort	fast terminal matching method for interference coordination based on wavelet transform and graph theory in ultra-dense multi-cell scenarios
publisher	IEEE
publishDate	2021
url	https://doaj.org/article/a3143abfbc46457f91a97af1e2e8bfa6
work_keys_str_mv	AT junxianggou afastterminalmatchingmethodforinterferencecoordinationbasedonwavelettransformandgraphtheoryinultradensemulticellscenarios AT lushengwang afastterminalmatchingmethodforinterferencecoordinationbasedonwavelettransformandgraphtheoryinultradensemulticellscenarios AT hailin afastterminalmatchingmethodforinterferencecoordinationbasedonwavelettransformandgraphtheoryinultradensemulticellscenarios AT minpeng afastterminalmatchingmethodforinterferencecoordinationbasedonwavelettransformandgraphtheoryinultradensemulticellscenarios AT caihongkai afastterminalmatchingmethodforinterferencecoordinationbasedonwavelettransformandgraphtheoryinultradensemulticellscenarios AT junxianggou fastterminalmatchingmethodforinterferencecoordinationbasedonwavelettransformandgraphtheoryinultradensemulticellscenarios AT lushengwang fastterminalmatchingmethodforinterferencecoordinationbasedonwavelettransformandgraphtheoryinultradensemulticellscenarios AT hailin fastterminalmatchingmethodforinterferencecoordinationbasedonwavelettransformandgraphtheoryinultradensemulticellscenarios AT minpeng fastterminalmatchingmethodforinterferencecoordinationbasedonwavelettransformandgraphtheoryinultradensemulticellscenarios AT caihongkai fastterminalmatchingmethodforinterferencecoordinationbasedonwavelettransformandgraphtheoryinultradensemulticellscenarios
_version_	1718425242495352832

A Fast Terminal Matching Method for Interference Coordination Based on Wavelet Transform and Graph Theory in Ultra-Dense Multi-Cell Scenarios

Ejemplares similares