Energy-efficient user association and cell sleeping strategy for multi-tier ultra-dense small cell networks

In this letter, the authors formulate the energy-efficient user association and cell sleeping optimisation problem which applies to the multi-tier ultradense network scenarios as a complex 0–1 integer programming and propose an alternating iterative method to solve the problem via two low-complexity...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Electronics letters Jg. 54; H. 12; S. 787 - 789
Hauptverfasser: Sun, Yang, Chang, Yongyu
Format: Journal Article
Sprache:Englisch
Veröffentlicht: The Institution of Engineering and Technology 14.06.2018
Schlagworte:
alternating iterative method
cell sleeping optimisation problem
cellular radio
complex integer programming
energy consumption
energy‐efficient user association
iterative methods
low‐complexity sub‐problems
multitier ultradense network scenarios
multitier ultra‐dense small cell networks
optimisation
power consumption
telecommunication power management
Wireless communications
iterative methods
multitier ultradense network scenarios
low-complexity sub-problems
complex integer programming
telecommunication power management
multitier ultra-dense small cell networks
power consumption
optimisation
energy-efficient user association
alternating iterative method
energy consumption
cellular radio
cell sleeping optimisation problem
ISSN:0013-5194, 1350-911X, 1350-911X
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this letter, the authors formulate the energy-efficient user association and cell sleeping optimisation problem which applies to the multi-tier ultradense network scenarios as a complex 0–1 integer programming and propose an alternating iterative method to solve the problem via two low-complexity sub-problems. The simulation results show that the proposed strategy can steadily reduce overall energy consumption compared with the existing strategies.
ISSN:0013-5194
1350-911X
1350-911X
DOI:10.1049/el.2018.0945