In the emerging non-orthogonal multiple access-based unmanned aerial vehicle systems, it is of practical importance to maximize the number of users with satisfied quality-of-service experience by incorporating placement design, admission control, and power allocation. To overcome the combinatorial nature and non-convexity of the above problem, a low-complexity mechanism is proposed based on the penalty function method and the successive convex approximation, and it converges to a Karush-Kuhn-Tucker point of the original problem. Simulations are provided to show the necessity of conducting the above optimization and the efficiency of the proposed mechanism.
No takes yet. Share an insight, caveat, or question.
Tang et al. (2019) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: