Relay assignment for max-min capacity in cooperative wireless networks

Pham, TT; Nguyen, HH; Tuan, HD

Relay assignment for max-min capacity in cooperative wireless networks

Pham, TT Nguyen, HH Tuan, HD

Permalink

Publication Type:: Journal Article
Citation:: IEEE Transactions on Vehicular Technology, 2012, 61 (5), pp. 2387 - 2394
Issue Date:: 2012-06-26

Closed Access

	Filename	Description	Size
	2011005466OK.pdf		724.77 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	Pham, TT	en_US
dc.contributor.author	Nguyen, HH	en_US
dc.contributor.author	Tuan, HD https://orcid.org/0000-0003-0292-6061	en_US
dc.date.issued	2012-06-26	en_US
dc.identifier.citation	IEEE Transactions on Vehicular Technology, 2012, 61 (5), pp. 2387 - 2394	en_US
dc.identifier.issn	0018-9545	en_US
dc.identifier.uri	http://hdl.handle.net/10453/22331
dc.description.abstract	This paper is concerned with the problem of relay assignment in cooperative wireless networks having multiple sources, multiple relays, and a single destination. With the objective of maximizing the minimum capacity among all sources in the network, a mixed-integer linear programming (MILP) problem is formulated, which can be solved by standard branch-and-bound algorithms. To reduce computational complexity, a greedy solution in the form of a lexicographic bottleneck assignment algorithm is proposed. Simulation results obtained for the IEEE 802.16j uplink scenarios show that the greedy algorithm performs very close to the optimal solution but at a much lower computational cost. The proposed greedy solution can also be tailored to provide further improvements on other network performance criteria. © 2012 IEEE.	en_US
dc.relation.ispartof	IEEE Transactions on Vehicular Technology	en_US
dc.relation.isbasedon	10.1109/TVT.2012.2192508	en_US
dc.subject.classification	Automobile Design & Engineering	en_US
dc.title	Relay assignment for max-min capacity in cooperative wireless networks	en_US
dc.type	Journal Article
utslib.citation.volume	5	en_US
utslib.citation.volume	61	en_US
utslib.for	0902 Automotive Engineering	en_US
utslib.for	08 Information and Computing Sciences	en_US
utslib.for	09 Engineering	en_US
utslib.for	10 Technology	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	5	en_US
pubs.publication-status	Published	en_US
pubs.volume	61	en_US

Abstract:

This paper is concerned with the problem of relay assignment in cooperative wireless networks having multiple sources, multiple relays, and a single destination. With the objective of maximizing the minimum capacity among all sources in the network, a mixed-integer linear programming (MILP) problem is formulated, which can be solved by standard branch-and-bound algorithms. To reduce computational complexity, a greedy solution in the form of a lexicographic bottleneck assignment algorithm is proposed. Simulation results obtained for the IEEE 802.16j uplink scenarios show that the greedy algorithm performs very close to the optimal solution but at a much lower computational cost. The proposed greedy solution can also be tailored to provide further improvements on other network performance criteria. © 2012 IEEE.

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

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