By Topic

Energy-Efficient Random-Access Scheduler for Delay-Limited Traffic 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
$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)
Lee, Wooyul ; Stanford Univ., Stanford ; Chan-Soo Hwang ; Cioffi, J.M.

This paper considers energy minimization for a fast-fading random-access network, where each user sends a single fixed-length packet by selecting a single time-slot within a strict delay-limit. The proposed algorithms assume that each user causally knows its channel state information from electromagnetic reciprocity. With the channel distribution known to all users, the proposed dynamic-programming solution provides an optimal scheduler that minimizes the sum of energy used to transmit a packet and outage cost incurred by a packet drop. Without the knowledge of the channel distribution, a heuristic scheduler is additionally proposed, which learns channel statistics by observing initial time slots.

Published in:

Global Telecommunications Conference, 2007. GLOBECOM '07. IEEE

Date of Conference:

26-30 Nov. 2007