Use this URL to cite or link to this record in EThOS: https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.751835
Title: Green scheduling and resource allocation in clustered dense small cells
Author: Yang, Ting
Awarding Body: University of Surrey
Current Institution: University of Surrey
Date of Award: 2018
Availability of Full Text:
Access from EThOS:
Access from Institution:
Abstract:
Future communication networks promise to provide ubiquitous high-speed services for numerous users, as such, it is envisioned that one of the key aspects of the next generation of communication network is the deployment of different types of access points, e.g. small cells (SCs), on a massive scale. Meanwhile, energy efficiency (EE) has become an important feature for designing the next generation of communication networks and offering good user experience to all users while incurring low operational cost to the operators. In this context, this thesis focuses on the design of a novel green scheduling framework for improving both the EE and user fairness in the underlay HetNet scenario. Focusing on the user/subcarrier allocation, we design an EE-based allocation boundary which dynamically categorises users into inner area and cell-edge users. Our dynamic resource allocation boundary is updated at every scheduling interval such that it can capture the time-varying characteristics of the mobile networks, contrary to the fixed boundaries used in long-term planning schemes (e.g. fractional frequency reuse). This dynamic allocation boundary is used to design a green scheduling scheme and can improve the EE of an underlay HetNet system by up to 70% as compared to existing schemes. Focusing on the power allocation algorithm, a low-complexity energy-efficient power allocation algorithm is designed to coordinate the macro and underlay SCs and fully exploit the transmit power reduction capability of SCs. By applying a symmetric user grouping method, it is shown that the original non-convex EE optimisation problem can be transformed into a pseudo-convex problem, where the optimal power allocation can be obtained for a given user/subcarrier allocation. This energy-efficient power allocation algorithm is further incorporated with the dynamic allocation boundary which improves the EE (up to 70%) and user fairness (up to 50%) compared to existing algorithms in the underlay HetNet.
Supervisor: Heliot, Fabien ; Foh, Chuan Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID: uk.bl.ethos.751835  DOI: Not available
Share: