Policy-Based Radio Resource Management in Multicast OFDMA Systems

Η ασύρματηφασματική αποδοτικότητα είναι ένας, όλο και περισσότερο, σημαντικός παράγοντας εξαιτίας της ταχείας ανάπτυξης των ασύρματων υπηρεσιών ευρείας ζώνης. Η σχεδίαση ενός συστήματος με πολλά φέροντα, όπως είναι ένα σύστημα OFDMA,επιτρέπει στα συστήματα να έχουν υψηλή χωρητικότητα για να ικανοποιήσουν τις απαιτήσεις των υπηρεσιών ευρείας ζώνης.Αυτή η αυξημένη χωρητικότητα των συστημάτων μπορεί να βελτιστοποιηθεί περαιτέρω εκμεταλλευόμενοι καλύτερα τα χαρακτηριστικά των ασύρματων καναλιών. Ηθεμελιώδηςιδέα ενός σχήματος κατανομής πόρων είναι η αποτελεσματική κατανομή των διαθέσιμων ασύρματων πόρων, όπως είναι οι υποφορείς και η ισχύς εκπομπής, μεταξύ των χρηστών του συστήματος. Σχετικά με τα προβλήματα της κατανομής πόρων σε ασύρματα συστήματα τηλεπικοινωνιών βασισμένα στην τεχνική OFDMA, η περισσότερη έρευνα επικεντρώνεται στην αναζήτηση πολιτικών ανάθεσης υποφορέων και ισχύος. Οι διαθέσιμες τεχνικές της βιβλιογραφίας δεν μπορούν να εφαρμοστούν όπως είναι σε συστήματα πολυεκπομπής. Επιπλέον, οι υπάρχουσες τεχνικές δεν μπορούν να εφαρμοστούν αμετάβλητες σε πραγματικά συστήματα στα οποία υπάρχει μεγάλος αριθμός OFDMυποφορέων, καθώς η υπολογιστική πολυπλοκότητα είναι πολύ μεγάλη. Ο βασικός στόχος της παρούσας διπλωματικής εργασίας είναι η πρόταση ικανών μηχανισμών κατανομής των διαθέσιμων υποφορέων σε ασύρματα συστήματα πολυεκπομπής χρησιμοποιώντας την τεχνολογία OFDMA. Πιο συγκεκριμένα, σχετικά με τα συστήματα πολυεκπομπής, θεωρούμε ότι τόσο ο σταθμός βάσης όσο και κάθε χρήστης είναι εφοδιασμένοι με μοναδική κεραία και η μονάδα κατανομής δεν είναι ο υποφορέας, όπως στα συμβατικά συστήματα OFDMA, αλλά μία ομάδα γειτονικώνυποφορέων, η οποία ονομάζεται τεμάχιο, με σκοπό τη μείωση της μεγάλης υπολογιστικής πολυπλοκότητας. Ένας αποτελεσματικός αλγόριθμος προτείνεται του οποίου ο στόχος είναι η μεγιστοποίηση του συνολικού ρυθμού μετάδοσης δεδομένων με περιορισμούς στη συνολική διαθέσιμη ισχύ, στο BERανά τεμάχιο και στους αναλογικούς περιορισμούς μεταξύ των ρυθμών μετάδοσης δεδομένων των ομάδων χρηστών. Η προσομοίωση και η ανάλυση της πολυπλοκότητας που παρουσιάζονται, υποστηρίζουν τα πλεονεκτήματα της κατανομής πόρων σε συστήματα πολυεκπομπήςOFDMA τα οποία βασίζονται σε κατανομή τεμαχίων και έχουν ως στόχος την εξασφάλιση της αναλογικότητας μεταξύ των ρυθμών μετάδοσης δεδομένων των ομάδων χρηστών.Wireless spectral efficiency is increasingly important due to the rapid growth of demand for high data rate wideband wireless services. The design of a multi-carrier system, such as an OFDMA system, enables high system capacity suited for these wideband wireless services. This system capacity can be further optimized with a resource allocation scheme by exploiting the characteristics of the wireless fading channels. The fundamental idea of a resource allocation scheme is to efficiently distribute the available wireless resources, such as the subcarriers and transmission power, among all admitted users in the system. Regarding the problems of resource allocation in OFDMA-based wireless communicationsystems, much of the research effort mainly focuses on finding efficient power controland subcarrier assignment policies. With systems employing multicast transmission,the available schemes in literature are not always applicable. Moreover, the existing approachesare particularly inaccessible in practical systems in which there are a large numberof OFDM subcarriers being utilized, as the required computational burden is prohibitivelyhigh. The ultimate goal of this Thesis is therefore to propose affordable mechanisms toflexibly and effectively share out the available resources in multicast wireless systems deployingOFDMA technology. Specifically, according to multicast system, it is assumed thatboth the BS and each user are equipped witha single antenna and the allocation unit is not the subcarrier,as in conventional OFDMA systems, but a set of contiguoussubcarriers, which is called chunk, in order to alleviate the heavy computational burden. An efficient algorithmis proposed whose aim is to maximize the total throughput subject to constraints on totalavailable power,BER over a chunk, and proportional data rates constraints among multicast groups. Simulation and complexity analysis are provided to support thebenefits of chunk-based resource allocation to multicast OFDMA systems with targeting proportional data rates among multicast groups

