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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.