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

Kha, HH; Tuan, HD; Nguyen, HH

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

Kha, HH Tuan, HD

Nguyen, HH

Permalink

Publication Type:: Conference Proceeding
Citation:: GLOBECOM - IEEE Global Telecommunications Conference, 2011
Issue Date:: 2011-12-01

Closed Access

	Filename	Description	Size
	06134078.pdf	Published version	172.23 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	2011-12-01	en_US
dc.identifier.citation	GLOBECOM - IEEE Global Telecommunications Conference, 2011	en_US
dc.identifier.isbn	9781424492688	en_US
dc.identifier.uri	http://hdl.handle.net/10453/120231
dc.description.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. © 2011 IEEE.	en_US
dc.relation.ispartof	GLOBECOM - IEEE Global Telecommunications Conference	en_US
dc.relation.isbasedon	10.1109/GLOCOM.2011.6134078	en_US
dc.rights	info:eu-repo/semantics/closedAccess
dc.title	Fast local D.C. programming for optimal power allocation in wireless networks	en_US
dc.type	Conference Proceeding
utslib.for	0906 Electrical and Electronic Engineering	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.publication-status	Published	en_US

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. © 2011 IEEE.

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

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