Rate-splitting multiple access for non-terrestrial communication and sensing networks

Rate-splitting multiple access (RSMA) has emerged as a powerful and flexible non-orthogonal transmission, multiple access (MA) and interference management scheme for future wireless networks. This thesis is concerned with the application of RSMA to non-terrestrial communication and sensing networks. Various scenarios and algorithms are presented and evaluated. First, we investigate a novel multigroup/multibeam multicast beamforming strategy based on RSMA in both terrestrial multigroup multicast and multibeam satellite systems with imperfect channel state information at the transmitter (CSIT). The max-min fairness (MMF)-degree of freedom (DoF) of RSMA is derived and shown to provide gains compared with the conventional strategy. The MMF beamforming optimization problem is formulated and solved using the weighted minimum mean square error (WMMSE) algorithm. Physical layer design and link-level simulations are also investigated. RSMA is demonstrated to be very promising for multigroup multicast and multibeam satellite systems taking into account CSIT uncertainty and practical challenges in multibeam satellite systems. Next, we extend the scope of research from multibeam satellite systems to satellite- terrestrial integrated networks (STINs). Two RSMA-based STIN schemes are investigated, namely the coordinated scheme relying on CSI sharing and the co- operative scheme relying on CSI and data sharing. Joint beamforming algorithms are proposed based on the successive convex approximation (SCA) approach to optimize the beamforming to achieve MMF amongst all users. The effectiveness and robustness of the proposed RSMA schemes for STINs are demonstrated. Finally, we consider RSMA for a multi-antenna integrated sensing and communications (ISAC) system, which simultaneously serves multiple communication users and estimates the parameters of a moving target. Simulation results demonstrate that RSMA is beneficial to both terrestrial and multibeam satellite ISAC systems by evaluating the trade-off between communication MMF rate and sensing Cramer-Rao bound (CRB).Open Acces

A Survey on Applications of Cache-Aided NOMA

Contrary to orthogonal multiple-access (OMA), non-orthogonal multiple-access (NOMA) schemes can serve a pool of users without exploiting the scarce frequency or time domain resources. This is useful in meeting the future network requirements (5G and beyond systems), such as, low latency, massive connectivity, users' fairness, and high spectral efficiency. On the other hand, content caching restricts duplicate data transmission by storing popular contents in advance at the network edge which reduces data traffic. In this survey, we focus on cache-aided NOMA-based wireless networks which can reap the benefits of both cache and NOMA; switching to NOMA from OMA enables cache-aided networks to push additional files to content servers in parallel and improve the cache hit probability. Beginning with fundamentals of the cache-aided NOMA technology, we summarize the performance goals of cache-aided NOMA systems, present the associated design challenges, and categorize the recent related literature based on their application verticals. Concomitant standardization activities and open research challenges are highlighted as well

Potentzia domeinuko NOMA 5G sareetarako eta haratago

Tesis inglés 268 p. -- Tesis euskera 274 p.During the last decade, the amount of data carried over wireless networks has grown exponentially. Several reasons have led to this situation, but the most influential ones are the massive deployment of devices connected to the network and the constant evolution in the services offered. In this context, 5G targets the correct implementation of every application integrated into the use cases. Nevertheless, the biggest challenge to make ITU-R defined cases (eMBB, URLLC and mMTC) a reality is the improvement in spectral efficiency. Therefore, in this thesis, a combination of two mechanisms is proposed to improve spectral efficiency: Non-Orthogonal Multiple Access (NOMA) techniques and Radio Resource Management (RRM) schemes. Specifically, NOMA transmits simultaneously several layered data flows so that the whole bandwidth is used throughout the entire time to deliver more than one service simultaneously. Then, RRM schemes provide efficient management and distribution of radio resources among network users. Although NOMA techniques and RRM schemes can be very advantageous in all use cases, this thesis focuses on making contributions in eMBB and URLLC environments and proposing solutions to communications that are expected to be relevant in 6G

Wireless social networks: a survey of recent advances, applications and challenges

