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 Plus annual

Presents the access of premium content as premium feature

Premium Content

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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We consider the joint scheduling-and-power-allocation problem of a downlinkcellular system. The system consists of two groups of users: real-time (RT) andnon-real-time (NRT) users. Given some average power constraint on the basestation, the problem is to find an algorithm that satisfies the RT and NRTquality-of-service (QoS) constraints. The RT QoS constraints guarantee theportion of RT packets that miss their deadline are no more than a pre-specifiedthreshold. On the other hand, the NRT QoS is only to guarantee the stability oftheir queues. We propose a sum-rate-maximizing algorithm that satisfy all QoSand average power constraints. The proposed power allocation policy has aclosed-form expression for the two groups of users. However, the power policyof the RT users differ in structure from the NRT users. The proposed algorithmis optimal for the on-off channel model with a polynomial-time schedulingcomplexity. Using extensive simulations, the throughput of the proposedalgorithm is shown exceed existing approaches.

Power Control and Scheduling under Hard Deadline Constraints for On-Off Fading Channels