Online Maximizing Weighted Throughput In A Fading Channel

TL;DR

This paper develops online algorithms for scheduling weighted packets with deadlines over a fading channel, aiming to maximize total packet value, and provides competitive ratio guarantees for these algorithms.

Contribution

It introduces two new online algorithms with competitive ratios of 2.618 and 2 for maximizing weighted throughput in fading channels.

Findings

Achieved competitive ratio of 2 for one algorithm.

Achieved competitive ratio of 2.618 for another algorithm.

Demonstrated effectiveness of online algorithms in dynamic fading environments.

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.