With the ubiquitous use of smartphones and other connected pieces of equipment, the number of devices connected to the Internet is exponentially growing. This will test the efficiency of the envisioned 5G network architectures for data acquisition and its storage. It is a common observation that the communication between smart devices is typically influenced by their social relationship. This suggests that the theory of social networks can be leveraged to improve the quality of service for such communication links. In fact, the social networking concepts of centrality and community have been investigated for an efficient realization of novel wireless network architectures. This work provides a comprehensive introduction to social networks and reviews the recent literature on the application of social networks in wireless communications. The potential challenges in communication network design are also highlighted, for a successful implementation of social networking strategies. Finally, some future directions are discussed for the application of social networking strategies to emerging wireless technologies such as non-orthogonal multiple access and visible light communications

Characterisation and performance analysis of random linear network coding for reliable and secure communication

In this thesis, we develop theoretical frameworks to characterize the performance of Random Linear Network Coding (RLNC), and propose novel communication schemes for the achievement of both reliability and security in wireless networks. In particular, (i) we present an analytical model to evaluate the performance of practical RLNC schemes suitable for low-complexity receivers, prioritized (i.e., layered) coding and multi-hop communications, (ii) investigate the performance of RLNC in relay assisted networks and propose a new cross-layer RLNC-aided cooperative scheme for reliable communication, (iii) characterize the secrecy feature of RLNC and propose a new physical-application layer security technique for the purpose of achieving security and reliability in multi-hope communications. At first, we investigate random block matrices and derive mathematical expressions for the enumeration of full-rank matrices that contain blocks of random entries arranged in a diagonal, lower-triangular or tri-diagonal structure. The derived expressions are then used to model the probability that a receiver will successfully decode a source message or layers of a service, when RLNC based on non-overlapping, expanding or sliding generations is employed. Moreover, the design parameters of these schemes allow to adjust the desired decoding performance. Next, we evaluate the performance of Random Linear Network Coded Cooperation (RLNCC) in relay assisted networks, and propose a cross-layer cooperative scheme which combines the emerging Non-Orthogonal Multiple Access (NOMA) technique and RLNCC. In this regard, we first consider the multiple-access relay channel in a setting where two source nodes transmit packets to a destination node, both directly and via a relay node. Secondly, we consider a multi-source multi-relay network, in which relay nodes employ RLNC on source packets and generate coded packets. For each network, we build our analysis on fundamental probability expressions for random matrices over finite fields and we derive theoretical expressions of the probability that the destination node will successfully decode the source packets. Finally, we consider a multi-relay network comprising of two groups of source nodes, where each group transmits packets to its own designated destination node over single-hop links and via a cluster of relay nodes shared by both groups. In an effort to boost reliability without sacrificing throughput, a scheme is proposed whereby packets at the relay nodes are combined using two methods; packets delivered by different groups are mixed using non-orthogonal multiple access principles, while packets originating from the same group are mixed using RLNC. An analytical framework that characterizes the performance of the proposed scheme is developed, and benchmarked against a counterpart scheme that is based on orthogonal multiple access. Finally, we quantify and characterize the intrinsic security feature of RLNC and design a joint physical-application layer security technique. For this purpose, we first consider a network comprising a transmitter, which employs RLNC to encode a message, a legitimate receiver, and a passive eavesdropper. Closed-form analytical expressions are derived to evaluate the intercept probability of RLNC, and a resource allocation model is presented to further minimize the intercept probability. Afterward, we propose a joint RLNC and opportunistic relaying scheme in a multi relay network to transmit confi- dential data to a destination in the presence of an eavesdropper. Four relay selection protocols are studied covering a range of network capabilities, such as the availability of the eavesdropper’s channel state information or the possibility to pair the selected relay with a jammer node that intentionally generates interference. For each case, expressions of the probability that a coded packet will not be decoded by a receiver, which can be either the destination or the eavesdropper, are derived. Based on those expressions, a framework is developed that characterizes the probability of the eavesdropper intercepting a sufficient number of coded packets and partially or fully decoding the confidential data. We observe that the field size over which RLNC is performed at the application layer as well as the adopted modulation and coding scheme at the physical layer can be modified to fine-tune the trade-off between security and reliability