5G networks appear on the horizon with distinguished Quality of Service (QoS) requirements such as aggregated data rate and latency. Managing such networks in either a distributed or centralized manner to best utilize the available scarce resources is still a big challenge. Better mechanisms are needed for resource allocation. In this dissertation, we discuss three distinct research problems related to this theme.
The first part addresses enhancing the solvability of network optimization problems. For the class of problems studied, we show that a traditionally-formulated model is insufficient from a problem-solving perspective. When the size of the problem increases, even state-of-the-art optimizers cannot obtain an optimal solution because of memory constraints. We show that augmenting the model with suitable additional constraints and structure enables the optimizer to derive optimal solutions, or significantly reduce the optimality gap.
The second problem is optimal channel bonding in wireless LANs under demand uncertainty. An access point (AP) can aggregate multiple contiguous channels to satisfy demand. We discuss how to optimally utilize available frequency bands under uncertainty in AP demand using two stochastic optimization frameworks: a static scheme which minimizes the total occupied bandwidth while satisfying the demand of each AP with probability at least β and an adaptive scheme that allows adaptability of the bandwidth allocation in response to the AP demand variations. Given its complexity, we propose a novel framework to solve the adaptive stochastic optimization problem efficiently.
The third problem is to allocate resources with receiver characteristic awareness in a multiple radio access technology environment. We propose a novel adjacent channel interference (ACI)-aware joint channel and power allocation framework that takes into account receiver imperfections arising due to (i) imperfect image frequency rejection and (ii) analog-to-digital converter aliasing. As the overall problem is in the form of Mixed-Integer-Linear-Programming (MILP) which is NP-hard, we develop an efficient algorithm to solve it. / Ph. D.
| Identifer | oai:union.ndltd.org:VTETD/oai:vtechworks.lib.vt.edu:10919/81700 |
| Date | 10 January 2018 |
| Creators | Abdelfattah, Amr Nabil A. |
| Contributors | Electrical and Computer Engineering, MacKenzie, Allen B., Riad, Sedki Mohamed, El-Nainay, Mustafa Yousry, Midkiff, Scott F., Rakha, Hesham A. |
| Publisher | Virginia Tech |
| Source Sets | Virginia Tech Theses and Dissertation |
| Detected Language | English |
| Type | Dissertation |
| Format | ETD, application/pdf, application/pdf |
| Rights | In Copyright, http://rightsstatements.org/vocab/InC/1.0/ |
Page generated in 0.0092 seconds