Cart (Loading....) | Create Account
Close category search window
 

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Fallgren, M. ; Dept. of Math., R. Inst. of Technol., Stockholm, Sweden

We consider wireless telecommunications systems with orthogonal frequency bands, where each band is referred to as a channel, e.g., orthogonal frequency-division multiple access (OFDMA). For a given snap-shot in time, two joint channel assignment and power allocation optimization problems are presented, one in downlink and one in uplink. The objective is to maximize the minimum total Shannon capacity of any mobile user in the system, subject to system constraints. The corresponding decision problems are proved to be NP-hard. We also show that for any constant ρ > 0, a sufficiently large number of channels ensure that the optimization problems are not ρ-approximable, unless P is equal to NP.

Published in:

Quality of Service (IWQoS), 2010 18th International Workshop on

Date of Conference:

16-18 June 2010

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.