Joint delay-aware opportunistic scheduling algorithm with reduced feedback to exploit multiuser diversity

Sandrasegaran, K; Patachaianand, R; Madani, FM

Joint delay-aware opportunistic scheduling algorithm with reduced feedback to exploit multiuser diversity

Sandrasegaran, K

Patachaianand, R Madani, FM

Permalink

Publication Type:: Conference Proceeding
Citation:: ICCAIE 2010 - 2010 International Conference on Computer Applications and Industrial Electronics, 2010, pp. 432 - 437
Issue Date:: 2010-12-01

Closed Access

	Filename	Description	Size
	2010001160OK.pdf		622.45 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	Sandrasegaran, K https://orcid.org/0000-0003-1270-5756	en_US
dc.contributor.author	Patachaianand, R	en_US
dc.contributor.author	Madani, FM	en_US
dc.date.issued	2010-12-01	en_US
dc.identifier.citation	ICCAIE 2010 - 2010 International Conference on Computer Applications and Industrial Electronics, 2010, pp. 432 - 437	en_US
dc.identifier.isbn	9781424490554	en_US
dc.identifier.uri	http://hdl.handle.net/10453/16122
dc.description.abstract	The paper deals with a modified version of opportunistic scheduling algorithm that exploits multiuser diversity. It incorporates the proportional fairness scheduling policy with the first-in-first-out (FIFO) policy to obtain a hybrid policy that works well when the channel state information of each mobile user is not necessarily known. In the paper, it is proposed that the channel state information of a mobile user be transmitted to the base station only when its quality is above some threshold value; thus minimising the feedback load. It differs from previous papers in that the algorithm resorts to FIFO policy in case of feedback outages. Yet the numerical results suggest that the system capacity is depreciated only by little as compared to the proportional fairness scheme, while there is a considerable improvement in the performance delay. The additional complexity of implementation is negligible. © 2010 IEEE.	en_US
dc.relation.ispartof	ICCAIE 2010 - 2010 International Conference on Computer Applications and Industrial Electronics	en_US
dc.relation.isbasedon	10.1109/ICCAIE.2010.5735118	en_US
dc.title	Joint delay-aware opportunistic scheduling algorithm with reduced feedback to exploit multiuser diversity	en_US
dc.type	Conference Proceeding
utslib.for	080201 Analysis of Algorithms and Complexity	en_US
dc.location.activity	Kuala Lumpur, Malaysia	en_US
dc.location.activity	Nice, France
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:

The paper deals with a modified version of opportunistic scheduling algorithm that exploits multiuser diversity. It incorporates the proportional fairness scheduling policy with the first-in-first-out (FIFO) policy to obtain a hybrid policy that works well when the channel state information of each mobile user is not necessarily known. In the paper, it is proposed that the channel state information of a mobile user be transmitted to the base station only when its quality is above some threshold value; thus minimising the feedback load. It differs from previous papers in that the algorithm resorts to FIFO policy in case of feedback outages. Yet the numerical results suggest that the system capacity is depreciated only by little as compared to the proportional fairness scheme, while there is a considerable improvement in the performance delay. The additional complexity of implementation is negligible. © 2010 IEEE.

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

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