Fast global optimal power allocation in wireless networks by local D.C. programming

Kha, HH; Tuan, HD; Nguyen, HH

Fast global optimal power allocation in wireless networks by local D.C. programming

Kha, HH Tuan, HD

Nguyen, HH

Permalink

Publication Type:: Journal Article
Citation:: IEEE Transactions on Wireless Communications, 2012, 11 (2), pp. 510 - 515
Issue Date:: 2012-02-01

Closed Access

	Filename	Description	Size
	2011005447OK.pdf	Published Version	269.43 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Kha, HH	en_US
dc.contributor.author	Tuan, HD https://orcid.org/0000-0003-0292-6061	en_US
dc.contributor.author	Nguyen, HH	en_US
dc.date.issued	2012-02-01	en_US
dc.identifier.citation	IEEE Transactions on Wireless Communications, 2012, 11 (2), pp. 510 - 515	en_US
dc.identifier.issn	1536-1276	en_US
dc.identifier.uri	http://hdl.handle.net/10453/31204
dc.description.abstract	Power allocations in an interference-limited wireless network for global maximization of the weighted sum throughput or global optimization of the minimum weighted 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 constraints of 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. © 2012 IEEE.	en_US
dc.relation.ispartof	IEEE Transactions on Wireless Communications	en_US
dc.relation.isbasedon	10.1109/TWC.2011.120911.110139	en_US
dc.subject.classification	Networking & Telecommunications	en_US
dc.title	Fast global optimal power allocation in wireless networks by local D.C. programming	en_US
dc.type	Journal Article
utslib.citation.volume	2	en_US
utslib.citation.volume	11	en_US
utslib.for	0903 Biomedical Engineering	en_US
utslib.for	0906 Electrical and Electronic Engineering	en_US
utslib.for	0805 Distributed Computing	en_US
utslib.for	1005 Communications Technologies	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
utslib.copyright.status	closed_access
pubs.issue	2	en_US
pubs.publication-status	Published	en_US
pubs.volume	11	en_US

Abstract:

Power allocations in an interference-limited wireless network for global maximization of the weighted sum throughput or global optimization of the minimum weighted 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 constraints of 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. © 2012 IEEE.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/31204