Close category search window
 

An Opportunist Extension of Wireless Fair Service for Packet Scheduling in OFDMA

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
$31 $13
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

3 Author(s)
Lengoumbi, C. ; Telecom Paris - GET ; Martins, P. ; Godlewski, P.

In this paper, we investigate packet scheduling and radio resource allocation in orthogonal frequency division multiple access (OFDMA) wireless networks. Each subchannel is a Rayleigh fading channel modeled by a finite state Markov channel (FSMC). The wireless fair service (WFS) packet scheduler is modified for a multi carrier and multi rate context. The proposed algorithm, named opportunist wireless fair service (OWFS), copes with both real time (RT) and non real time (NRT) traffic constraints. For both traffic classes, specific criteria of performance are compared with PLFS, a scheduler recently proposed for OFDMA.

Published in:
Vehicular Technology Conference, 2007. VTC2007-Spring. IEEE 65th

Date of Conference: 22-25 April 2007

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.