
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.
| 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 |
