Skip to main navigation Skip to search Skip to main content

Interference graph based knapsack clustering algorithm in ultra-dense networks

  • Harbin Institute of Technology
  • Ministry of Education of the People's Republic of China

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

To solve the problem of high inter-cell interference in ultra-dense networks, this paper proposes an interfer-ence graph based knapsack clustering algorithm. Firstly, the weighted undirected interference graph is drawn by measuring the reference signal receiving power (RSRP) of adjacent base stations (BSs) through user equipment (UE). On this basis, the clustering result matches the distribution of user service through dynamic programming, in which avoiding intra-cluster interference and minimizing inter-cluster interference serve as a criterion. The simulation results show that compared with traditional clustering algorithm, the proposed algorithm effectively improves the satisfaction rate of user service as well as system throughput.

Original languageEnglish
Title of host publication2022 IEEE MTT-S International Wireless Symposium, IWS 2022 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781665481977
DOIs
StatePublished - 2022
Event9th IEEE MTT-S International Wireless Symposium, IWS 2022 - Harbin, China
Duration: 12 Aug 202215 Aug 2022

Publication series

Name2022 IEEE MTT-S International Wireless Symposium, IWS 2022 - Proceedings

Conference

Conference9th IEEE MTT-S International Wireless Symposium, IWS 2022
Country/TerritoryChina
CityHarbin
Period12/08/2215/08/22

Keywords

  • clustering
  • dynamic programming
  • interference graph
  • ultra-dense networks

Fingerprint

Dive into the research topics of 'Interference graph based knapsack clustering algorithm in ultra-dense networks'. Together they form a unique fingerprint.

Cite this