Towards Optimal Resource Allocation in Wireless Powered Communication Networks with Non-Orthogonal Multiple Access

The optimal allocation of time and energy resources is characterized in a Wireless Powered Communication Network (WPCN) with non-Orthogonal Multiple Access (NOMA). We consider two different formulations; in the first one (max-sum), the sum-throughput of all users is maximized. In the second one (max...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2018-08
Main Authors: Aboelwafa, Mariam M N, Abd-Elmagid, Mohamed A, Biason, Alessandro, Seddik, Karim G, ElBatt, Tamer, Zorzi, Michele
Format: Article
Language:English
Subjects:
Approximation
Communication networks
Convex analysis
Convexity
Decoding
Economic models
Energy sources
Formulations
Maximization
Nonorthogonal multiple access
Optimization
Resource allocation
Wireless communications
Wireless networks
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The optimal allocation of time and energy resources is characterized in a Wireless Powered Communication Network (WPCN) with non-Orthogonal Multiple Access (NOMA). We consider two different formulations; in the first one (max-sum), the sum-throughput of all users is maximized. In the second one (max-min), and targeting fairness among users, we consider maximizing the min-throughput of all users. Under the above two formulations, two NOMA decoding schemes are studied, namely, low complexity decoding (LCD) and successive interference cancellation decoding (SICD). Due to the non-convexity of three of the studied optimization problems, we consider an approximation approach, in which the non-convex optimization problem is approximated by a convex optimization problem, which satisfies all the constraints of the original problem. The approximated convex optimization problem can then be solved iteratively. The results show a trade-off between maximizing the sum throughout and achieving fairness through maximizing the minimum throughput.
ISSN:2331-8422