22 research outputs found
Resource Allocation in OFDMA Wireless Networks
Orthogonal frequency division multiple access (OFDMA) is becoming a widely deployed mechanism in broadband wireless networks due to its capability to combat the channel impairments and support high data rate. Besides, dealing with small units of spectrum, named sub-carriers, instead of whole spectrum, results in enhanced flexibility and efficiency of the resource allocation for OFDMA networks.
Resource allocation and scheduling in the downlink of OFDMA networks supporting heterogeneous traffic will be considered in this thesis. The purpose of resource allocation is to allocate sub-carriers and power to users to meet their service requirements while maintaining fairness among users and maximizes resource utilization. To achieve these objectives, utility-based resource allocation schemes along with some state-of-the-art resource allocation paradigms such as power control, adaptive modulation and coding, sub-carrier assignment, and scheduling are adopted. On one hand, a utility-based resource allocation scheme improves resource utilization by allocating enough resources based on users' quality of service (QoS) satisfaction. On the other hand, resource allocation based on utilities is not trivial when users demand different traffic types with convex and nonconvex utilities.
The first contribution of the thesis is the proposing of a framework, based on joint physical (PHY) and medium access (MAC) layer optimization, for utility-based resource allocation in OFDMA networks with heterogeneous traffic types. The framework considers the network resources limitations while attempting to improve resources utilization and heterogeneous users' satisfaction of service. The resource allocation problem is formulated by continuous optimization techniques, and an algorithm based on interior point and penalty methods is suggested to solve the problem. The numerical results show that the framework is very efficient in treating the nonconvexity problem and the allocation is accurate comparing with the ones obtained by a genetic search algorithm.
The second contribution of the thesis is the proposing of an opportunistic fair scheduling scheme for OFDMA networks. The contribution is twofold. First, a vector of fair weights is proposed, which can be used in any scheduling scheme for OFDMA networks to maintain fairness. Second, the fair weights are deployed in an opportunistic scheduling scheme to compensate the unfairness of the scheduling. The proposed scheme efficiently schedules users by exploiting multiuser diversity gain, OFDMA resource allocation flexibility, and utility fair service discipline.
It is expected that the research in the thesis contributes to developing practical schemes with low complexity for the MAC layer of OFDMA networks
A cross-layer scheduling strategy for the downlink of a MIMO-OFDMA system with heterogeneous traffic
in this paper we propose and investigate a cross-layer
multiuser scheduling strategy for the support of heterogeneous traffic in
the downlink of a MIMO-OFDMA system. It jointly considers different
objectives: maximize the sum-rate on the radio channel, ensure a fair
allocation of resources among users belonging to the same traffic class,
consider the dynamics of traffic sources by looking at the delay of
data packets in the queues, contribute to maximize quality of service
figures at the application level. To exploit temporal diversity and to
reduce complexity, the ergodic weighted sum-rate is maximized and dual
optimization with stochastic approximation is applied to derive on-line
algorithms. The numerical results show the capability of the scheduler
to allocate physical layer resources according to rate constraints imposed
for each different traffic class and with fairness inside each class, even
in presence of different channels conditions and different network loads.Postprint (published version
Studies on efficient spectrum sharing in coexisting wireless networks.
Wireless communication is facing serious challenges worldwide: the severe spectrum shortage along with the explosive increase of the wireless communication demands. Moreover, different communication networks may coexist in the same geographical area. By allowing multiple communication networks cooperatively or opportunistically sharing the same frequency will potentially enhance the spectrum efficiency. This dissertation aims to investigate important spectrum sharing schemes for coexisting networks. For coexisting networks operating in interweave cognitive radio mode, most existing works focus on the secondary network’s spectrum sensing and accessing schemes. However, the primary network can be selfish and tends to use up all the frequency resource. In this dissertation, a novel optimization scheme is proposed to let primary network maximally release unnecessary frequency resource for secondary networks. The optimization problems are formulated for both uplink and downlink orthogonal frequency-division multiple access (OFDMA)-based primary networks, and near optimal algorithms are proposed as well. For coexisting networks in the underlay cognitive radio mode, this work focuses on the resource allocation in distributed secondary networks as long as the primary network’s rate constraint can be met. Global optimal multicarrier discrete distributed (MCDD) algorithm and suboptimal Gibbs sampler based Lagrangian algorithm (GSLA) are proposed to solve the problem distributively. Regarding to the dirty paper coding (DPC)-based system where multiple networks share the common transmitter, this dissertation focuses on its fundamental performance analysis from information theoretic point of view. Time division multiple access (TDMA) as an orthogonal frequency sharing scheme is also investigated for comparison purpose. Specifically, the delay sensitive quality of service (QoS) requirements are incorporated by considering effective capacity in fast fading and outage capacity in slow fading. The performance metrics in low signal to noise ratio (SNR) regime and high SNR regime are obtained in closed forms followed by the detailed performance analysis
Low-complexity dynamic resource scheduling for downlink MC-NOMA over fading channels
In this paper, we investigate dynamic resource scheduling (i.e., joint user,
subchannel, and power scheduling) for downlink multi-channel non-orthogonal
multiple access (MC-NOMA) systems over time-varying fading channels.
Specifically, we address the weighted average sum rate maximization problem
with quality-of-service (QoS) constraints. In particular, to facilitate fast
resource scheduling, we focus on developing a very low-complexity algorithm. To
this end, by leveraging Lagrangian duality and the stochastic optimization
theory, we first develop an opportunistic MC-NOMA scheduling algorithm whereby
the original problem is decomposed into a series of subproblems, one for each
time slot. Accordingly, resource scheduling works in an online manner by
solving one subproblem per time slot, making it more applicable to practical
systems. Then, we further develop a heuristic joint subchannel assignment and
power allocation (Joint-SAPA) algorithm with very low computational complexity,
called Joint-SAPA-LCC, that solves each subproblem. Finally, through
simulation, we show that our Joint-SAPA-LCC algorithm provides good performance
comparable to the existing Joint-SAPA algorithms despite requiring much lower
computational complexity. We also demonstrate that our opportunistic MC-NOMA
scheduling algorithm in which the Joint-SAPA-LCC algorithm is embedded works
well while satisfying given QoS requirements.Comment: 39 pages, 11 figure
Criteria on Utility Designing of Convex Optimization in FDMA Networks
In this paper, we investigate the network utility maximization problem in FDMA systems. We summarize with a suite of criteria on designing utility functions so as to achieve the global optimization convex. After proposing the general form of the utility functions, we present examples of commonly used utility function forms that are consistent with the criteria proposed in this paper, which include the well-known proportional fairness function and the sigmoidal-like functions. In the second part of this paper, we use numerical results to demonstrate a case study based on the criteria mentioned above, which deals with the subcarrier scheduling problem with dynamic rate allocation in FDMA system