Scheduling Weighted Packets With Deadlines Over a Fading Channel
Source: George Mason University
This paper considers 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 hard 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. This paper designs both offline and online algorithms to maximize weighted throughput, which is defined as the total value of the packets sent by their respective deadlines.