By Topic

Dynamic Power Allocation for Throughput Utility Maximization in Interference-Limited Networks

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
$33 $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

4 Author(s)
Ju, Honghao ; Information Science Institute, State Key Laboratory of Integrated Service Networks, Xidian University, China. H. Ju was a visiting student at the University of Toronto supported by the China Scholarship Council ; Liang, Ben ; Li, Jiandong ; Yang, Xiaoniu

We present an algorithm to dynamically allocate transmission power to maximize the throughput-utility in an interference-limited network under an instantaneous sum power constraint with time-varying channels. We consider the equivalent problem of maximum admission with queue stability constraint through Lyapunov optimization. The resultant non-convex minimization problem is solved by an online algorithm consisting of two components: first, successive convex approximations to randomly choose a local minimum, and second, a modified pick-and-compare method for low-complexity convergence to a global minimum. We prove the optimality of this approach, derive its tradeoff between throughput-utility and delay, and demonstrate its performance advantage against existing methods.

Published in:

Wireless Communications Letters, IEEE  (Volume:2 ,  Issue: 1 )