Scheduling for dual-hop block-fading channels with two source-user pairs sharing one relay

Zafar, A; Shaqfeh, M; Alouini, MS; Alnuweiri, H

Scheduling for dual-hop block-fading channels with two source-user pairs sharing one relay

Zafar, A

Shaqfeh, M Alouini, MS Alnuweiri, H

Permalink

Publication Type:: Conference Proceeding
Citation:: IEEE Vehicular Technology Conference, 2013
Issue Date:: 2013-12-01

Closed Access

	Filename	Description	Size
	06692401.pdf	Published version	240.28 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	Zafar, A https://orcid.org/0000-0001-8382-7625	en_US
dc.contributor.author	Shaqfeh, M	en_US
dc.contributor.author	Alouini, MS	en_US
dc.contributor.author	Alnuweiri, H	en_US
dc.date.issued	2013-12-01	en_US
dc.identifier.citation	IEEE Vehicular Technology Conference, 2013	en_US
dc.identifier.isbn	9781467361873	en_US
dc.identifier.issn	1550-2252	en_US
dc.identifier.uri	http://hdl.handle.net/10453/120964
dc.description.abstract	In this paper, we maximize the achievable rate region of a dual-hop network with two sources serving two users independently through a single shared relay. We formulate the problem as maximizing the sum of the weighted long term average throughputs of the two users under stability constraints on the long term throughputs of the source-user pairs. In order to solve the problem, we propose a joint user-and-hop scheduling scheme, which schedules the first or second hop opportunistically based on instantaneous channel state information, in order to exploit multiuser diversity and multihop diversity gains. Numerical results show that the proposed joint scheduling scheme enhances the achievable rate region as compared to a scheme that employs multi-user scheduling on the second-hop alone. Copyright © 2013 by the Institute of Electrical and Electronic Engineers, Inc.	en_US
dc.relation.ispartof	IEEE Vehicular Technology Conference	en_US
dc.relation.isbasedon	10.1109/VTCFall.2013.6692401	en_US
dc.rights	info:eu-repo/semantics/closedAccess
dc.title	Scheduling for dual-hop block-fading channels with two source-user pairs sharing one relay	en_US
dc.type	Conference Proceeding
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
pubs.organisational-group	/University of Technology Sydney/Strength - CRIN - Realtime Information Networks
utslib.copyright.status	closed_access	*
pubs.publication-status	Published	en_US

Abstract:

In this paper, we maximize the achievable rate region of a dual-hop network with two sources serving two users independently through a single shared relay. We formulate the problem as maximizing the sum of the weighted long term average throughputs of the two users under stability constraints on the long term throughputs of the source-user pairs. In order to solve the problem, we propose a joint user-and-hop scheduling scheme, which schedules the first or second hop opportunistically based on instantaneous channel state information, in order to exploit multiuser diversity and multihop diversity gains. Numerical results show that the proposed joint scheduling scheme enhances the achievable rate region as compared to a scheme that employs multi-user scheduling on the second-hop alone. Copyright © 2013 by the Institute of Electrical and Electronic Engineers, Inc.

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

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