DocumentCode :
3078587
Title :
Fast Local D.C. Programming for Optimal Power Allocation in Wireless Networks
Author :
Kha, H.H. ; Tuan, H.D. ; Nguyen, Ha H.
Author_Institution :
Sch. of Electr. Eng. & Telecommun., Univ. of New South Wales, Sydney, NSW, Australia
fYear :
2011
fDate :
5-9 Dec. 2011
Firstpage :
1
Lastpage :
5
Abstract :
Power allocations in an interference-limited wireless network for global maximization of the weighted sum throughput or global maximization of the minimum rate among network links are not only important but also very hard optimization problems due to their nonconvexity nature. Recently developed methods are either unable to locate the global optimal solutions or prohibitively complex for practical applications. This paper exploits the d.c. (difference of two convex functions/sets) structure of either the objective function or constraint of the these global optimization problems to develop efficient iterative algorithms with very low complexity. Numerical results demonstrate that the developed algorithms are able to locate the global optimal solutions by only a few iterations and they are superior to the previously-proposed methods in both performance and computation complexity.
Keywords :
computational complexity; iterative methods; optimisation; radio networks; radiofrequency interference; computation complexity; fast local DC programming; global maximization; global optimization problems; interference-limited wireless network; iterative algorithms; optimal power allocation; weighted sum throughput; Convergence; Optimization; Programming; Resource management; Throughput; Vectors; Wireless networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Global Telecommunications Conference (GLOBECOM 2011), 2011 IEEE
Conference_Location :
Houston, TX, USA
ISSN :
1930-529X
Print_ISBN :
978-1-4244-9266-4
Electronic_ISBN :
1930-529X
Type :
conf
DOI :
10.1109/GLOCOM.2011.6134078
Filename :
6134078
Link To Document :
بازگشت