Online maximizing weighted throughput in a fading channel

Author

Li, Fei ; Zhang, Zhi

Author_Institution

Dept. of Comput. Sci., George Mason Univ., Fairfax, VA, USA

fYear

2009

fDate

June 28 2009-July 3 2009

Firstpage

591

Lastpage

595

Abstract

We consider online scheduling weighted packets with time constraints over a fading channel. Packets arrive at the transmitter in an online manner. Each packet has a value and a deadline by which it should be sent. The fade state of the channel determines the throughput obtained per unit of time and the channel´s quality may change over time. In this paper, we design online algorithms to maximize weighted throughput, defined as the total value of the packets sent by their respective deadlines. Competitive ratio is employed to measure an online algorithm´s performance. For this problem and one of its variants, we present two online algorithms with competitive ratios 2:618 and 2 respectively.

Keywords

fading channels; radio transmitters; scheduling; channel quality; fading channel; online scheduling; radio transmitter; time constraints; weighted packets; Algorithm design and analysis; Computer science; Fading; Information theory; Processor scheduling; Resource management; Scheduling algorithm; Throughput; Time factors; Transmitters;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory, 2009. ISIT 2009. IEEE International Symposium on

Conference_Location

Seoul

Print_ISBN

978-1-4244-4312-3

Electronic_ISBN

978-1-4244-4313-0

Type

conf

DOI

10.1109/ISIT.2009.5205693

Filename

5205693