Dynamic Spectrum Management: A Complete Complexity Characterization
Abstract: Consider a multi-user multi-carrier communication system where multiple users share multiple discrete subcarriers. To achieve high spectrum efficiency, the users in the system must choose their transmit power dynamically in response to fast channel fluctuations. Assuming perfect channel state information, two formulations for the spectrum management (power control) problem are considered in this paper: the first is to minimize the total transmission power subject to all users' transmission data rate constraints, and the second is to maximize the min-rate utility subject to individual power constraints at each user. It is known in the literature that both formulations of the problem are polynomial time solvable when the number of subcarriers is one and strongly NP-hard when the number of subcarriers are greater than or equal to three. However, the complexity characterization of the problem when the number of subcarriers is two has been missing for a long time. This paper answers this long-standing open question: both formulations of the problem are strongly NP-hard when the number of subcarriers is two.
Keywords: Complexity theory, multi-carrier communication system, spectrum management, strong NP-hardness
Category 1: Global Optimization (Theory )
Category 2: Applications -- OR and Management Sciences (Telecommunications )
Category 3: Applications -- OR and Management Sciences
Citation: Ya-Feng Liu, Dynamic Spectrum Management: A Complete Complexity Characterization,accepted for publication in IEEE Transactions on Information Theory, October 27, 2016.
Entry Submitted: 10/28/2016
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|