Abstract
In this study, we consider an energy-efficient and low-complexity transmission control in a SWIPT-NOMA-based green cellular network (GCN) that consists of a green base station (GBS) and green users (GUEs). First, we formulate a non-convex problem that minimizes transmit power consumption while supporting minimum downlink user service rate, downlink data queue stability, and user battery availability. Then, we transform the problem into a Lyapunov-drift-penalty minimization problem, which can determine a new resource allocation scheme that balances transmit power consumption and queue stability. Second, the Lyapunov-drift-penalty problem is decomposed into subchannel assignment, power allocation, and power splitting (PS) ratio control problems. The subchannel assignment problem is solved using a matching theory-based low-complexity algorithm. The power allocation and PS ratio control problems are solved using the alternating optimization (AO) approach and bisection method. This decomposed subproblem-based control also enables distributed control between the GBS and GUEs. Third, we prove the convergence, optimality, and polynomial computation complexity of the proposed algorithm. Lastly, we demonstrate that the proposed control outperforms the benchmark controls regarding transmit power consumption and the achievable rate. Owing to the optimality and low complexity, the proposed control can be efficiently applied to large-scale and distributed GCNs in sixth-generation environments.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.