61 |
Interference Cancelling Detectors In OFDMA/MIMO/Cooperative CommunicationsSreedhar, Dheeraj 09 1900 (has links)
In this thesis, we focus on interference cancelling (IC) detectors for advanced communication systems. The contents of this thesis is divided into the following four parts:
1. Multiuser interference (MUI) cancellation in uplink orthogonal frequency division multiple access (OFDMA).
2. Inter-carrier interference (ICI) and inter-symbol interference (ISI) cancellation in space-frequency block coded OFDM (SFBC-OFDM).
3. Single-symbol decodability (SSD) of distributed space-time block codes (DSTBC) in partially-coherent cooperative networks with amplify-and-forward protocol at the relays
4. Interference cancellation in cooperative SFBC-OFDM networks with amplify-and-forward (AF) and decode-and-forward (DF) protocols at the relays.
In uplink OFDMA systems, MUI occurs due to different carrier frequency offsets of different users at the receiver. In the first part of the thesis, we present a weighted multistage linear parallel interference cancellation approach to mitigate the effect of this MUI in uplink OFDMA. We also present a minimum mean square error (MMSE) based approach to MUI cancellation in uplink OFDMA. We present a recursion to approach the MMSE solution and show structure-wise and performance-wise comparison with other detectors in the literature.
Use of SFBC-OFDM signals is advantageous in high-mobility broadband wireless access, where the channel is highly time- as well as frequency-selective because of which the receiver experiences both ISI as well as ICI. In the second part of the thesis, we are concerned with the detection of SFBC-OFDM signals on time- and frequency-selective MIMO channels. Specifically, we propose and evaluate the performance of an interference cancelling receiver for SFBC-OFDM, which alleviates the effects of ISI and ICI in highly time- and frequency-selective channels
The benefits of MIMO techniques can be made possible to user nodes having a single transmit antenna through cooperation among different nodes. In the third part of the thesis, we derive a new set of conditions for a distributed DSTBC to be SSD for a partially-coherent relay channel (PCRC), where the relays have only the phase information of the source-to-relay channels. We also establish several properties of SSD codes for PCRC.
In the last part of the thesis, we consider cooperative SFBC-OFDM networks with AF and DF protocols at the relays. In cooperative SFBC-OFDM networks that employ DF protocol, i) ISI occurs at the destination due to violation of the `quasi-static' assumption because of the frequency selectivity of the relay-to-destination channels, and ii) ICI occurs due to imperfect carrier synchronization between the relay nodes and the destination, both of which result in error-floors in the bit error performance at the destination. We propose an interference cancellation algorithm for this system at the destination node, and show that the proposed algorithm effectively mitigates the ISI and ICI effects.
|
62 |
Genetic algorithms for scheduling in multiuser MIMO wireless communication systemsElliott, Robert C. Unknown Date
No description available.
|
63 |
Sparse Bayesian Learning For Joint Channel Estimation Data Detection In OFDM SystemsPrasad, Ranjitha January 2015 (has links) (PDF)
Bayesian approaches for sparse signal recovery have enjoyed a long-standing history in signal processing and machine learning literature. Among the Bayesian techniques, the expectation maximization based Sparse Bayesian Learning(SBL) approach is an iterative procedure with global convergence guarantee to a local optimum, which uses a parameterized prior that encourages sparsity under an evidence maximization frame¬work. SBL has been successfully employed in a wide range of applications ranging from image processing to communications. In this thesis, we propose novel, efficient and low-complexity SBL-based algorithms that exploit structured sparsity in the presence of fully/partially known measurement matrices. We apply the proposed algorithms to the problem of channel estimation and data detection in Orthogonal Frequency Division Multiplexing(OFDM) systems. Further, we derive Cram´er Rao type lower Bounds(CRB) for the single and multiple measurement vector SBL problem of estimating compressible vectors and their prior distribution parameters. The main contributions of the thesis are as follows:
We derive Hybrid, Bayesian and Marginalized Cram´er Rao lower bounds for the problem of estimating compressible vectors drawn from a Student-t prior distribution. We derive CRBs that encompass the deterministic or random nature of the unknown parameters of the prior distribution and the regression noise variance. We use the derived bounds to uncover the relationship between the compressibility and Mean Square Error(MSE) in the estimates. Through simulations, we demonstrate the dependence of the MSE performance of SBL based estimators on the compressibility of the vector.
OFDM is a well-known multi-carrier modulation technique that provides high spectral efficiency and resilience to multi-path distortion of the wireless channel
It is well-known that the impulse response of a wideband wireless channel is approximately sparse, in the sense that it has a small number of significant components relative to the channel delay spread. In this thesis, we consider the estimation of the unknown channel coefficients and its support in SISO-OFDM systems using a SBL framework. We propose novel pilot-only and joint channel estimation and data detection algorithms in block-fading and time-varying scenarios. In the latter case, we use a first order auto-regressive model for the time-variations, and propose recursive, low-complexity Kalman filtering based algorithms for channel estimation. Monte Carlo simulations illustrate the efficacy of the proposed techniques in terms of the MSE and coded bit error rate performance.
• Multiple Input Multiple Output(MIMO) combined with OFDM harnesses the inherent advantages of OFDM along with the diversity and multiplexing advantages of a MIMO system. The impulse response of wireless channels between the Nt transmit and Nr receive antennas of a MIMO-OFDM system are group approximately sparse(ga-sparse),i.e. ,the Nt Nr channels have a small number of significant paths relative to the channel delay spread, and the time-lags of the significant paths between transmit and receive antenna pairs coincide. Often, wire¬less channels are also group approximately-cluster sparse(ga-csparse),i.e.,every ga-sparse channel consists of clusters, where a few clusters have all strong components while most clusters have all weak components. In this thesis, we cast the problem of estimating the ga-sparse and ga-csparse block-fading and time-varying channels using a multiple measurement SBL framework. We propose a bouquet of novel algorithms for MIMO-OFDM systems that generalize the algorithms proposed in the context of SISO-OFDM systems. The efficacy of the proposed techniques are demonstrated in terms of MSE and coded bit error rate performance.
|
64 |
Low-Complexity Decoding and Construction of Space-Time Block CodesNatarajan, Lakshmi Prasad January 2013 (has links) (PDF)
Space-Time Block Coding is an efficient communication technique used in multiple-input multiple-output wireless systems. The complexity with which a Space-Time Block Code (STBC) can be decoded is important from an implementation point of view since it directly affects the receiver complexity and speed. In this thesis, we address the problem of designing low complexity decoding techniques for STBCs, and constructing STBCs that achieve high rate and full-diversity with these decoders. This thesis is divided into two parts; the first is concerned with the optimal decoder, viz. the maximum-likelihood (ML) decoder, and the second with non-ML decoders.
An STBC is said to be multigroup ML decodable if the information symbols encoded by it can be partitioned into several groups such that each symbol group can be ML decoded independently of the others, and thereby admitting low complexity ML decoding. In this thesis, we first give a new framework for constructing low ML decoding complexity STBCs using codes over the Klein group, and show that almost all known low ML decoding complexity STBCs can be obtained by this method. Using this framework we then construct new full-diversity STBCs that have the least known ML decoding complexity for a large set of choices of number of transmit antennas and rate. We then introduce the notion of Asymptotically-Good (AG) multigroup ML decodable codes, which are families of multigroup ML decodable codes whose rate increases linearly with the number of transmit antennas. We give constructions for full-diversity AG multigroup ML decodable codes for each number of groups g > 1. For g > 2, these are the first instances of g-group ML decodable codes that are AG or have rate more than 1. For g = 2 and identical delay, the new codes match the known families of AG codes in terms of rate. In the final section of the first part we show that the upper triangular matrix R encountered during the sphere-decoding of STBCs can be rank-deficient, thus leading to higher sphere-decoding complexity, even when the rate is less than the minimum of the number of transmit antennas and the number receive antennas. We show that all known AG multigroup ML decodable codes suffer from such rank-deficiency, and we explicitly derive the sphere-decoding complexities of most known AG multigroup ML decodable codes.
In the second part of this thesis we first study a low complexity non-ML decoder introduced by Guo and Xia called Partial Interference Cancellation (PIC) decoder. We give a new full-diversity criterion for PIC decoding of STBCs which is equivalent to the criterion of Guo and Xia, and is easier to check. We then show that Distributed STBCs (DSTBCs) used in wireless relay networks can be full-diversity PIC decoded, and we give a full-diversity criterion for the same. We then construct full-diversity PIC decodable STBCs and DSTBCs which give higher rate and better error performance than known multigroup ML decodable codes for similar decoding complexity, and which include other known full-diversity PIC decodable codes as special cases. Finally, inspired by a low complexity essentially-ML decoder given by Sirianunpiboon et al. for the two and three antenna Perfect codes, we introduce a new non-ML decoder called Adaptive Conditional Zero-Forcing (ACZF) decoder which includes the technique of Sirianunpiboon et al. as a special case. We give a full-diversity criterion for ACZF decoding, and show that the Perfect codes for two, three and four antennas, the Threaded Algebraic Space-Time code, and the 4 antenna rate 2 code of Srinath and Rajan satisfy this criterion. Simulation results show that the proposed decoder performs identical to ML decoding for these five codes. These STBCs along with ACZF decoding have the best error performance with least complexity among all known STBCs for four or less transmit antennas.
|
65 |
Multi-Antenna Communication Receivers Using Metaheuristics and Machine Learning AlgorithmsNagaraja, Srinidhi January 2013 (has links) (PDF)
In this thesis, our focus is on low-complexity, high-performance detection algorithms for multi-antenna communication receivers. A key contribution in this thesis is the demonstration that efficient algorithms from metaheuristics and machine learning can be gainfully adapted for signal detection in multi- antenna communication receivers. We first investigate a popular metaheuristic known as the reactive tabu search (RTS), a combinatorial optimization technique, to decode the transmitted signals in large-dimensional communication systems. A basic version of the RTS algorithm is shown to achieve near-optimal performance for 4-QAM in large dimensions. We then propose a method to obtain a lower bound on the BER performance of the optimal detector. This lower bound is tight at moderate to high SNRs and is useful in situations where the performance of optimal detector is needed for comparison, but cannot be obtained due to very high computational complexity. To improve the performance of the basic RTS algorithm for higher-order modulations, we propose variants of the basic RTS algorithm using layering and multiple explorations. These variants are shown to achieve near-optimal performance in higher-order QAM as well.
Next, we propose a new receiver called linear regression of minimum mean square error (MMSE) residual receiver (referred to as LRR receiver). The proposed LRR receiver improves the MMSE receiver by learning a linear regression model for the error of the MMSE receiver. The LRR receiver uses pilot data to estimate the channel, and then uses locally generated training data (not transmitted over the channel) to find the linear regression parameters. The LRR receiver is suitable for applications where the channel remains constant for a long period (slow-fading channels) and performs well. Finally, we propose a receiver that uses a committee of linear receivers, whose parameters are estimated from training data using a variant of the AdaBoost algorithm, a celebrated supervised classification algorithm in ma- chine learning. We call our receiver boosted MMSE (B-MMSE) receiver. We demonstrate that the performance and complexity of the proposed B-MMSE receiver are quite attractive for multi-antenna communication receivers.
|
66 |
Coding For Wireless Relay Networks And Mutiple Access ChannelsHarshan, J 02 1900 (has links) (PDF)
This thesis addresses the design of low-complexity coding schemes for wireless relay networks and multiple access channels. The first part of the thesis is on wireless relay networks and the second part is on multiple access channels.
Distributed space-time coding is a well known technique to achieve spatial diversity in wireless networks wherein, several geographically separated nodes assist a source node to distributively transmit a space-time block code (STBC) to the destination. Such STBCs are referred to as Distributed STBCs (DSTBCs). In the first part of the thesis, we focus on designing full diversity DSTBCs with some nice properties which make them amenable for implementation in practice. Towards that end, a class of full diversity DST-BCs referred to as Co-ordinate Interleaved DSTBCs (CIDSTBCs) are proposed for relay networks with two-antenna relays. To construct CIDSTBCs, a technique called co-ordinate vector interleaving is introduced wherein, the received signals at different antennas of the relay are processed in a combined fashion. Compared to the schemes where the received signals at different antennas of the relay are processed independently, we show that CIDSTBCs provide coding gain which comes in with negligible increase in the processing complexity at the relays. Subsequently, we design single-symbol ML decodable (SSD) DSTBCs for relay networks with single-antenna nodes. In particular, two classes of SSD DSTBCs referred to as (i) Semi-orthogonal SSD Precoded DSTBCs and (ii) Training-Symbol Embedded (TSE) SSD DSTBCs are proposed. A detailed analysis on the maximal rate of such DSTBCs is presented and explicit DSTBCs achieving the maximal rate are proposed. It is shown that the proposed codes have higher rates than the existing SSD DSTBCs.
In the second part, we study two-user Gaussian Multiple Access Channels (GMAC). Capacity regions of two-user GMAC are well known. Though, capacity regions of such channels provide insights into the achievable rate pairs in an information theoretic sense, they fail to provide information on the achievable rate pairs when we consider finitary restrictions on the input alphabets and analyze some real world practical signal constellations like QAM and PSK signal sets. Hence, we study the capacity aspects of two-user GMAC with finite input alphabets. In particular, Constellation Constrained (CC) capacity regions of two-user SISO-GMAC are computed for several orthogonal and non-orthogonal multiple access schemes (abbreviated as O-MA and NO-MA schemes respectively). It is first shown that NO-MA schemes strictly offer larger capacity regions than the O-MA schemes for finite input alphabets. Subsequently, for NO-MA schemes, code pairs based on Trellis Coded Modulation (TCM) are proposed such that any rate pair on the CC capacity region can be approached. Finally, we consider a two-user Multiple-Input Multiple-Output (MIMO) fading MAC and design STBC pairs such that ML decoding complexity is reduced.
|
67 |
Space-Time Block Codes With Low Sphere-Decoding ComplexityJithamithra, G R 07 1900 (has links) (PDF)
One of the most popular ways to exploit the advantages of a multiple-input multiple-output (MIMO) system is using space time block coding. A space time block code (STBC) is a finite set of complex matrices whose entries consist of the information symbols to be transmitted. A linear STBC is one in which the information symbols are linearly combined to form a two-dimensional code matrix. A well known method of maximum-likelihood (ML) decoding of such STBCs is using the sphere decoder (SD).
In this thesis, new constructions of STBCs with low sphere decoding complexity are presented and various ways of characterizing and reducing the sphere decoding complexity of an STBC are addressed. The construction of low sphere decoding complexity STBCs is tackled using irreducible matrix representations of Clifford algebras, cyclic division algebras and crossed-product algebras. The complexity reduction algorithms for the STBCs constructed are explored using tree based search algorithms. Considering an STBC as a vector space over the set of weight matrices, the problem of characterizing the sphere decoding complexity is addressed using quadratic form representations. The main results are as follows.
A sub-class of fast decodable STBCs known as Block Orthogonal STBCs (BOSTBCs) are explored. A set of sufficient conditions to obtain BOSTBCs are explained. How the block orthogonal structure of these codes can be exploited to reduce the SD complexity of the STBC is then explained using a depth first tree search algorithm. Bounds on the SD complexity reduction and its relationship with the block orthogonal structure are then addressed. A set of constructions to obtain BOSTBCs are presented next using Clifford unitary weight designs (CUWDs), Coordinate-interleaved orthogonal designs (CIODs), cyclic division algebras and crossed product algebras which show that a lot of codes existing in literature exhibit the block orthogonal property.
Next, the dependency of the ordering of information symbols on the SD complexity is discussed following which a quadratic form representation known as the Hurwitz-Radon quadratic form (HRQF) of an STBC is presented which is solely dependent on the weight matrices of the STBC and their ordering. It is then shown that the SD complexity is only a function of the weight matrices defining the code and their ordering, and not of the channel realization (even though the equivalent channel when SD is used depends on the channel realization). It is also shown that the SD complexity is completely captured into a single matrix obtained from the HRQF.
Also, for a given set of weight matrices, an algorithm to obtain a best ordering of them leading to the least SD complexity is presented using the HRQF matrix.
|
68 |
Μελέτη και ανάλυση μηχανισμών βελτιστοποίησης ελέγχου ισχύος σε κινητά δίκτυα επικοινωνιών / Study and analysis of power control optimisation mechanisms in mobile communication networksΚόκκινος, Βασίλειος 12 April 2010 (has links)
Ο ταχύτατα εξελισσόμενος τομέας των δικτύων κινητών επικοινωνιών έχει επιφέρει μία ιδιαίτερα αυξανόμενη απαίτηση για ασύρματη, πολυμεσική επικοινωνία. Στη ραγδαία εξέλιξη του τομέα αυτού συμβάλουν τα μέγιστα και οι απαιτήσεις της σύγχρονης αγοράς για ένα ενοποιημένο και λειτουργικό σύστημα κινητής τηλεφωνίας παρέχοντας παράλληλα πληθώρα ευρυζωνικών υπηρεσιών ψηφιακού περιεχομένου στους πελάτες - χρήστες του.
Είναι γεγονός ότι τα τελευταία χρόνια τα δίκτυα επικοινωνιών τρίτης γενιάς (3G) - Universal Mobile Telecommunication System (UMTS) γνωρίζουν μεγάλη άνθηση και η χρήση τους έχει επεκταθεί στις περισσότερες ευρωπαϊκές χώρες, όπως και στην Ελλάδα. Τα νέα αυτά κινητά δίκτυα αντικαθιστούν τα υπάρχοντα κινητά δίκτυα δεύτερης γενιάς και επιπλέον προσφέρουν προηγμένες υπηρεσίες στους κινητούς χρήστες. Ωστόσο, η αδήριτη ανάγκη για μεγαλύτερες (ευρυζωνικές) ταχύτητες πρόσβασης οδήγησε στην περαιτέρω ανάπτυξη των 3G δικτύων και στην υιοθέτηση νέων τεχνολογιών, με κυριότερο εκπρόσωπο τους την τεχνολογία High Speed Packet Access (HSPA). Η τεχνολογία HSPA αποτελεί τη φυσιολογική μετεξέλιξη του UMTS, η οποία πολλές φορές συναντάται και ως 3.5G ή 3G+, προκειμένου να δηλώσει την αναβάθμιση του 3G (UMTS) προτύπου.
Ωστόσο, παρά το γεγονός ότι η τεχνολογία HSPA αναμένεται να προσφέρει τη δυνατότητα παροχής πληθώρας ευρυζωνικών υπηρεσιών, το 3rd Generation Partnership Project (3GPP), που αποτελεί τον οργανισμό που προτυποποιεί τις νέες τεχνολογίες και ορίζει τις προδιαγραφές τους, ήδη μελετά και επεξεργάζεται νέες τεχνολογίες που θα επικρατήσουν την αμέσως επόμενη δεκαετία στην αγορά των κινητών επικοινωνιών. Το νέο αυτό project αποκαλείται Long Term Evolution (LTE) και στοχεύει στην επίτευξη ακόμη υψηλότερων ρυθμών μετάδοσης σε συνδυασμό με την αξιοποίηση μεγαλύτερου εύρος ζώνης. Κύρια προοπτική του LTE αποτελεί η διασφάλιση της ανταγωνιστικότητας και η επικράτηση του προτύπου στο χρονικό ορίζοντα της επόμενης δεκαετίας.
Κατά συνέπεια, η αγορά κινητών επικοινωνιών σταδιακά μεταλλάσσεται προς τη δημιουργία δικτύων κινητών επικοινωνιών επόμενης γενιάς, με απώτερο σκοπό την επίτευξη της αποκαλούμενης «Κινητής Ευρυζωνικότητας» (Mobile Broadband).
Ταυτόχρονα με την εκτεταμένη εξάπλωση των δικτύων κινητών επικοινωνιών επόμενης γενιάς καθώς και τις αυξημένες δυνατότητες των κινητών συσκευών, οι πάροχοι πολυμεσικού περιεχομένου και υπηρεσιών ενδιαφέρονται όλο και περισσότερο για την υποστήριξη της πολυεκπομπής (multicasting) δεδομένων στα δίκτυα αυτά με σκοπό την αποτελεσματική διαχείριση και επαναχρησιμοποίηση των διαθέσιμων πόρων του δικτύου. Επιπρόσθετα, οι χρήστες των κινητών δικτύων έχουν πλέον την απαίτηση να προσπελαύνουν εφαρμογές και υπηρεσίες οι οποίες μέχρι σήμερα μπορούσαν να διατεθούν αποκλειστικά από τα συμβατικά ενσύρματα δίκτυα. Έτσι λοιπόν στις μέρες μας γίνεται λόγος για υπηρεσίες πραγματικού χρόνου όπως mobile TV, mobile gaming, mobile streaming κ.α.
Ένα από τα σημαντικότερα βήματα των δικτύων κινητών επικοινωνιών προς την κατεύθυνση της παροχής νέων, προηγμένων πολυμεσικών υπηρεσιών είναι η εισαγωγή της υπηρεσίας Multimedia Broadcast / Multicast Service (MBMS). Η υπηρεσία MBMS έχει σαν κύριο σκοπό την υποστήριξη IP εφαρμογών πανεκπομπής (broadcact) και πολυεκπομπής (multicast), επιτρέποντας με αυτό τον τρόπο την παροχή υπηρεσιών υψηλού ρυθμού μετάδοσης σε πολλαπλούς χρήστες με οικονομικό τρόπο. Η multicast μετάδοση δεδομένων σε κινητά δίκτυα επικοινωνιών είναι μια σχετικά νέα λειτουργικότητα η οποία βρίσκεται ακόμη στο στάδιο των δοκιμών και της προτυποποίησης της. Ένας multicast μηχανισμός μεταδίδει τα δεδομένα μόνο μία φορά πάνω από κάθε ασύρματο σύνδεσμο που αποτελεί τμήμα των μονοπατιών προς τους προορισμούς-κινητούς χρήστες.
Το κρισιμότερο σημείο που εντοπίζεται κατά τη multicast μετάδοση δεδομένων στα κινητά δίκτυα επικοινωνιών είναι ο αποτελεσματικός έλεγχος ισχύος. Οι σταθμοί βάσης των κυψελωτών αυτών δικτύων διαθέτουν περιορισμένους πόρους ισχύος, γεγονός που περιορίζει τη χωρητικότητα της κυψέλης (cell) και επιβάλλει τη χρήση μίας βέλτιστης στρατηγικής για την όσο το δυνατόν καλύτερη αξιοποίηση των διαθέσιμων πόρων ισχύος. Ο έλεγχος ισχύος στοχεύει στη μείωση της εκπεμπόμενης ισχύος, στην ελαχιστοποίηση του θορύβου στο κυψελωτό δίκτυο και κατά συνέπεια στη διασφάλιση μεγαλύτερης χωρητικότητας επιπλέον χρηστών.
Ένα από τα βασικότερα στοιχεία του ελέγχου ισχύος στα δίκτυα κινητών επικοινωνιών επόμενης γενιάς κατά τη multicast μετάδοση πολυμεσικών δεδομένων αποτελεί η επιλογή του κατάλληλου καναλιού μεταφοράς για τη μετάδοση των δεδομένων στον κινητό χρήστη. Συγκεκριμένα, πρόκειται για ένα κρίσιμο ζήτημα το οποίο είναι ακόμα υπό εξέταση στο 3GPP. Προς την κατεύθυνση αυτή, στο MBMS πρότυπο έχουν αναπτυχθεί διάφοροι μηχανισμοί, με χαρακτηριστικό τον MBMS Counting Mechanism. Στόχος του μηχανισμού αυτού είναι η βελτιστοποίηση της ροής δεδομένων για την υπηρεσία MBMS, όταν αυτά διέρχονται από τις διεπαφές του UMTS/HSPA δικτύου. Ωστόσο, η υπάρχουσα μορφή του μηχανισμού αυτού, καθώς και των αρκετών άλλων μηχανισμών που έχουν προταθεί από το 3GPP, διακρίνεται από πολλές αδυναμίες που δεν επιτρέπουν την αποτελεσματική και μαζική μετάδοση πολυμεσικών δεδομένων. Τα σημαντικότερα προβλήματα των μηχανισμών αυτών είναι η απουσία ευρυζωνικών χαρακτηριστικών καθώς και η σπατάλη σημαντικού τμήματος των ούτως ή άλλως περιορισμένων πόρων ισχύος. Εν γένει, η επιλογή του κατάλληλου καναλιού μεταφοράς των πολυμεσικών δεδομένων στο ασύρματο μέσο είναι μια δύσκολη διαδικασία καθώς μια λανθασμένη επιλογή καναλιού μπορεί να οδηγήσει στην αστοχία μίας ολόκληρης κυψέλης. Γίνεται σαφές λοιπόν, ότι απαιτείται μία βελτιωμένη έκδοση των υπαρχόντων μηχανισμών για την αποτελεσματικότερη και οικονομικότερη μετάδοση πολυμεσικού περιεχομένου σε μεγάλο πλήθος χρηστών.
Λαμβάνοντας υπόψη τα παραπάνω, στόχος της παρούσας διδακτορικής διατριβής είναι η μελέτη του ελέγχου ισχύος στα δίκτυα κινητών επικοινωνιών επόμενης γενιάς καθώς και η ανάπτυξη νέων μεθόδων/μηχανισμών για τη βελτιστοποίηση του. Ιδιαίτερο χαρακτηριστικό της διατριβής αυτής είναι η ενσωμάτωση και η «εκμετάλλευση» όλων των ιδιαίτερων χαρακτηριστικών της HSPA τεχνολογίας στην MBMS υπηρεσία.
Προς αυτή την κατεύθυνση, στην παρούσα διδακτορική διατριβή αναλύονται και αξιολογούνται όλα τα υπάρχοντα κανάλια μεταφοράς του UMTS και της τεχνολογίας HSPA τα οποία μπορούν να χρησιμοποιηθούν για τη multicast μετάδοση MBMS υπηρεσιών. Η αξιολόγηση γίνεται με βάση την απαιτούμενη ισχύ που πρέπει να ανατεθεί από το σταθμό βάσης για καθένα από αυτά, και κατά συνέπεια με βάση το ρυθμό μετάδοσης τους, τον αριθμό των χρηστών που μπορούν να εξυπηρετήσουν, την ποιότητα υπηρεσιών για κάθε χρήστη, τη μέγιστη δυνατή κάλυψη της κυψέλης κ.α.
Οι ιδιαίτερα αυξημένες απαιτήσεις των MBMS υπηρεσιών μας οδήγησαν στη συνέχεια στη διερεύνηση και αξιολόγηση ορισμένων τεχνικών μείωσης της εκπεμπόμενης ισχύος, με απώτερο σκοπό την αποδοτικότερη χρήση των πόρων του συστήματος κατά τη μετάδοση MBMS υπηρεσιών. Ενδεικτικά αναφέρουμε πως μία MBMS υπηρεσία με ρυθμό μετάδοσης 128 Kbps μπορεί να καταναλώσει έως και το 80% των πόρων ισχύος ενός σταθμού βάσης. Επομένως, γίνεται κατανοητό ότι η μετάδοση MBMS υπηρεσιών με τόσο υψηλούς ρυθμούς μετάδοσης καθίσταται δύσκολη έως και αδύνατη. Για την αντιμετώπιση αυτού του προβλήματος έχουν αναπτυχθεί τεχνικές, όπως η FACH Dynamic Power Setting, η Macro Diversity Combining και το Rate Splitting, ικανές να μειώσουν τα επίπεδα ισχύος κατά τη μετάδοση multicast δεδομένων στους MBMS χρήστες. Η διδακτορική αυτή διατριβή εξετάζει την αποδοτικότητα της χρήσης αυτών των τεχνικών εξοικονόμησης ισχύος και παρουσιάζει πειραματικά αποτελέσματα που αποκαλύπτουν το ποσό ισχύος που εξοικονομείται από κάθε μία τεχνική.
Η αξιολόγηση τόσο των καναλιών μεταφοράς όσο και των τεχνικών μείωσης ισχύος θα οδηγήσει στην εύρεση ενός κατάλληλου σχήματος/μηχανισμού, ο οποίος θα εξασφαλίζει την αποδοτική εναλλαγή μεταξύ των διάφορων τύπων καναλιών κατά τη μετάδοση MBMS υπηρεσιών. Ο μηχανισμός αυτός, τον οποίο καλούμε MBMS Channel Assignment Mechanism (ή χάριν συντομίας «MCAM»), αναμένεται να εξασφαλίσει βελτιωμένη απόδοση σε σχέση με τους αντίστοιχους μηχανισμούς που έχουν προταθεί από το 3GPP, μείωση της καταναλισκόμενης ισχύος και κατά συνέπεια αύξηση της χωρητικότητας των κινητών δικτύων επόμενης γενιάς. Ωστόσο, το πιο αξιοπρόσεκτο πλεονέκτημα του προτεινόμενου μηχανισμού, που ουσιαστικά τον διαφοροποιεί από τις άλλες προσεγγίσεις, είναι ότι προσαρμόζεται στις αυξημένες απαιτήσεις των κινητών δικτύων επόμενης γενιάς για ταυτόχρονη παροχή πολλαπλών πολυμεσικών συνόδων. Το γεγονός αυτό μπορεί να επιτρέψει τη μαζική μετάδοση πολυμεσικών δεδομένων σε πληθώρα κινητών χρηστών, θέτοντας κατά τον τρόπο αυτό τον MCAM σαν έναν ισχυρό υποψήφιο για τα δίκτυα επόμενης γενιάς. / The rapid growth of mobile communications networks has involved an increasing demand for wireless, multimedia communication. The fast development of this area was mainly motivated by the requirements of modern market for a unified and functional system of mobile communications that, at the same time, may provide numerous broadband services to its users.
More specifically, in the recent years, the usage of third generation (3G) - Universal Mobile Telecommunication System (UMTS) cellular networks has begun to rise in most European countries, as in Greece. 3G networks have replaced the second generation mobile networks and moreover, are in position of offering advanced services to mobile users. However, the need for higher (broadband) speeds led to the further development of 3G networks and to the adoption of new technologies, with main representative the High Speed Packet Access (HSPA) technology. HSPA constitutes the evolution of UMTS and is known as 3.5G or 3G+ in order to indicate the upgrade from UMTS.
However, despite the fact that HSPA technology is expected to allow the provision of numerous broadband services, the 3rd Generation Partnership Project (3GPP), the authorized organization for the standardization of new mobile technologies, already examines new technologies that will prevail in the mobile communications industry over the next decades. This novel project is known as Long Term Evolution (LTE) and aims at achieving increased data rates and reduced latency compared to UMTS and HSPA networks. Therefore, the mobile communications industry progressively evolves to next generation networks, with main target the achievement of the so called “Mobile Broadband”.
Simultaneously, multimedia content and service providers show an increased interest in supporting multicast data in order to effectively manage and re-use the available network resources. Additionally, more and more users require access to applications and services that until today could only be accessed by conventional wired networks. Thus, real time applications and services may face low penetration today; however, they are expected to gain high interest in future mobile networks. These applications actually reflect a modern, future way of communication among mobile users. For instance, mobile TV is expected to be a “killer” application for 3G’s. Such mobile TV services include streaming live TV (news, weather forecasts etc.) and streaming video (such as video clips). All the above constitute a series of indicative emerging applications that necessitate advanced transmission techniques.
One of the most significant steps towards the provision of such demanding services is the introduction of Multimedia Broadcast/Multicast Service (MBMS). MBMS is a point-to-multipoint service in which data is transmitted from a single source entity to multiple destinations, allowing the networks resources to be shared. Actually, MBMS extends the existing UMTS infrastructure and efficiently uses network and radio resources, both in the core network and most importantly, in the air interface of UMTS, where the bottleneck is placed to a large group of users. Therefore, MBMS constitutes an efficient way to support the plethora of the emerging wireless multimedia applications and services such as IP video conferencing and video streaming.
The main requirement during the provision of MBMS multicast services is to make an efficient overall usage of radio and network resources. This necessity mainly translates into improved power control strategies, since the base stations’ transmission power is the limiting factor of downlink capacity in UMTS networks. Under this prism, power control is one of the most critical aspects in MBMS due to the fact that downlink transmission power in UMTS networks is a limited resource and must be shared efficiently among all MBMS users in a cell. Moreover, power control aims at minimizing the transmitted power, eliminating in this way the intercell interference. However, when misused, the use of power control may lead to a high level of wasted power and worse performance results.
In order to have efficient power control in MBMS, one of the most critical aspects is the selection of the transport channel for the transmission of MBMS multicast traffic. MBMS services can be provided in each cell by either multiple point-to-point (PTP) channels or by a single point-to-multipoint (PTM) channel. A wrong channel selection may result to a significant capacity decrease, thus, preventing the mass delivery of multimedia applications. It is worth mentioning that channel selection is still an open issue in today’s MBMS infrastructure mainly due to its catalytic role in MBMS performance. In the frame of MBMS power control and transport channel selection several approaches have been proposed, with main representative the 3GPP MBMS Counting Mechanism. However, none of these approaches performs optimal transport channel selection either due to the fact that some of them do not consider the power consumption as the selection criterion or because of the fact that they do not consider all the available transport channels (or combination of them) for the transmission of the MBMS data. All the above stress the need for an advanced version of these mechanisms that could deliver multimedia content to a large number of mobile users in a more efficient and economic way.
After taking into account the above analysis, objective of this dissertation is the study of power control issues in next generation mobile communication networks and the development of new approaches/ mechanisms for its optimization.
To this direction, this dissertation analyzes and evaluates all the available UMTS and HSPA transport channels that could be used for the transmission of MBMS multicast services. Moreover, this dissertation investigates and evaluates several power saving techniques that aim at the efficient usage of radio and network resources. Techniques, such as Dynamic Power Setting, Macro Diversity Combining and Rate Splitting are capable of decreasing the power consumption during the provision of MBMS services and may enable the mass market delivery of multimedia services to mobile users. The evaluation of the available transport channels and power saving techniques will lead to the development of a novel scheme/mechanism that will enable the efficient selection of transport channels for the transmission of MBMS services. The proposed mechanism, which we call MBMS Channel Assignment Mechanism (or «MCAM»), is expected to optimally utilize the available power resources of base stations to MBMS sessions running in the network, resulting in that way to an extensive increase on the system’s capacity. Therefore, MCAM may allow the mass provision of multimedia data to a large number of mobile users, which makes MCAM a strong candidate for next generation networks.
|
Page generated in 0.0713 seconds