Online Maximizing Weighted Throughput In A Fading Channel

Details Online Maximizing Weighted Throughput In A Fading Channel Online Maximizing Weighted Throughput In A Fading Channel

2009-04-29

arxiv.org/abs/0904.4530v1

Computer Science

Information Theory

9 pages, appears in ISIT 2009

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Online Maximizing Weighted Throughput In A Fading Channel does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Online Maximizing Weighted Throughput In A Fading Channel, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Online Maximizing Weighted Throughput In A Fading Channel will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-511159