On the Non-Orthogonal Layered Broadcast Codes in Cooperative Wireless Networks

A multi-fold increase in spectral efficiency and throughput are envisioned in the fifth generation of cellular networks to meet the requirements of International Telecommunication Union (ITU) IMT-2020 on massive connectivity and tremendous data traffic. This is achieved by evolution in three aspects of current networks. The first aspect is shrinking the cell sizes and deploying dense picocells and femtocells to boost the spectral reuse. The second is to allocate more spectrum resources including millimeter-wave bands. The third is deploying highly efficient communications and multiple access techniques. Non-orthogonal multiple access (NOMA) is a promising communication technique that complements the current commercial spectrum access approach to boost the spectral efficiency, where different data streams/users’ data share the same time, frequency and code resource blocks (sub-bands) via superimposition with each other. The receivers decode their own messages by deploying the successive interference cancellation (SIC) decoding rule. It is known that the NOMA coding is superior to conventional orthogonal multiple access (OMA) coding, where the resources are split among the users in either time or frequency domain. The NOMA based coding has been incorporated into other coding techniques including multi-input multi-output (MIMO), orthogonal frequency division multiplexing (OFDM), cognitive radio and cooperative techniques. In cooperative NOMA codes, either dedicated relay stations or stronger users with better channel conditions, act as relay to leverage the spatial diversity and to boost the performance of the other users. The advantage of spatial diversity gain in relay-based NOMA codes, is deployed to extend the coverage area of the network, to mitigate the fading effect of multipath channel and to increase the system throughput, hence improving the system efficiency. In this dissertation we consider the multimedia content delivery and machine type communications over 5G networks, where scalable content and low complexity encoders is of interest. We propose cross-layer design for transmission of successive refinement (SR) source code interplayed with non-orthogonal layered broadcast code for deployment in several cooperative network architectures. Firstly, we consider a multi-relay coding scheme where a source node is assisted by a half-duplex multi-relay non-orthogonal amplify-forward (NAF) network to communicate with a destination node. Assuming the channel state information (CSI) is not available at the source node, the achievable layered diversity multiplexing tradeoff (DMT) curve is derived. Then, by taking distortion exponent (DE) as the figure of merit, several achievable lower bounds are proved, and the optimal expected distortion performance under high signal to noise ratio (SNR) approximation is explicitly obtained. It is shown that the proposed coding can achieve the multi-input single-output (MISO) upper bound under certain regions of bandwidth ratios, by which the optimal performance in these regions can be explicitly characterized. Further the non-orthogonal layered coding scheme is extended to a multi-hop MIMO decode-forward (DF) relay network where a set of DE lower bounds is derived. Secondly, we propose a layered cooperative multi-user scheme based on non-orthogonal amplify-forward (NAF) relaying and non-orthogonal multiple access (NOMA) codes, aiming to achieve multi-user uplink transmissions with low complexity and low signaling overhead, particularly applicable to the machine type communications (MTC) and internet of things (IoT) systems. By assuming no CSI available at the transmitting nodes, the proposed layered codes make the transmission rate of each user adaptive to the channel realization. We derive the close-form analytical results on outage probability and the DMT curve of the proposed layered NAF codes in the asymptotic regime of high SNR, and optimize the end-to-end performance in terms of the exponential decay rate of expected distortion. Thirdly, we consider a single relay network and study the non-orthogonal layered scheme in the general SNR regime. A layered relaying scheme based on compress-forward (CF) is introduced, where optimization of end to end performance in terms of expected distortion is conducted to jointly determine network parameters. We further derive the explicit analytical optimal solution with two layers in the absence of channel knowledge. Finally, we consider the problem of multicast of multi-resolution layered messages over downlink of a cellular system with the assumption of CSI is not available at the base station (BS). Without loss generality, spatially random users are divided into two groups, where the near group users with better channel conditions decode for both layers, while the users in the second group decode for base layer only. Once the BS launches a multicast message, the first group users who successfully decoded the message, deploy a distributed cooperating scheme to assist the transmission to the other users. The cooperative scheme is naive but we will prove it can effectively enhance the network capacity. Closed form outage probability is explicitly derived for the two groups of users. Further it is shown that diversity order equal to the number of users in the near group is achievable, hence the coding gain of the proposed distributed scheme fully compensate the lack of CSI at the BS in terms of diversity order

