Performance Analysis of SNR-Based Scheduling Policies in Asymmetric Broadcast Ergodic Fading Channel
<p>Abstract</p> <p>We analyze the performance of SNR-based scheduling algorithms in broadcast ergodic fading channels where multiuser selection diversity is exploited. At each channel state, the user with the highest weighted signal-to-noise ratio is selected to be transmitted. The...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
SpringerOpen
2009-01-01
|
Series: | EURASIP Journal on Wireless Communications and Networking |
Online Access: | http://jwcn.eurasipjournals.com/content/2009/163826 |
id |
doaj-7fb35d7af3f440718af7cafc3c8882a4 |
---|---|
record_format |
Article |
spelling |
doaj-7fb35d7af3f440718af7cafc3c8882a42020-11-24T23:04:37ZengSpringerOpenEURASIP Journal on Wireless Communications and Networking1687-14721687-14992009-01-0120091163826Performance Analysis of SNR-Based Scheduling Policies in Asymmetric Broadcast Ergodic Fading ChannelPérez JesúsIbáñez JesúsVía JavierSantamaría Ignacio<p>Abstract</p> <p>We analyze the performance of SNR-based scheduling algorithms in broadcast ergodic fading channels where multiuser selection diversity is exploited. At each channel state, the user with the highest weighted signal-to-noise ratio is selected to be transmitted. The use of weights associated to the users allows us to control the degree of fairness among users and to arrange them according to a prescribed quality of service. These weights parametrize the scheduling algorithms so each set of weights corresponds to a specific scheduling algorithm. Assuming Rayleigh fading broadcast channel, we derive a closed-form expression for the achievable user's rates as a function of the scheduling algorithm, the channel fading statistics of each user, and the transmit power. With the help of this expression, we solve some interesting inverse problems. For example, for a given arbitrary channel statistics we obtain the optimum scheduling algorithm to achieve a prescribed set of users' rates with minimum transmit power.</p>http://jwcn.eurasipjournals.com/content/2009/163826 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Pérez Jesús Ibáñez Jesús Vía Javier Santamaría Ignacio |
spellingShingle |
Pérez Jesús Ibáñez Jesús Vía Javier Santamaría Ignacio Performance Analysis of SNR-Based Scheduling Policies in Asymmetric Broadcast Ergodic Fading Channel EURASIP Journal on Wireless Communications and Networking |
author_facet |
Pérez Jesús Ibáñez Jesús Vía Javier Santamaría Ignacio |
author_sort |
Pérez Jesús |
title |
Performance Analysis of SNR-Based Scheduling Policies in Asymmetric Broadcast Ergodic Fading Channel |
title_short |
Performance Analysis of SNR-Based Scheduling Policies in Asymmetric Broadcast Ergodic Fading Channel |
title_full |
Performance Analysis of SNR-Based Scheduling Policies in Asymmetric Broadcast Ergodic Fading Channel |
title_fullStr |
Performance Analysis of SNR-Based Scheduling Policies in Asymmetric Broadcast Ergodic Fading Channel |
title_full_unstemmed |
Performance Analysis of SNR-Based Scheduling Policies in Asymmetric Broadcast Ergodic Fading Channel |
title_sort |
performance analysis of snr-based scheduling policies in asymmetric broadcast ergodic fading channel |
publisher |
SpringerOpen |
series |
EURASIP Journal on Wireless Communications and Networking |
issn |
1687-1472 1687-1499 |
publishDate |
2009-01-01 |
description |
<p>Abstract</p> <p>We analyze the performance of SNR-based scheduling algorithms in broadcast ergodic fading channels where multiuser selection diversity is exploited. At each channel state, the user with the highest weighted signal-to-noise ratio is selected to be transmitted. The use of weights associated to the users allows us to control the degree of fairness among users and to arrange them according to a prescribed quality of service. These weights parametrize the scheduling algorithms so each set of weights corresponds to a specific scheduling algorithm. Assuming Rayleigh fading broadcast channel, we derive a closed-form expression for the achievable user's rates as a function of the scheduling algorithm, the channel fading statistics of each user, and the transmit power. With the help of this expression, we solve some interesting inverse problems. For example, for a given arbitrary channel statistics we obtain the optimum scheduling algorithm to achieve a prescribed set of users' rates with minimum transmit power.</p> |
url |
http://jwcn.eurasipjournals.com/content/2009/163826 |
work_keys_str_mv |
AT p233rezjes250s performanceanalysisofsnrbasedschedulingpoliciesinasymmetricbroadcastergodicfadingchannel AT ib225241ezjes250s performanceanalysisofsnrbasedschedulingpoliciesinasymmetricbroadcastergodicfadingchannel AT v237ajavier performanceanalysisofsnrbasedschedulingpoliciesinasymmetricbroadcastergodicfadingchannel AT santamar237aignacio performanceanalysisofsnrbasedschedulingpoliciesinasymmetricbroadcastergodicfadingchannel |
_version_ |
1725629396484620288 |