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/

Zendy Pro

Presents the zaia usage as premium feature

ZAIA

Presents AI Discovery search usage as a premium feature

AI Discovery

Presents AI Discovery explain and summary usage as a premium feature

Content Analysis

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Presents the pdf analysis as premium feature

PDF Analysis

1500 Top-up

3000 Top-up

Zendy Basic

2500 Top-up

Zendy Unlimited

Presents the access of premium content as premium feature

Premium Content

The focus of this dissertation is on studying various packet scheduling and resource block (RB) allocation algorithms, for a variety of flow requirements, heterogeneous traffic, and architecture, in wireless OFDMA networks.In the second chapter, we investigate packet scheduling and RB allocation algorithms for realtime (RT) and non-realtime (NRT) packet-switched flows. We start by specifying different quality-of-service (QoS)-requirements for RT \& NRT flows and present different packet scheduling and RB allocation algorithms (including known cores and novel cores) based on the bit-rate driven utilities and the delay driven disutilities. We, then, summarize the machinery for attaining different fairness and QoS-requirements in a pair of classification tables (including a novel intuitive decomposition).When considering RT and NRT flows together, the commonly-used approach is the one based on performing two sequential algorithms of RT and NRT flows. This approach cannot exploit the potent existent multiuser diversity, in wireless OFDMA networks. In the third chapter, we propose a novel unified disutility minimization, in a common pool of RBs. Since the packet scheduling and RB allocation algorithms have taken place for RT and NRT flows from a common pool of RBs (without static priority separation), the overall spectral efficiency is increased. The novel formulations are used to devise computationally-efficient packet scheduling and RB allocation algorithm that surpass baseline algorithms. We also develop a novel general model for input-output bit-rate behaviour in packet scheduling and RB allocation of the heterogeneous traffic. This model sheds light on identifying different input load regions and understanding of the system in a simple intuitive manner.When it comes to providing very high bit-rate coverage, wireless networks require cost-effective radio access network (RAN) devices, such as multiuser enabled amplify-and-forward (AF) relays, with proper fair packet scheduling and RB allocation algorithms. These relays are cost-effective, simpler to implement, and introduce less delay in comparison to other relay based routers. In the fourth chapter, we develop novel fair packet scheduling and RB allocation algorithms in this kind of OFDMA based AF relays.Finally, we discuss a number of interesting research topics, as future directions, in the last chapter.

Utility-Based Packet Scheduling and Resource Allocation Algorithms with Heterogeneous Traffic for Wireless OFDMA Networks