Multiuser MIMO techniques with feedback

Kooperative Antennenanlagen haben vor kurzem einen heißen Forschungsthema geworden, da Sie deutlich höhere spektrale Effizienz als herkömmliche zelluläre Systeme versprechen. Der Gewinn wird durch die Eliminierung von Inter-Zelle Störungen (ICI) durch Koordinierung der-Antenne Übertragungen erworben. Vor kurzem, verteilte Organisation Methoden vorgeschlagen. Eine der größten Herausforderungen für das Dezentrale kooperative Antennensystem ist Kanalschätzung für den Downlink Kanal besonders wenn FDD verwendet wird. Alle zugehörigen Basisstationen im genossenschaftlichen Bereich müssen die vollständige Kanal Informationen zu Wissen, die entsprechenden precoding Gewicht Matrix zu berechnen. Diese Information ist von mobilen Stationen übertragen werden Stationen mit Uplink Ressourcen zu stützen. Wird als mehrere Basisstationen und mehreren mobilen Stationen in kooperativen Antennensysteme und jede Basisstation und Mobilstation beteiligt sind, können mit mehreren Antennen ausgestattet sein, die Anzahl der Kanal Parameter wieder gefüttert werden erwartet, groß zu sein. In dieser Arbeit wird ein effizientes Feedback Techniken der downlink Kanal Informationen sind für die Multi-user Multiple Input Multiple Output Fall vorgeschlagen, der insbesondere auf verteilte kooperative Antennensysteme zielt. Zuerst wird ein Unterraum-basiertes Kanalquantisierungsverfahren vorgeschlagen, das ein vorbestimmtes Codebuch verwendet. Ein iterativer Codebuchentwurfsalgorithmus wird vorgeschlagen, der zu einem lokalen optimalen Codebuch konvergiert. Darüber hinaus werden Feedback-Overhead-Reduktionsverfahren entwickelt, die die zeitliche Korrelation des Kanals ausnutzen. Es wird gezeigt, dass das vorgeschlagene adaptive Codebuchverfahren in Verbindung mit einem Datenkomprimierungsschema eine Leistung nahe an dem perfekten Kanalfall erzielt, was viel weniger Rückkopplungsoverhead im Vergleich zu anderen Techniken erfordert. Das auf dem Unterraum basierende Kanalquantisierungsverfahren wird erweitert, indem mehrere Antennen auf der Senderseite und/oder auf der Empfängerseite eingeführt werden, und die Leistung eines Vorcodierungs- (/Decodierungs-) Schemas mit regulierter Blockdiagonalisierung (RBD) wurde untersucht. Es wird ein kosteneffizientes Decodierungsmatrixquantisierungsverfahren vorgeschlagen, dass eine komplexe Berechnung an der Mobilstation vermeiden kann, während es nur eine leichte Verschlechterung zeigt. Die Arbeit wird abgeschlossen, indem die vorgeschlagenen Feedback-Methoden hinsichtlich ihrer Leistung, ihres erforderlichen Feedback-Overheads und ihrer Rechenkomplexität verglichen werden.Cooperative antenna systems have recently become a hot research topic, as they promise significantly higher spectral efficiency than conventional cellular systems. The gain is acquired by eliminating inter-cell interference (ICI) through coordination of the base antenna transmissions. Recently, distributed organization methods have been suggested. One of the main challenges of the distributed cooperative antenna system is channel estimation for the downlink channel especially when FDD is used. All of the associated base stations in the cooperative area need to know the full channel state information to calculate the corresponding precoding weight matrix. This information has to be transferred from mobile stations to base stations by using uplink resources. As several base stations and several mobile stations are involved in cooperative antenna systems and each base station and mobile station may be equipped with multiple antennas, the number of channel state parameters to be fed back is expected to be big. In this thesis, efficient feedback techniques of the downlink channel state information are proposed for the multi-user multiple-input multiple-output case, targeting distributed cooperative antenna systems in particular. First, a subspace based channel quantization method is proposed which employs a predefined codebook. An iterative codebook design algorithm is proposed which converges to a local optimum codebook. Furthermore, feedback overhead reduction methods are devised exploiting temporal correlation of the channel. It is shown that the proposed adaptive codebook method in conjunction with a data compression scheme achieves a performance close to the perfect channel case, requiring much less feedback overhead compared with other techniques. The subspace based channel quantization method is extended by introducing multiple antennas at the transmitter side and/or at the receiver side and the performance of a regularized block diagonalization (RBD) precoding(/decoding) scheme has been investigated as well as a zero-forcing (ZF) precoding scheme. A cost-efficient decoding matrix quantization method is proposed which can avoid a complex computation at the mobile station while showing only a slight degradation. The thesis is concluded by comparing the proposed feedback methods in terms of their performance, their required feedback overhead, and their computational complexity. The techniques that are developed in this thesis can be useful and applicable for 5G, which is envisioned to support the high granularity/resolution codebook and its efficient deployment schemes. Keywords: MU-MIMO, COOPA, limited feedback, CSI, CQ, feedback overhead reduction, Givens rotatio

