Relay selection in multi-user amplify-forward wireless relay networks

Che, E; Tuan, HD; Nguyen, HH

Relay selection in multi-user amplify-forward wireless relay networks

Che, E Tuan, HD

Nguyen, HH

Permalink

Publication Type:: Conference Proceeding
Citation:: ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings, 2012, pp. 2485 - 2488
Issue Date:: 2012-10-23

Closed Access

	Filename	Description	Size
	2012004170OK.pdf		296.89 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	Che, E	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-10-23	en_US
dc.identifier.citation	ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings, 2012, pp. 2485 - 2488	en_US
dc.identifier.isbn	9781467300469	en_US
dc.identifier.issn	1520-6149	en_US
dc.identifier.uri	http://hdl.handle.net/10453/23102
dc.description.abstract	For multi-user (MU) amplify-and-forward (AF) cooperative networks, their spectral efficiency can be upgraded within the orthogonal transmission of each source node to an assigned subset of all available relays while their information throughput can be improved through optimized power allocation. We consider the joint optimization in both relay assignment for each source-destination pair and power allocation, which is in fact among the hardest problems in optimization. This is the minimization of a nonconvex objective function subject to mixed integer constraints. The existing numerical algorithms could rarely address to its solutions through computationally affordable procedures. Even the conventional relaxation of the integer constraints by linear constraints does not lead to convex optimization, so the standard convexification does not work either. Nevertheless, we show that it can be effectively solved in the d.c. (difference of two convex) programming context. Numerical simulation confirms the effectiveness of our setting. © 2012 IEEE.	en_US
dc.relation.ispartof	ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings	en_US
dc.relation.isbasedon	10.1109/ICASSP.2012.6288420	en_US
dc.title	Relay selection in multi-user amplify-forward wireless relay networks	en_US
dc.type	Conference Proceeding
utslib.for	0906 Electrical and Electronic Engineering	en_US
dc.location.activity	Kyoto, Japan	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:

For multi-user (MU) amplify-and-forward (AF) cooperative networks, their spectral efficiency can be upgraded within the orthogonal transmission of each source node to an assigned subset of all available relays while their information throughput can be improved through optimized power allocation. We consider the joint optimization in both relay assignment for each source-destination pair and power allocation, which is in fact among the hardest problems in optimization. This is the minimization of a nonconvex objective function subject to mixed integer constraints. The existing numerical algorithms could rarely address to its solutions through computationally affordable procedures. Even the conventional relaxation of the integer constraints by linear constraints does not lead to convex optimization, so the standard convexification does not work either. Nevertheless, we show that it can be effectively solved in the d.c. (difference of two convex) programming context. Numerical simulation confirms the effectiveness of our setting. © 2012 IEEE.

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

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