Cart (Loading....) | Create Account
Close category search window
 

Optimal Cross-Layer Scheduling of Transmissions Over a Fading Multiaccess Channel

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)
Goyal, M. ; IBM India Res. Lab., Bangalore ; Kumar, A. ; Sharma, V.

We consider the problem of several users transmitting packets to a base station, and study an optimal scheduling formulation involving three communication layers, namely, the medium access control, link, and physical layers. We assume Markov models for the packet arrival processes and the channel gain processes. Perfect channel state information is assumed to be available at the transmitter and the receiver. The transmissions are subject to a long-run average transmitter power constraint. The control problem is to assign power and rate dynamically as a function of the fading and the queue lengths so as to minimize a weighted sum of long run average packet transmission delays.

Published in:

Information Theory, IEEE Transactions on  (Volume:54 ,  Issue: 8 )

Date of Publication:

Aug. 2008

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 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.