A Scheduling and Resource Allocation Algorithm for LTE Networks Using Tree Structures

Το σύστημα LTE σχεδιάστηκε από τη 3GPP με στόχο την ικανοποίηση των ολοένααυξανόμενων αναγκών για ασύρματη ευρυζωνική πρόσβαση. Τεχνικές όπως το σχήμα πολλαπλής πρόσβασης OFDMA, το MIMOκαι η Προσαρμοστική Διαμόρφωση και Κωδικοποίηση υιοθετήθηκαν προκειμένου να αυξήσουν τους επιτεύξιμους ρυθμούςμετάδοσης και να βελτιώσουν τη φασματική απόδοση. Ωστόσο, απαιτείται η ανάπτυξη εξελιγμένων αλγορίθμωνχρονοπρογραμματισμού προκειμένου να αξιοποιηθεί η πλήρης δυναμική αυτών των τεχνικών. Παρά το γεγονός ότι η 3GPPέχειπροτυποποιήσει πλήρως τη σηματοδοσία ελέγχου που απαιτείται για την εκτέλεση του χρονοπρογραμματισμού, οι αλγόριθμοι πουχρειάζεται να εκτελεστούν προκειμένου να ληφθούν αποδοτικές αποφάσεις έχουν αφεθεί στους κατασκευαστές για υλοποίηση.Ωςεκ τούτου, σημαντική ερευνητική προσπάθεια έχει καταβληθεί προς αυτή την κατεύθυνση και έχουν προταθεί αρκετοίαλγόριθμοιχρονοπρογραμματισμού. Το κύριο συμπέρασμα που εξάγεται από τη μελέτη της βιβλιογραφίας είναι ότι οχρονοπρογραμματισμόςσε ένα σύστημα πολλών φερουσών με τους περιορισμούς του LTE αποτελεί ένα πολυδιάστατο πρόβλημα.Ανάμεσα στις πολλέςδιαστάσεις του, αυτές που κυρίως λαμβάνονται υπόψη στους προτεινόμενους αλγορίθμους είναι ηρυθμαπόδοση, η δικαιοσύνη και η εξασφάλιση εγγυημένης ποιότητας υπηρεσίας.Η κύρια συμβολή της παρούσας διατριβής είναι η πρόταση ενός νέου αλγόριθμου χρονοπρογραμματισμού και διαχείρισης πόρων ο οποίος αντιμετωπίζει τα περισσότερα από τα θέματα που καθορίζουν τησυνολική απόδοση μίας οντότητας χρονοπρογραμματισμού του LTE. Η πρόταση εστιάζει κυρίως στην πολυπλοκότητα πουεισάγεται κατά τη λήψη μίας απόφασης χρονοπρογραμματισμού. Επιχειρεί δε να επιλύσει αυτό το πρόβλημα με την εισαγωγή μίαςεξελιγμένης δενδρικής δομής η οποία επιτρέπει την αποδοτική αποθήκευση όλων των παραμέτρων που θεωρούνται ουσιώδεις στηδιαδικασία λήψης μίας απόφασης χρονοπρογραμματισμού. Με αυτό τον τρόπο η οντότητα χρονοπρογραμματισμού έχει άμεσηπρόσβαση σε αυτές τις πληροφορίες. Στην εργασία περιγράφεται ένας πλήρης αλγόριθμος προγραμματισμού στο πεδίο τουχρόνου που αξιοποιεί αυτή τη δενδρική δομή και επιπλέον προτείνονται δύο νέοι αλγόριθμοι κατανομής πόρων. Οι αλγόριθμοιαυτοί επίσης αξιοποιούν κάποιες επιπρόσθετες δενδρικές δομές οι οποίες παράγονται ύστερα από κατάλληλη προ-επεξεργασίαπου λαμβάνει χώρα πριν τη λήψη της απόφασης χρονοπρογραμματισμού. Ο πρώτος αλγόριθμος παρουσιάζει χαμηλήπολυπλοκότητα και ικανοποιητική απόδοση ενώ ο δεύτερος βελτιωμένη απόδοση με το κόστος κάποιας επιπρόσθετηςπολυπλοκότητας. Αποτελέσματα εκτεταμένων προσομοιώσεων επιβεβαιώνουν την ικανότητα του προτεινόμενου σχήματος στηνικανοποίηση των αυστηρών απαιτήσεων του LTE σε ότι αφορά την ποιότητα υπηρεσίας, ενώ ταυτόχρονα η απόδοση τωνπροτεινόμενων αλγορίθμων συγκρίνεται με γνωστές τεχνικές χρονοπρογραμματισμού. Οι προτεινόμενες λύσεις είναι εφαρμόσιμες μόνο στην περίπτωση της κατωφερούς ζεύξης, ωστόσο η ίδια ιδέα μπορεί να προσαρμοστεί κατάλληλα για να παρέχει μία αποδοτική λύση και στην περίπτωση της ανωφερούς ζεύξηςLong Term Evolution (LTE) has been designed by 3GPP with the target to meet the ever increasing demands in broadband wireless access. Techniques such as OFDMA multiple access scheme, MIMO and Adaptive Modulation and Coding (AMC) have been adopted in order to boost the achieved data rates and improve spectral efficiency. However, the development of sophisticated scheduling algorithms is required so that the full potential of those techniques is exploited. Even though 3GPP has fully standardized the control signaling required to perform scheduling, the algorithms that need to be executed to make efficient decisions are left to vendor implementation. Therefore significant research effort has been dedicated to this direction and several scheduling algorithms have been proposed. The main conclusion drawn from the study of the literature is that scheduling in a multicarrier system with the restrictions of LTE constitutes a multidimensional problem. Among the multiple dimensions, those that are mostly considered in the proposed algorithms are throughput, fairness and QoS guarantee. The main contribution of this thesis is to propose a new scheduling algorithm that addresses most of the issues that define the overall performance of an LTE scheduler. The proposal focuses mainly on the complexity involved in making a scheduling decision. It attempts to resolve this issue by the introduction of a sophisticated tree structure that enables the efficient storage of all the parameters that are considered essential in the scheduling decision process. Thus the scheduler can have immediate access to this information. A full time domain scheduling algorithm that utilizes this tree structure is described and two new resource allocation algorithms are proposed. These algorithms also utilize some additional tree structures derived from appropriate preprocessing actions that take place before the actual scheduling decision. The first algorithm has low complexity and satisfactory performance while the second has improved performance with the cost of some additional complexity. Extensive simulation results confirm the capability of the proposed scheme in satisfying the strict QoS requirements of LTE, while the performance of the newly proposed algorithms is compared with well-known scheduling techniques. The proposed solutions are applicable to the downlink case, while the same concept may be adapted properly to provide an efficient solution for the uplink case