A Combined User-order and Chunk-order Algorithm to Minimize The Average BER for Chunk Allocation in SC-FDMA Systems

A Chunk by chunk-based allocation is an emerging subcarrier allocation in Single Carrier Frequency Division Multiple Access (SC-FDMA) due to its low complexity. In this paper, a combined user-order  and chunk-order allocation for solving chunk allocation problem which minimizes the average BER of all users while improving the throughput in SC-FDMA uplink is proposed. The subcarrier grouping into a chunk of all users on both-order allocations are performed by averaging the BER of a contiguous subcarriers within a chunk. The sequence of allocation is according to the average of users’ BER on user-order allocation and the average of chunks’ BER on chunk-order allocation. The best allocation is determined by choosing one of both-order allocations which provides the smaller BER systems. The simulation results showed that the proposed algorithm can outperform the previous algorithms in term of  average BER and throughput without increase the time complexity.

Methods for Compression of Feedback in Adaptive Multicarrier 4G Schemes

In this paper, several algorithms for compressing the feedback of channel quality information are presented and analyzed. These algorithms are developed for a proposed adaptive modulation scheme for future multi-carrier 4G mobile systems. These strategies compress the feedback data and, used together with opportunistic scheduling, drastically reduce the feedback data rate. Thus the adaptive modulation schemes become more suitable and efficient to be implemented in future mobile systems, increasing data throughput and overall system performance.This work has been partly funded by the Spanish government with projects MACAWI (TEC 2005-07477-c02-02), MAMBO2 (CCG06-UC3M-TIC-0698), and European COST Action 289 and is a result of work done within this European actio

Multicast Scheduling and Resource Allocation Algorithms for OFDMA-Based Systems: A Survey

Multicasting is emerging as an enabling technology for multimedia transmissions over wireless networks to support several groups of users with flexible quality of service (QoS)requirements. Although multicast has huge potential to push the limits of next generation communication systems; it is however one of the most challenging issues currently being addressed. In this survey, we explain multicast group formation and various forms of group rate determination approaches. We also provide a systematic review of recent channel-aware multicast scheduling and resource allocation (MSRA) techniques proposed for downlink multicast services in OFDMA based systems. We study these enabling algorithms, evaluate their core characteristics, limitations and classify them using multidimensional matrix. We cohesively review the algorithms in terms of their throughput maximization, fairness considerations, performance complexities, multi-antenna support, optimality and simplifying assumptions. We discuss existing standards employing multicasting and further highlight some potential research opportunities in multicast systems

Fairness-Adaptive Goodput-Based Resource Allocation in OFDMA Downlink with ARQ

We present a cross-layer resource-allocation (RA) scheme for the downlink in orthogonal frequency-division multiple-access (OFDMA) systems with fairness control among the users, where the resources to be allocated are power, bits per symbol, and subchannels. The use of subchannels, which are defined as group of subcarriers, leads to reducing the complexity of the bandwidth allocation compared with the commonly adopted subcarrier allocation. A goodput-based optimization function, which is derived by combining automatic repeat request (ARQ) and physical (PHY)-layer parameters, is used to perform RA for applications that demand error-free transmissions. Two transmission strategies are considered, with and without concatenation of subchannels, for which two different RA methods are developed, respectively. We also propose an algorithm that improves the complexity associated to both concatenation and nonconcatenation schemes, without appreciable performance loss.The work was supported by the GRE3N Project under Grant TEC2011-29006-C03-03.Publicad

Cross-layer design for OFDMA wireless networks with finite queue length based on game theory

