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

Energy-Efficient Transmission Scheduling With Strict Underflow Constraints

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)
Shuman, D.I. ; Inst. of Electr. Eng., Ecole Polytech. Fed. de Lausanne, Lausanne, Switzerland ; Mingyan Liu ; Wu, O.Q.

This paper considers a single source transmitting data to one or more receivers/users over a shared wireless channel. Due to random fading, the wireless channel conditions vary with time and from user to user. Each user has a buffer to store received packets before they are drained. At each time step, the source determines how much power to use for transmission to each user. The source's objective is to dynamically allocate power in a manner that minimizes total power consumption and packet holding costs, while satisfying strict buffer underflow constraints and a joint power constraint in each slot. The primary application motivating this problem is wireless media streaming. For this application, the buffer underflow constraints prevent the user buffers from emptying, so as to maintain playout quality. In the case of a single user, a state-dependent modified base-stock policy is shown to be optimal with linear power-rate curves, and a state-dependent finite generalized base-stock policy is shown to be optimal with piecewise-linear convex power-rate curves. When certain technical conditions are satisfied, efficient methods to compute the critical numbers that complete the characterizations of the optimal control laws in each of these cases are presented. The structure of the optimal policy for the case of two users is then analyzed.

Published in:

Information Theory, IEEE Transactions on  (Volume:57 ,  Issue: 3 )

Date of Publication:

March 2011

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.