Cancelamento de interferência em sistemas celulares distribuídos

Doutoramento em Engenharia ElectrotécnicaO tema principal desta tese é o problema de cancelamento de interferência para sistemas multi-utilizador, com antenas distribuídas. Como tal, ao iniciar, uma visão geral das principais propriedades de um sistema de antenas distribuídas é apresentada. Esta descrição inclui o estudo analítico do impacto da ligação, dos utilizadores do sistema, a mais antenas distribuídas. Durante essa análise é demonstrado que a propriedade mais importante do sistema para obtenção do ganho máximo, através da ligação de mais antenas de transmissão, é a simetria espacial e que os utilizadores nas fronteiras das células são os mais bene ciados. Tais resultados são comprovados através de simulação. O problema de cancelamento de interferência multi-utilizador é considerado tanto para o caso unidimensional (i.e. sem codi cação) como para o multidimensional (i.e. com codi cação). Para o caso unidimensional um algoritmo de pré-codi cação não-linear é proposto e avaliado, tendo como objectivo a minimização da taxa de erro de bit. Tanto o caso de portadora única como o de multipla-portadora são abordados, bem como o cenário de antenas colocadas e distribuidas. É demonstrado que o esquema proposto pode ser visto como uma extensão do bem conhecido esquema de zeros forçados, cuja desempenho é provado ser um limite inferior para o esquema generalizado. O algoritmo é avaliado, para diferentes cenários, através de simulação, a qual indica desempenho perto do óptimo, com baixa complexidade. Para o caso multi-dimensional um esquema para efectuar "dirty paper coding" binário, tendo como base códigos de dupla camada é proposto. No desenvolvimento deste esquema, a compressão com perdas de informação, é considerada como um subproblema. Resultados de simulação indicam transmissão dedigna proxima do limite de Shannon.This thesis focus on the interference cancellation problem for multiuser distributed antenna systems. As such it starts by giving an overview of the main properties of a distributed antenna system. This overview includes, an analytical investigation of the impact of the connection of additional distributed antennas, to the system users. That analysis shows that the most important system property to reach the maximum gain, with the connection of additional transmit antennas, is spatial symmetry and that the users at the cell borders are the most bene ted. The multiuser interference problem has been considered for both the one dimensional (i.e. without coding) and multidimensional (i.e. with coding) cases. In the unidimensional case, we propose and evaluate a nonlinear precoding algorithm for the minimization of the bit-error-rate, of a multiuser MIMO system. Both the single-carrier and multi-carrier cases are tackled as well as the co-located and distributed scenarios. It is demonstrated that the proposed scheme can be viewed as an extension of the well-known zero-forcing, whose performance is proven to be a lower bound for the generalized scheme. The algorithm was validated extensively through numerical simulations, which indicate a performance close to the optimal, with reduced complexity. For the multi-dimensional case, a binary dirty paper coding scheme, base on bilayer codes, is proposed. In the development of this scheme, we consider the lossy compression of a binary source as a sub-problem. Simulation results indicate reliable transmission close to the Shannon limit

