Abstract
In this paper, we propose power efficient schedulers for transmitting bursty traffic sources over Gaussian wireless channels that provide guarantees on absolute delays experienced by the source packets. The proposed schedulers find the transmission rate and power using temporal water-filling techniques without any knowledge of the arrival traffic statistics. We also introduce an iterative process to compute a lower bound on the transmit power of any scheduler that provides absolute delay guarantees. The proposed schedulers and iterative method of computing the lower bound are also shown to provide statistical guarantees on packet delays.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
