Abstract

In this paper, the energy-efficient resource scheduling is investigated considering quality of service (QoS) constraints for OFDMA based heterogeneous network (HetNet). The energy efficiency (EE) is measured as “throughput (bits) per Joule”, while the power consumption model includes RF transmit and circuit power (i.e. feeder loss, cite cooling, signal processing). Compared to existing literature on QoS aware method which mainly consider sum throughput or total transmission power as objective function for optimization, we investigate and model an optimization problem to maximize the EE subject to users' QoS requirements. Given QoS (data rate) requirement for maximizing EE, a constrained based optimization problem is devised. Since the optimization problem is non-convex in nature, we reconstruct the optimization problem as a convex one and devise a pragmatically efficient novel resource assignment algorithm for maximizing achievable EE with quick convergence. The considered optimization problem is transformed into a convex optimization problem by redefining the constraint using the cubic inequality satisfying certain conditions to prove non-negativity, which leads to the problem to be solve as a convex optimization method and results in an efficient iterative resource allocation algorithm. In each iteration, the transformed problem is solved by using Lagrangian dual decomposition with a projected gradient method. Analytical insights and numerical results exhibit the potency of the devised scheme for the targeted complex wireless systems. Our analysis also provides design guidelines for the future design and deployment of green wireless networks as approach the 5G era.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.