Power efficient scheduling in multihop networks

Dinesh Rajan

doi:10.1117/12.611875

23 May 2005 Power efficient scheduling in multihop networks (Invited Paper)

Dinesh Rajan

Proceedings Volume 5847, Noise in Communication Systems; (2005) https://doi.org/10.1117/12.611875
Event: SPIE Third International Symposium on Fluctuations and Noise, 2005, Austin, Texas, United States

Abstract

In this paper, we present schedulers that minimize the total transmit power in a multihop wireless network. The focus is on guaranteeing an end-to-end delay bound for a single variable bit rate flow on a multihop fading channel. We first compute an analytical approximation for the transmit power required to send a variable bit rate source over a finite state fading channel. We then use this approximation to derive schedulers that have low complexity and near optimal performance over multihop networks where the fading processes on the multiple hops are independent. Properties of the optimal delay allocation are also studied; in the special case of a Gaussian network, the optimal delay allocation strategy is completely characterized.

Citation Download Citation

Dinesh Rajan "Power efficient scheduling in multihop networks (Invited Paper)", Proc. SPIE 5847, Noise in Communication Systems, (23 May 2005); https://doi.org/10.1117/12.611875

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available