Transmission coopérative dans les réseaux sans-fil avec feedback distribué

Multiple-antenna based transmitter cooperation has been established as a promising tool towards avoiding, aligning, or shaping the interference resulting from aggressive spectral reuse. Although the impact of imperfect knowledge of the channel state information (CSI) is often investigated, it is usually assumed that the channel estimates are perfectly shared between all the transmitters. This assumption is however not adapted to many practical cases of transmitter cooperation between distant transmitters. Therefore, we focus in this thesis on the network scenario where the transmitters would like to cooperate in their transmission but can only imperfectly exchange on CSI which is acquired locally. This imperfect CSI sharing step gives rise to a CSI configuration, denoted as “distributed CSI”, where each transmitter has its own imperfect estimate of the global multi-user channel based on which it determines its transmit parameters. We study first the impact of having distributed CSI over the precoder design. Specifically, we show that conventional precoding schemes are not adapted to the distributed CSI configuration and lead to poor performance. We then turn to another aspect of this CSI configuration which is to determine “Who needs to know what", when it comes to CSI at cooperating transmitters. In contrast to the resource-hungry solution consisting in providing the same CSI to all transmitters, it is shown how a non-uniform spatial allocation of the CSI to the transmitters can provide strong gains depending on the networks topology.La coopération des transmetteurs dans les système multi-antennes a été reconnue comme un outil prometteur pour éviter ou aligner les interférences résultant d’une réutilisation agressive de la bande spectrale. Il est usuellement supposé que les estimées de canal sont parfaitement partagées entre tous les transmetteurs entrant en coopération, ce qui n’est pas adapté à de nombreuses situations où des émetteurs éloignés visent à coopérer. C’est pourquoi nous étudions le cas de réseaux sans-fil où des transmetteurs émettent d’une manière coopérative bien qu’ils ne puissent échanger que d’une manière imparfaite l’information de canal obtenue localement. Ce partage imparfait de l’information de canal donne lieu à une configuration d’information de canal, dénotée comme « distribuée », où chaque transmetteur reçoit une estimée du canal multi-utilisateurs qui lui est propre, à partir de laquelle il détermine ses paramètres de transmission. Nous étudions tout d’abord les conséquences de la configuration à information de canal distribuée sur le précodage. En particulier, nous mettons en évidence l’inefficacité des méthodes conventionnelles de précodage lorsque confrontées à une configuration à information de canal distribuée. Nous étudions ensuite une autre facette de ce scenario, qui est la détermination de « qui doit savoir quoi », lorsqu’il s’agit de l’information de canal disponible aux transmetteurs engagés dans la coopération. Il est démontré comment une allocation non-uniforme de l’information de canal aux transmetteurs peut donner lieu à des gains importants, en fonction de la géométrie du réseau considéré

A Survey on Security and Privacy of 5G Technologies: Potential Solutions, Recent Advancements, and Future Directions

Security has become the primary concern in many telecommunications industries today as risks can have high consequences. Especially, as the core and enable technologies will be associated with 5G network, the confidential information will move at all layers in future wireless systems. Several incidents revealed that the hazard encountered by an infected wireless network, not only affects the security and privacy concerns, but also impedes the complex dynamics of the communications ecosystem. Consequently, the complexity and strength of security attacks have increased in the recent past making the detection or prevention of sabotage a global challenge. From the security and privacy perspectives, this paper presents a comprehensive detail on the core and enabling technologies, which are used to build the 5G security model; network softwarization security, PHY (Physical) layer security and 5G privacy concerns, among others. Additionally, the paper includes discussion on security monitoring and management of 5G networks. This paper also evaluates the related security measures and standards of core 5G technologies by resorting to different standardization bodies and provide a brief overview of 5G standardization security forces. Furthermore, the key projects of international significance, in line with the security concerns of 5G and beyond are also presented. Finally, a future directions and open challenges section has included to encourage future research.European CommissionNational Research Tomsk Polytechnic UniversityUpdate citation details during checkdate report - A