Dynamic Spectrum Management: A Complete Complexity Characterization
From MaRDI portal
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.
Recommendations
- Duality Gap Estimation and Polynomial Time Approximation for Optimal Spectrum Management
- Optimal Spectrum Management in Multiuser Interference Channels
- Dynamic Spectrum Management With the Competitive Market Model
- Spectrum Management for Interference-Limited Multiuser Communication Systems
- On the solution of generalized spectrum allocation problems
- On the complexity of bandwidth allocation in radio networks
Cited in
(2)
This page was built for publication: Dynamic Spectrum Management: A Complete Complexity Characterization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2979113)
