Abstract

AbstractIn this article, the problem of joint relay assignment and energy‐efficiency maximization (J‐RA‐EE‐MAX) in energy‐harvesting downlink (DL) and uplink (UL) clustered nonorthogonal multiple‐access (NOMA) networks is considered. Specifically, the aim is to perform relay assignment to user clusters in the DL and UL directions, while simultaneously maximizing energy efficiency (EE) over each relay via multiobjective optimization, and satisfying users' quality‐of‐service (QoS) constraints. However, problem J‐RA‐EE‐MAX happens to be nonconvex in each link direction, and thus is computationally prohibitive. Alternatively, a low‐complexity solution procedure is devised to solve problem J‐RA‐EE‐MAX in each link direction by: (i) optimally solving the energy‐efficiency maximizing power allocation (EE‐MAX‐PA) for each (user cluster, relay) combination to construct the relays' preference profile, and (ii) performing relay assignment via Gale's top trading cycles (TTC) matching mechanism. In particular, the optimal solution of the EE‐MAX‐PA problem is obtained by transforming it into a concave maximization problem, while the TTC mechanism is executed in linear time‐complexity so as to obtain a stable relay assignment. Simulation results are presented to validate the proposed solution procedure, which is shown to yield comparable user cluster sum‐rate and relay EE to the J‐RA‐EE‐MAX scheme, and superior to other schemes in both link directions, however, at lower computational complexity, while satisfying users' QoS constraints. Finally, this work sheds light on the importance of decoupling relay assignment in the DL/UL directions, which significantly improves user cluster sum‐rate and relay EE in comparison to coupled relay assignment schemes, and thus serves the requirements of 5G networks and beyond.

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.