z-logo
open-access-imgOpen Access
Energy efficiency maximisation in downlink multi‐cell networks via coordinated resource allocation
Author(s) -
Tong Zhao,
Li Bingbing,
Hui Yongtao
Publication year - 2015
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2014.0097
Subject(s) - computer science , beamforming , mathematical optimization , telecommunications link , efficient energy use , scheduling (production processes) , base station , iterative method , resource allocation , greedy algorithm , algorithm , mathematics , telecommunications , computer network , engineering , electrical engineering
There is a great interest in considering the energy efficiency (EE) as an important performance evaluation recently for its contribution to both energy saving and environmental conservation. In this study, the authors focus on the optimal energy‐efficient design for downlink multi‐cell environment with coordinated scheduling and beamforming. The EE is defined as bit‐per‐joule capacity to indicate how efficiently energy is consumed for transmitting information. They set up the optimum model for maximising the EE of coordinated cells subject to a total power constraint at each base station and study the resource allocation (RA) for it, including user selection, power allocation and beamforming vectors optimisation. They consider an equivalent non‐fractional form of the original problem and propose an iterative algorithm to optimise the spectrum RA and beamforming vectors alternatively. In each iteration, the beamforming vectors are updated by the iterative algorithm based on the first‐order optimality conditions, while the user scheduling policy is updated by the enhanced greedy algorithm. Performance studies show that the proposed algorithm has a rapid speed of convergence and achieves significant performance gain in EE for cellular networks.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here