Joint opportunistic scheduling and network coding for bidirectional relay channel

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

Joint opportunistic scheduling and network coding for bidirectional relay channel

Shaqfeh, M Zafar, A

Alnuweiri, H Alouini, MS

Permalink

Publication Type:: Conference Proceeding
Citation:: IEEE International Symposium on Information Theory - Proceedings, 2013, pp. 1327 - 1331
Issue Date:: 2013-12-19

Closed Access

	Filename	Description	Size
	06620442.pdf	Published version	148.62 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	Shaqfeh, M	en_US
dc.contributor.author	Zafar, A https://orcid.org/0000-0001-8382-7625	en_US
dc.contributor.author	Alnuweiri, H	en_US
dc.contributor.author	Alouini, MS	en_US
dc.date.issued	2013-12-19	en_US
dc.identifier.citation	IEEE International Symposium on Information Theory - Proceedings, 2013, pp. 1327 - 1331	en_US
dc.identifier.isbn	9781479904464	en_US
dc.identifier.issn	2157-8095	en_US
dc.identifier.uri	http://hdl.handle.net/10453/121072
dc.description.abstract	In this paper, we consider a two-way communication system in which two users communicate with each other through an intermediate relay over block-fading channels. We investigate the optimal opportunistic scheduling scheme in order to maximize the long-term average transmission rate in the system assuming symmetric information flow between the two users. Based on the channel state information, the scheduler decides that either one of the users transmits to the relay, or the relay transmits to a single user or broadcasts to both users a combined version of the two users' transmitted information by using linear network coding. We obtain the optimal scheduling scheme by using the Lagrangian dual problem. Furthermore, in order to characterize the gains of network coding and opportunistic scheduling, we compare the achievable rate of the system versus suboptimal schemes in which the gains of network coding and opportunistic scheduling are partially exploited. © 2013 IEEE.	en_US
dc.relation.ispartof	IEEE International Symposium on Information Theory - Proceedings	en_US
dc.relation.isbasedon	10.1109/ISIT.2013.6620442	en_US
dc.rights	info:eu-repo/semantics/closedAccess
dc.title	Joint opportunistic scheduling and network coding for bidirectional relay channel	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 consider a two-way communication system in which two users communicate with each other through an intermediate relay over block-fading channels. We investigate the optimal opportunistic scheduling scheme in order to maximize the long-term average transmission rate in the system assuming symmetric information flow between the two users. Based on the channel state information, the scheduler decides that either one of the users transmits to the relay, or the relay transmits to a single user or broadcasts to both users a combined version of the two users' transmitted information by using linear network coding. We obtain the optimal scheduling scheme by using the Lagrangian dual problem. Furthermore, in order to characterize the gains of network coding and opportunistic scheduling, we compare the achievable rate of the system versus suboptimal schemes in which the gains of network coding and opportunistic scheduling are partially exploited. © 2013 IEEE.

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

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