Online maximizing weighted throughput in a fading channel
Fei Li
Zhi Zhang
Dept. of Comput. Sci., George Mason Univ., Fairfax, VA, USA;
This paper appears in: Information Theory, 2009. ISIT 2009. IEEE International Symposium on
Publication Date: June 28 2009-July 3 2009
On page(s): 591-595
Location: Seoul,
ISBN: 978-1-4244-4312-3
INSPEC Accession Number: 10842042
Digital Object Identifier: 10.1109/ISIT.2009.5205693
Current Version Published: 2009-08-18
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.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
