English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

A point-to-point discrete-time scheduling problem of transmitting $B$information bits within $T$ hard delay deadline slots is considered assumingthat the underlying energy-bit cost function is a convex monomial. Thescheduling objective is to minimize the expected energy expenditure whilesatisfying the deadline constraint based on information about the unservedbits, channel state/statistics, and the remaining time slots to the deadline.At each time slot, the scheduling decision is made without knowledge of futurechannel state, and thus there is a tension between serving many bits when thecurrent channel is good versus leaving too many bits for the deadline. Underthe assumption that no other packet is scheduled concurrently and no outage isallowed, we derive the optimal scheduling policy. Furthermore, we alsoinvestigate the dual problem of maximizing the number of transmitted bits over$T$ time slots when subject to an energy constraint.

Delay Constrained Scheduling over Fading Channels: Optimal Policies for Monomial Energy-Cost Functions