By Topic

Relay-aided opportunistic scheduling in wireless networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $33
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Y. S. Al-Harthi ; Electrical Engineering Department, King Fahd University of Petroleum and Minerals ; S. Al-Ghadhban

One of the most promising approaches to boost the communication efficiency in wireless systems is the use of multiuser diversity (MUDiv), where the fading of channels is exploited. The mechanism of scheduling the user with the best channel condition is called opportunistic scheduling (OS). In this paper, we propose a novel OS algorithm in wireless networks that reduces the feedback load with the aid of relaying. It is called relay-aided opportunistic scheduling (RAOS). We consider two schemes: non-greedy RAOS and greedy RAOS. In the non-greedy RAOS schemes, we consider two scenario: non-persistent and p-persistent, where the persisting occurs when no feedback is received via a relay. The RAOS algorithm requires users to feedback their signal-to-noise ratios (SNRs) either directly to the access point (AP) or via a relay. Furthermore, We analyse the RAOS algorithm under slow Rayleigh fading assumption and derive the closed-form expressions for the feedback load as well as the spectral efficiency. The result shows that the RAOS algorithm provides 55% feedback load reduction compared with other scheduling algorithms.

Published in:

IET Communications  (Volume:4 ,  Issue: 3 )