Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Wireless Networksarrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
Wireless Networks
Article . 2020 . Peer-reviewed
License: Springer TDM
Data sources: Crossref
versions View all 1 versions
addClaim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

Energy-efficient resource allocation for multi-RAT networks under time average QoS constraint

Authors: Guanhua Chai; Weihua Wu; Qinghai Yang; Runzi Liu; Meng Qin; Kyung Sup Kwak;

Energy-efficient resource allocation for multi-RAT networks under time average QoS constraint

Abstract

In this paper, we propose an energy-efficient resource allocation algorithm for multiple radio access technologies (multi-RAT) networks, where the user equipments (UEs) transmit data over multiple radio interfaces for exploiting the complementary advantages of different RATs. In this scenario, the resource allocation is formulated as a stochastic energy efficiency (EE) maximization problem. More specifically, the time average quality of service constraint is considered to provide the flexible resource allocation over the time-varying fading channels. The virtual queue is introduced for each UE to deal with the time average transmission requirement. By adopting Lyapunov optimization technique and fractional programming theory, the non-concave EE maximization is converted into a mixed integer nonlinear optimization (MINO) problem. After that, the continuity relaxation and Lagrange dual methods are used to find the solution of the MINO problem. Then, we develop an EE-based dynamic joint subcarrier and power allocation algorithm, which does not require any prior knowledge of the channel state information. In addition, the performance bounds of the EE and virtual queue are provided. Our simulation results show that the performance of the proposed algorithm is better than other general algorithms.

Related Organizations
  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    2
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
2
Average
Average
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!