This thesis was submitted for the award of Doctor of Philosophy and was awarded by Brunel University London.In next generation wireless networks such as 4G- LTE and WiMax, the demand for high data rates, the scarcity of wireless resources and the time varying channel conditions has led to the adoption of more sophisticated and robust techniques in PHY such as orthogonal frequency division multiplexing (OFDM) and the corresponding access technique known as orthogonal frequency division multiplexing access (OFDMA). Cross-layer schedulers have been developed in order to describe the procedure of resource allocation in OFDMA wireless networks. The resource allocation in OFDMA wireless networks has received great attention in research, by proposing many different ways for frequency diversity exploitation and system’s optimization. Many cross-layer proposals for dynamic resource allocation have been investigated in literature approaching the optimization problem from different viewpoints i.e. maximizing total data rate, minimizing total transmit power, satisfying minimum users’ requirements or providing fairness amongst users. The design of a cross-layer scheduler for OFDMA wireless networks is the topic of this research. The scheduler utilizes game theory in order to make decisions for subcarrier and power allocation to the users with the main concern being to maintain fairness as well as to maximize overall system’s performance. A very well known theorem in cooperative game theory, the Nash Bargaining Solution (NBS), is employed and solved in a close form way, resulting in a Pareto optimal solution. Two different cases are proposed. The first one is the symmetric NBS (S-NBS) where all users have the same weight and therefore all users have the same opportunity for resources and the second one, is the asymmetric NBS (A-NBS), where users have different weights, hence different priorities where the scheduler favours users with higher priorities at expense of lower priority users. As MAC layer is vital for cross-layer, the scheduler is combined with a queuing model based on Markov chain in order to describe more realistically the incoming procedure from the higher layers

A Proposal for Dynamic Frequency Sharing in Wireless Networks

Wireless networks are today employed as complementary access technology, implemented on the last hop towards the Internet end-user. The shared media that wireless deployments provide and which is relevant to interconnect multiple users has a limited technical design, as only one device can be served per unit of time, design aspect that limits the potential applicability of wireless in dense environments. This paper proposes and evaluates a novel MAC-layer mechanism that extends current wireless networks with the possibility to perform downstream transmission to multiple devices within a single transmission time-frame, resulting in improved fairness for all devices. The mechanism, which is software-defined, is backward-compatible with current wireless standards and does not require any hardware changes. The solution has been validated in a realistic testbed, and the paper provides details concerning the computational aspects of our solution; a description of the implementation; and results extracted under different realistic scenarios in terms of throughput, packet loss, as well as jitter

On the feasibility of a channel-dependent scheduling for the SC-FDMA in 3GPP-LTE (mobile environment) based on a prioritized-bifacet Hungarian method

We propose a methodology based on the prioritization and opportunistic reuse of the optimization algorithm known as Hungarian method for the feasible implementation of a channel-dependent scheduler in the long-term evolution uplink (single carrier frequency division multiple access system). This proposal aims to offer a solution to the third generation system’s constraint of allocating only adjacent subcarriers, by providing an optimal resource allotment under a fairness scheme. A multiuser mobile environment following the third generation partnership project TS 45.005v9.3.0/25.943v9.0.0 was also implemented for evaluating the scheduler’s performance. From the results, it was possible to examine the channel frequency response for all users (four user equipments) along the whole bandwidth, to visualize the dynamic resource allocation for each of the 10,000 channel realizations considered, to generate the statistical distribution and cumulative distribution functions of the obtained global costs, as well as to evaluate the system’s performance once the proposed algorithm was embedded. Comparing and emphasizing the benefits of utilizing the proposed dynamic allotment instead of the classic static-scheduling and other existent methods.Peer ReviewedPostprint (published version

Non-orthogonal Multiple Access (NOMA) with Asynchronous Interference Cancellation

Non-orthogonal multiple access (NOMA) allows allocating one carrier to more than one user at the same time in one cell. It is a promising technology to provide high throughput due to carrier reuse within a cell. In this thesis, a novel interference cancellation (IC) technique is proposed for asynchronous NOMA systems, which uses multiple symbols from each interfering user to carry out IC. With the multiple symbol information from each interfering user the IC performance can be improved substantially. The proposed technique creates and processes so called "IC Triangles". That is, the order of symbol detection is based on detecting all the overlapping symbols of a stonger user before detecting a symbol of a weak user. Also, successive IC (SIC) is employed in the proposed technique. Employing IC Triangles together with the SIC suppresses co-channel interference from strong (earlier detected) signals for relatively weak (yet to be detected) signals and make it possible to achieve low bit error rate (BER) for all users. Further, iterative signal processing is used to improve the system performance. Employing multiple iterations of symbol detection which is based on exploiting a priori estimate obtained from the previous iteration can improve the detection and IC performances. The BER and capacity performance analyses of an uplink NOMA system with the proposed IC technique are presented, along with the comparison to orthogonal frequency division multiple access (OFDMA) systems. Performance analyses validate the requirement for a novel IC technique that addresses asynchronism at NOMA uplink transmissions. Also, numerical and simulation results show that NOMA with the proposed IC technique outperforms OFDMA for uplink transmissions. It is also concluded from the research that, in the NOMA system, users are required to have large received power ratio to satisfy BER requirements and the required received power ratio increases with increasing the modulation level. Also, employing iterative IC provides significant performance gain in NOMA and the number of required iterations depend on the modulation level and detection method. Further, at uplink transmissions, users' BER and capacity performances strongly depend on the relative time offset between interfering users, besides the received power ratio