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

Non-orthogonal multiple access (NOMA) is one of the promising radio accesstechniques for next generation wireless networks. Opportunistic multi-userscheduling is necessary to fully exploit multiplexing gains in NOMA systems,but compared with traditional scheduling, interrelations between users'throughputs induced by multi-user interference poses new challenges in thedesign of NOMA schedulers. A successful NOMA scheduler has to carefully balancethe following three objectives: maximizing average system utility, satisfyingdesired fairness constraints among the users and enabling real-time, and lowcomputational cost implementations. In this paper, scheduling for NOMA systemsunder temporal fairness constraints is considered. Temporal fair schedulingleads to communication systems with predictable latency as opposed toutilitarian fair schedulers for which latency can be highly variable. It isshown that optimal system utility is achieved using a class of opportunisticscheduling schemes called threshold based strategies (TBS). One of thechallenges in temporal fair scheduling for heterogeneous NOMA scenarios - whereonly specific users may be activated simultaneously - is to determine the setof feasible temporal shares. In this work, a variable elimination algorithm isproposed to accomplish this task. Furthermore, an (online) iterative algorithmbased on the Robbins-Monro method is proposed to construct a TBS by finding theoptimal thresholds for a given system utility metric. Various numericalsimulations of practical scenarios are provided to illustrate the effectivenessof the proposed NOMA scheduling in static and mobile scenarios.

A General Framework for Temporal Fair User Scheduling in NOMA Systems