On the complexity of maximizing the minimum Shannon capacity in Wireless Networks by joint channel assignment and power allocation

Mikael Fallgren
2010 2010 IEEE 18th International Workshop on Quality of Service (IWQoS)  
We consider wireless telecommunications systems with orthogonal frequency bands, where each band is referred to as a channel, e.g., orthogonal frequencydivision multiple access (OFDMA). For a snap-shot in time, a joint channel assignment and power allocation optimization problem is presented, both in downlink and in uplink, where the objective is to maximize the minimum total Shannon capacity of any mobile user in the system. The corresponding decision problem is proved to be NP-hard. Another
more » ... NP-hard. Another proof gives that for any constant ρ > 0, a sufficiently large number of channels ensures that the optimization problem is not ρ-approximable, unless P is equal to NP. If assuming that the channel allocation is known, the remaining power allocation optimization problem also has this inapproximability property. This power allocation optimization problem formulation is not convex in general. However, if each transmitter only is allowed to use one single channel, then it is shown that every KKT point is a global optimum.
doi:10.1109/iwqos.2010.5542766 dblp:conf/iwqos/Fallgren10 fatcat:bsr2l67dqze2jdtypeyv3q2phu