Gaussian downlink user selection subject to access limit, power budget, and rate demands

作     者：Liu, Xiang Zou, Jinyu Chen, Pengpeng Wan, Peng-Jun 

作者机构：Dongguan Univ Technol Dongguan Peoples R China IIT Chicago IL 60616 USA 

出 版 物：《THEORETICAL COMPUTER SCIENCE》 (理论计算机科学)

年 卷 期：2022年第931卷

页      面：78-92页

核心收录：

学科分类：08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：Successive interference cancellation Access limit User selection Approximation algorithm 

摘      要：Consider a Gaussian downlink between an access point with power budget P 0, and a set of users specified by their effective noises and rate demands. In order to control the decoding complexity and error propagation, an integer-valued access limit M 0 is imposed on the number of superimposed users. For each subset S of users, its (total) power demand p (S) is a strictly increasing and nonseparable function of the effective noises and rate demands of users in S. A subset S of users is feasible if |S| = M and p (S) = P. The goal is to select a feasible subset S of users whose total rate demand is maximized. In this paper, we show that this problem is NP-hard, and present a (1 -1/e)-approximation algorithm for this problem. In addition, we also give several other approximation algorithms with trade-offs between accuracy and efficiency. (C) 2022 Published by Elsevier B.V.