922 research outputs found

    Analysis and Design of Non-Orthogonal Multiple Access (NOMA) Techniques for Next Generation Wireless Communication Systems

    Get PDF
    The current surge in wireless connectivity, anticipated to amplify significantly in future wireless technologies, brings a new wave of users. Given the impracticality of an endlessly expanding bandwidth, there’s a pressing need for communication techniques that efficiently serve this burgeoning user base with limited resources. Multiple Access (MA) techniques, notably Orthogonal Multiple Access (OMA), have long addressed bandwidth constraints. However, with escalating user numbers, OMA’s orthogonality becomes limiting for emerging wireless technologies. Non-Orthogonal Multiple Access (NOMA), employing superposition coding, serves more users within the same bandwidth as OMA by allocating different power levels to users whose signals can then be detected using the gap between them, thus offering superior spectral efficiency and massive connectivity. This thesis examines the integration of NOMA techniques with cooperative relaying, EXtrinsic Information Transfer (EXIT) chart analysis, and deep learning for enhancing 6G and beyond communication systems. The adopted methodology aims to optimize the systems’ performance, spanning from bit-error rate (BER) versus signal to noise ratio (SNR) to overall system efficiency and data rates. The primary focus of this thesis is the investigation of the integration of NOMA with cooperative relaying, EXIT chart analysis, and deep learning techniques. In the cooperative relaying context, NOMA notably improved diversity gains, thereby proving the superiority of combining NOMA with cooperative relaying over just NOMA. With EXIT chart analysis, NOMA achieved low BER at mid-range SNR as well as achieved optimal user fairness in the power allocation stage. Additionally, employing a trained neural network enhanced signal detection for NOMA in the deep learning scenario, thereby producing a simpler signal detection for NOMA which addresses NOMAs’ complex receiver problem

    Coverage Performance Analysis of Reconfigurable Intelligent Surface-aided Millimeter Wave Network with Blockage Effect

    Get PDF
    In order to solve spectrum resource shortage and satisfy immense wireless data traffic demands, millimeter wave (mmWave) frequency with large available bandwidth has been proposed for wireless communication in 5G and beyond 5G. However, mmWave communications are susceptible to blockages. This characteristic limits the network performance. Meanwhile, reconfigurable intelligent surface (RIS) has been proposed to improve the propagation environment and extend the network coverage. Unlike traditional wireless technologies that improve transmission quality from transceivers, RISs enhance network performance by adjusting the propagation environment. One of the promising applications of RISs is to provide indirect line-of-sight (LoS) paths when the direct LoS path between transceivers does not exist. This application makes RIS particularly useful in mmWave communications. With effective RIS deployment, the mmWave RIS-aided network performance can be enhanced significantly. However, most existing works have analyzed RIS-aided network performance without exploiting the flexibility of RIS deployment and/or considering blockage effect, which leaves huge research gaps in RIS-aided networks. To fill the gaps, this thesis develops RIS-aided mmWave network models considering blockage effect under the stochastic geometry framework. Three scenarios, i.e., indoor, outdoor and outdoor-to-indoor (O2I) RIS-aided networks, are investigated. Firstly, LoS propagation is hard to be guaranteed in indoor environments since blockages are densely distributed. Deploying RISs to assist mmWave transmission is a promising way to overcome this challenge. In the first paper, we propose an indoor mmWave RIS-aided network model capturing the characteristics of indoor environments. With a given base station (BS) density, whether deploying RISs or increasing BS density to further enhance the network coverage is more cost-effective is investigated. We present a coverage calculation algorithm which can be adapted for different indoor layouts. Then, we jointly analyze the network cost and coverage probability. Our results indicate that deploying RISs with an appropriate number of BSs is more cost-effective for achieving an adequate coverage probability than increasing BSs only. Secondly, for a given total number of passive elements, whether fewer large-scale RISs or more small-scale RISs should be deployed has yet to be investigated in the presence of the blockage effect. In the second paper, we model and analyze a 3D outdoor mmWave RIS-aided network considering both building blockages and human-body blockages. Based on the proposed model, the analytical upper and lower bounds of the coverage probability are derived. Meanwhile, the closed-form coverage probability when RISs are much closer to the UE than the BS is derived. In terms of coverage enhancement, we reveal that sparsely deployed large-scale RISs outperform densely deployed small-scale RISs in scenarios of sparse blockages and/or long transmission distances, while densely deployed small-scale RISs win in scenarios of dense blockages and/or short transmission distances. Finally, building envelope (the exterior wall of a building) makes outdoor mmWave BS difficult to communicate with indoor UE. Transmissive RISs with passive elements have been proposed to refract the signal when the transmitter and receiver are on the different side of the RIS. Similar to reflective RISs, the passive elements of a transmissive RIS can implement phase shifts and adjust the amplitude of the incident signals. By deploying transmissive RISs on the building envelope, it is feasible to implement RIS-aided O2I mmWave networks. In the third paper, we develop a 3D RIS-aided O2I mmWave network model with random indoor blockages. Based on the model, a closed-form coverage probability approximation considering blockage spatial correlation is derived, and multiple-RIS deployment strategies are discussed. For a given total number of RIS passive elements, the impact of blockage density, the number and locations of RISs on the coverage probability is analyzed. All the analytical results have been validated by Monte Carlo simulation. The observations from the result analysis provide guidelines for the future deployment of RIS-aided mmWave networks

    On Age-of-Information Aware Resource Allocation for Industrial Control-Communication-Codesign

    Get PDF
    Unter dem Überbegriff Industrie 4.0 wird in der industriellen Fertigung die zunehmende Digitalisierung und Vernetzung von industriellen Maschinen und Prozessen zusammengefasst. Die drahtlose, hoch-zuverlässige, niedrig-latente Kommunikation (engl. ultra-reliable low-latency communication, URLLC) – als Bestandteil von 5G gewährleistet höchste Dienstgüten, die mit industriellen drahtgebundenen Technologien vergleichbar sind und wird deshalb als Wegbereiter von Industrie 4.0 gesehen. Entgegen diesem Trend haben eine Reihe von Arbeiten im Forschungsbereich der vernetzten Regelungssysteme (engl. networked control systems, NCS) gezeigt, dass die hohen Dienstgüten von URLLC nicht notwendigerweise erforderlich sind, um eine hohe Regelgüte zu erzielen. Das Co-Design von Kommunikation und Regelung ermöglicht eine gemeinsame Optimierung von Regelgüte und Netzwerkparametern durch die Aufweichung der Grenze zwischen Netzwerk- und Applikationsschicht. Durch diese Verschränkung wird jedoch eine fundamentale (gemeinsame) Neuentwicklung von Regelungssystemen und Kommunikationsnetzen nötig, was ein Hindernis für die Verbreitung dieses Ansatzes darstellt. Stattdessen bedient sich diese Dissertation einem Co-Design-Ansatz, der beide Domänen weiterhin eindeutig voneinander abgrenzt, aber das Informationsalter (engl. age of information, AoI) als bedeutenden Schnittstellenparameter ausnutzt. Diese Dissertation trägt dazu bei, die Echtzeitanwendungszuverlässigkeit als Folge der Überschreitung eines vorgegebenen Informationsalterschwellenwerts zu quantifizieren und fokussiert sich dabei auf den Paketverlust als Ursache. Anhand der Beispielanwendung eines fahrerlosen Transportsystems wird gezeigt, dass die zeitlich negative Korrelation von Paketfehlern, die in heutigen Systemen keine Rolle spielt, für Echtzeitanwendungen äußerst vorteilhaft ist. Mit der Annahme von schnellem Schwund als dominanter Fehlerursache auf der Luftschnittstelle werden durch zeitdiskrete Markovmodelle, die für die zwei Netzwerkarchitekturen Single-Hop und Dual-Hop präsentiert werden, Kommunikationsfehlerfolgen auf einen Applikationsfehler abgebildet. Diese Modellierung ermöglicht die analytische Ableitung von anwendungsbezogenen Zuverlässigkeitsmetriken wie die durschnittliche Dauer bis zu einem Fehler (engl. mean time to failure). Für Single-Hop-Netze wird das neuartige Ressourcenallokationsschema State-Aware Resource Allocation (SARA) entwickelt, das auf dem Informationsalter beruht und die Anwendungszuverlässigkeit im Vergleich zu statischer Multi-Konnektivität um Größenordnungen erhöht, während der Ressourcenverbrauch im Bereich von konventioneller Einzelkonnektivität bleibt. Diese Zuverlässigkeit kann auch innerhalb eines Systems von Regelanwendungen, in welchem mehrere Agenten um eine begrenzte Anzahl Ressourcen konkurrieren, statistisch garantiert werden, wenn die Anzahl der verfügbaren Ressourcen pro Agent um ca. 10 % erhöht werden. Für das Dual-Hop Szenario wird darüberhinaus ein Optimierungsverfahren vorgestellt, das eine benutzerdefinierte Kostenfunktion minimiert, die niedrige Anwendungszuverlässigkeit, hohes Informationsalter und hohen durchschnittlichen Ressourcenverbrauch bestraft und so das benutzerdefinierte optimale SARA-Schema ableitet. Diese Optimierung kann offline durchgeführt und als Look-Up-Table in der unteren Medienzugriffsschicht zukünftiger industrieller Drahtlosnetze implementiert werden.:1. Introduction 1 1.1. The Need for an Industrial Solution . . . . . . . . . . . . . . . . . . . 3 1.2. Contributions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2. Related Work 7 2.1. Communications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 2.2. Control . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 2.3. Codesign . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 2.3.1. The Need for Abstraction – Age of Information . . . . . . . . 11 2.4. Dependability . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 2.5. Conclusions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 3. Deriving Proper Communications Requirements 17 3.1. Fundamentals of Control Theory . . . . . . . . . . . . . . . . . . . . 18 3.1.1. Sampling . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19 3.1.2. Performance Requirements . . . . . . . . . . . . . . . . . . . 21 3.1.3. Packet Losses and Delay . . . . . . . . . . . . . . . . . . . . . 22 3.2. Joint Design of Control Loop with Packet Losses . . . . . . . . . . . . 23 3.2.1. Method 1: Reduced Sampling . . . . . . . . . . . . . . . . . . 23 3.2.2. Method 2: Markov Jump Linear System . . . . . . . . . . . . . 25 3.2.3. Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 3.3. Focus Application: The AGV Use Case . . . . . . . . . . . . . . . . . . 31 3.3.1. Control Loop Model . . . . . . . . . . . . . . . . . . . . . . . 31 3.3.2. Control Performance Requirements . . . . . . . . . . . . . . . 33 3.3.3. Joint Modeling: Applying Reduced Sampling . . . . . . . . . . 34 3.3.4. Joint Modeling: Applying MJLS . . . . . . . . . . . . . . . . . 34 3.4. Conclusions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 41 4. Modeling Control-Communication Failures 43 4.1. Communication Assumptions . . . . . . . . . . . . . . . . . . . . . . 43 4.1.1. Small-Scale Fading as a Cause of Failure . . . . . . . . . . . . 44 4.1.2. Connectivity Models . . . . . . . . . . . . . . . . . . . . . . . 46 4.2. Failure Models . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 49 4.2.1. Single-hop network . . . . . . . . . . . . . . . . . . . . . . . . 49 4.2.2. Dual-hop network . . . . . . . . . . . . . . . . . . . . . . . . 51 4.3. Performance Metrics . . . . . . . . . . . . . . . . . . . . . . . . . . . 54 4.3.1. Mean Time to Failure . . . . . . . . . . . . . . . . . . . . . . . 54 4.3.2. Packet Loss Ratio . . . . . . . . . . . . . . . . . . . . . . . . . 55 4.3.3. Average Number of Assigned Channels . . . . . . . . . . . . . 57 4.3.4. Age of Information . . . . . . . . . . . . . . . . . . . . . . . . 57 4.4. Conclusions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 58 5. Single Hop – Single Agent 61 5.1. State-Aware Resource Allocation . . . . . . . . . . . . . . . . . . . . 61 5.2. Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 64 5.3. Erroneous Acknowledgments . . . . . . . . . . . . . . . . . . . . . . 67 5.4. Conclusions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 70 6. Single Hop – Multiple Agents 71 6.1. Failure Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 72 6.1.1. Admission Control . . . . . . . . . . . . . . . . . . . . . . . . 72 6.1.2. Transition Probabilities . . . . . . . . . . . . . . . . . . . . . . 73 6.1.3. Computational Complexity . . . . . . . . . . . . . . . . . . . 74 6.1.4. Performance Metrics . . . . . . . . . . . . . . . . . . . . . . . 75 6.2. Illustration Scenario . . . . . . . . . . . . . . . . . . . . . . . . . . . 76 6.3. Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 78 6.3.1. Verification through System-Level Simulation . . . . . . . . . 78 6.3.2. Applicability on the System Level . . . . . . . . . . . . . . . . 79 6.3.3. Comparison of Admission Control Schemes . . . . . . . . . . 80 6.3.4. Impact of the Packet Loss Tolerance . . . . . . . . . . . . . . . 82 6.3.5. Impact of the Number of Agents . . . . . . . . . . . . . . . . . 84 6.3.6. Age of Information . . . . . . . . . . . . . . . . . . . . . . . . 84 6.3.7. Channel Saturation Ratio . . . . . . . . . . . . . . . . . . . . 86 6.3.8. Enforcing Full Channel Saturation . . . . . . . . . . . . . . . 86 6.4. Conclusions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 88 7. Dual Hop – Single Agent 91 7.1. State-Aware Resource Allocation . . . . . . . . . . . . . . . . . . . . 91 7.2. Optimization Targets . . . . . . . . . . . . . . . . . . . . . . . . . . . 92 7.3. Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 95 7.3.1. Extensive Simulation . . . . . . . . . . . . . . . . . . . . . . . 96 7.3.2. Non-Integer-Constrained Optimization . . . . . . . . . . . . . 98 7.4. Conclusions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 101 8. Conclusions and Outlook 105 8.1. Key Results and Conclusions . . . . . . . . . . . . . . . . . . . . . . . 105 8.2. Future Work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 107 A. DC Motor Model 111 Bibliography 113 Publications of the Author 127 List of Figures 129 List of Tables 131 List of Operators and Constants 133 List of Symbols 135 List of Acronyms 137 Curriculum Vitae 139In industrial manufacturing, Industry 4.0 refers to the ongoing convergence of the real and virtual worlds, enabled through intelligently interconnecting industrial machines and processes through information and communications technology. Ultrareliable low-latency communication (URLLC) is widely regarded as the enabling technology for Industry 4.0 due to its ability to fulfill highest quality-of-service (QoS) comparable to those of industrial wireline connections. In contrast to this trend, a range of works in the research domain of networked control systems have shown that URLLC’s supreme QoS is not necessarily required to achieve high quality-ofcontrol; the co-design of control and communication enables to jointly optimize and balance both quality-of-control parameters and network parameters through blurring the boundary between application and network layer. However, through the tight interlacing, this approach requires a fundamental (joint) redesign of both control systems and communication networks and may therefore not lead to short-term widespread adoption. Therefore, this thesis instead embraces a novel co-design approach which keeps both domains distinct but leverages the combination of control and communications by yet exploiting the age of information (AoI) as a valuable interface metric. This thesis contributes to quantifying application dependability as a consequence of exceeding a given peak AoI with the particular focus on packet losses. The beneficial influence of negative temporal packet loss correlation on control performance is demonstrated by means of the automated guided vehicle use case. Assuming small-scale fading as the dominant cause of communication failure, a series of communication failures are mapped to an application failure through discrete-time Markov models for single-hop (e.g, only uplink or downlink) and dual-hop (e.g., subsequent uplink and downlink) architectures. This enables the derivation of application-related dependability metrics such as the mean time to failure in closed form. For single-hop networks, an AoI-aware resource allocation strategy termed state-aware resource allocation (SARA) is proposed that increases the application reliability by orders of magnitude compared to static multi-connectivity while keeping the resource consumption in the range of best-effort single-connectivity. This dependability can also be statistically guaranteed on a system level – where multiple agents compete for a limited number of resources – if the provided amount of resources per agent is increased by approximately 10 %. For the dual-hop scenario, an AoI-aware resource allocation optimization is developed that minimizes a user-defined penalty function that punishes low application reliability, high AoI, and high average resource consumption. This optimization may be carried out offline and each resulting optimal SARA scheme may be implemented as a look-up table in the lower medium access control layer of future wireless industrial networks.:1. Introduction 1 1.1. The Need for an Industrial Solution . . . . . . . . . . . . . . . . . . . 3 1.2. Contributions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2. Related Work 7 2.1. Communications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 2.2. Control . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 2.3. Codesign . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 2.3.1. The Need for Abstraction – Age of Information . . . . . . . . 11 2.4. Dependability . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 2.5. Conclusions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 3. Deriving Proper Communications Requirements 17 3.1. Fundamentals of Control Theory . . . . . . . . . . . . . . . . . . . . 18 3.1.1. Sampling . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19 3.1.2. Performance Requirements . . . . . . . . . . . . . . . . . . . 21 3.1.3. Packet Losses and Delay . . . . . . . . . . . . . . . . . . . . . 22 3.2. Joint Design of Control Loop with Packet Losses . . . . . . . . . . . . 23 3.2.1. Method 1: Reduced Sampling . . . . . . . . . . . . . . . . . . 23 3.2.2. Method 2: Markov Jump Linear System . . . . . . . . . . . . . 25 3.2.3. Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 3.3. Focus Application: The AGV Use Case . . . . . . . . . . . . . . . . . . 31 3.3.1. Control Loop Model . . . . . . . . . . . . . . . . . . . . . . . 31 3.3.2. Control Performance Requirements . . . . . . . . . . . . . . . 33 3.3.3. Joint Modeling: Applying Reduced Sampling . . . . . . . . . . 34 3.3.4. Joint Modeling: Applying MJLS . . . . . . . . . . . . . . . . . 34 3.4. Conclusions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 41 4. Modeling Control-Communication Failures 43 4.1. Communication Assumptions . . . . . . . . . . . . . . . . . . . . . . 43 4.1.1. Small-Scale Fading as a Cause of Failure . . . . . . . . . . . . 44 4.1.2. Connectivity Models . . . . . . . . . . . . . . . . . . . . . . . 46 4.2. Failure Models . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 49 4.2.1. Single-hop network . . . . . . . . . . . . . . . . . . . . . . . . 49 4.2.2. Dual-hop network . . . . . . . . . . . . . . . . . . . . . . . . 51 4.3. Performance Metrics . . . . . . . . . . . . . . . . . . . . . . . . . . . 54 4.3.1. Mean Time to Failure . . . . . . . . . . . . . . . . . . . . . . . 54 4.3.2. Packet Loss Ratio . . . . . . . . . . . . . . . . . . . . . . . . . 55 4.3.3. Average Number of Assigned Channels . . . . . . . . . . . . . 57 4.3.4. Age of Information . . . . . . . . . . . . . . . . . . . . . . . . 57 4.4. Conclusions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 58 5. Single Hop – Single Agent 61 5.1. State-Aware Resource Allocation . . . . . . . . . . . . . . . . . . . . 61 5.2. Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 64 5.3. Erroneous Acknowledgments . . . . . . . . . . . . . . . . . . . . . . 67 5.4. Conclusions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 70 6. Single Hop – Multiple Agents 71 6.1. Failure Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 72 6.1.1. Admission Control . . . . . . . . . . . . . . . . . . . . . . . . 72 6.1.2. Transition Probabilities . . . . . . . . . . . . . . . . . . . . . . 73 6.1.3. Computational Complexity . . . . . . . . . . . . . . . . . . . 74 6.1.4. Performance Metrics . . . . . . . . . . . . . . . . . . . . . . . 75 6.2. Illustration Scenario . . . . . . . . . . . . . . . . . . . . . . . . . . . 76 6.3. Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 78 6.3.1. Verification through System-Level Simulation . . . . . . . . . 78 6.3.2. Applicability on the System Level . . . . . . . . . . . . . . . . 79 6.3.3. Comparison of Admission Control Schemes . . . . . . . . . . 80 6.3.4. Impact of the Packet Loss Tolerance . . . . . . . . . . . . . . . 82 6.3.5. Impact of the Number of Agents . . . . . . . . . . . . . . . . . 84 6.3.6. Age of Information . . . . . . . . . . . . . . . . . . . . . . . . 84 6.3.7. Channel Saturation Ratio . . . . . . . . . . . . . . . . . . . . 86 6.3.8. Enforcing Full Channel Saturation . . . . . . . . . . . . . . . 86 6.4. Conclusions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 88 7. Dual Hop – Single Agent 91 7.1. State-Aware Resource Allocation . . . . . . . . . . . . . . . . . . . . 91 7.2. Optimization Targets . . . . . . . . . . . . . . . . . . . . . . . . . . . 92 7.3. Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 95 7.3.1. Extensive Simulation . . . . . . . . . . . . . . . . . . . . . . . 96 7.3.2. Non-Integer-Constrained Optimization . . . . . . . . . . . . . 98 7.4. Conclusions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 101 8. Conclusions and Outlook 105 8.1. Key Results and Conclusions . . . . . . . . . . . . . . . . . . . . . . . 105 8.2. Future Work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 107 A. DC Motor Model 111 Bibliography 113 Publications of the Author 127 List of Figures 129 List of Tables 131 List of Operators and Constants 133 List of Symbols 135 List of Acronyms 137 Curriculum Vitae 13

    Secondary Network Throughput Optimization of NOMA Cognitive Radio Networks Under Power and Secure Constraints

    Get PDF
    Recently, the combination of cognitive radio networks with the nonorthogonal multiple access (NOMA) approach has emerged as a viable option for not only improving spectrum usage but also supporting large numbers of wireless communication connections. However, cognitive NOMA networks are unstable and vulnerable because multiple devices operate on the same frequency band. To overcome this drawback, many techniques have been proposed, such as optimal power allocation and interference cancellation. In this paper, we consider an approach by which the secondary transmitter (STx) is able to find the best licensed channel to send its confidential message to the secondary receivers (SRxs) by using the NOMA technique. To combat eavesdroppers and achieve reasonable performance, a power allocation policy that satisfies both the outage probability (OP) constraint of primary users and the security constraint of secondary users is optimized. The closed-form formulas for the OP at the primary base station and the leakage probability for the eavesdropper are obtained with imperfect channel state information. Furthermore, the throughput of the secondary network is analyzed to evaluate the system performance. Based on that, two algorithms (i.e., the continuous genetic algorithm (CGA) for CR NOMA (CGA-CRN) and particle swarm optimization (PSO) for CR NOMA (PSO-CRN)), are applied to optimize the throughput of the secondary network. These optimization algorithms guarantee not only the performance of the primary users but also the security constraints of the secondary users. Finally, simulations are presented to validate our research results and provide insights into how various factors affect system performance

    Secondary Network Throughput Optimization of NOMA Cognitive Radio Networks Under Power and Secure Constraints

    Get PDF
    Recently, the combination of cognitive radio networks with the nonorthogonal multiple access (NOMA) approach has emerged as a viable option for not only improving spectrum usage but also supporting large numbers of wireless communication connections. However, cognitive NOMA networks are unstable and vulnerable because multiple devices operate on the same frequency band. To overcome this drawback, many techniques have been proposed, such as optimal power allocation and interference cancellation. In this paper, we consider an approach by which the secondary transmitter (STx) is able to find the best licensed channel to send its confidential message to the secondary receivers (SRxs) by using the NOMA technique. To combat eavesdroppers and achieve reasonable performance, a power allocation policy that satisfies both the outage probability (OP) constraint of primary users and the security constraint of secondary users is optimized. The closed-form formulas for the OP at the primary base station and the leakage probability for the eavesdropper are obtained with imperfect channel state information. Furthermore, the throughput of the secondary network is analyzed to evaluate the system performance. Based on that, two algorithms (i.e., the continuous genetic algorithm (CGA) for CR NOMA (CGA-CRN) and particle swarm optimization (PSO) for CR NOMA (PSO-CRN)), are applied to optimize the throughput of the secondary network. These optimization algorithms guarantee not only the performance of the primary users but also the security constraints of the secondary users. Finally, simulations are presented to validate our research results and provide insights into how various factors affect system performance

    Machine Learning Empowered Reconfigurable Intelligent Surfaces

    Get PDF
    Reconfigurable intelligent surfaces (RISs) or known as intelligent reflecting surfaces (IRSs) have emerged as potential auxiliary equipment for future wireless networks, which attracts extensive research interest in their characteristics, applications, and potential. RIS is a panel surface equipped with a number of reflective elements, which can artificially modify the propagation environment of the electrogenic signals. Specifically, RISs have the ability to precisely adjust the propagation direction, amplitude, and phase-shift of the signals, providing users with a set of cascaded channels in addition to direct channels, and thereby improving the communication performances for users. Compared with other candidate technologies such as active relays, RIS has advantages in terms of flexible deployment, economical cost, and high energy efficiency. Thus, RISs have been considered a potential candidate technique for future wireless networks. In this thesis, a wireless network paradigm for the sixth generation (6G) wireless networks is proposed, where RISs are invoked to construct smart radio environments (SRE) to enhance communication performances for mobile users. In addition, beyond the conventional reselecting-only RIS, a novel model of RIS is originally proposed, namely, simultaneous transmitting and reflecting reconfigurable intelligent surface (STAR-RIS). The STAR-RIS splits the incident signal into transmitted and reflected signals, making full utilization of them to generate 360360^{\circ} coverage around the STAR-RIS panel, improving the coverage of the RIS. In order to fully exert the channel domination and beamforming ability of the RISs and STAR-RSIs to construct SREs, several machine learning algorithms, including deep learning (DL), deep reinforcement learning (DRL), and federated learning (FL) approaches are developed to optimize the communication performance in respect of sum data rate or energy efficiency for the RIS-assisted networks. Specifically, several problems are investigated including 1) the passive beamforming problem of the RIS with consideration of configuration overhead is resolved by a DL and a DRL algorithm, where the time overhead of configuration of RIS is successfully reduced by the machine learning algorithms. Consequently, the throughput during a time frame improved 95.2%95.2\% by invoking the proposed algorithms; 2) a novel framework of mobile RISs-enhanced indoor wireless networks is proposed, and a FL enhanced DRL algorithm is proposed for the deployment and beamforming optimization of the RIS. The average throughput of the indoor users severed by the mobile RIS is improved 15.1%15.1\% compared to the case of conventional fixed RIS; 3) A STAR-RIS assisted multi-user downlink multiple-input single-output (MISO) communication system is investigated, and a pair of hybrid reinforcement learning algorithms are proposed for the hybrid control of the transmitting and reflecting beamforming of the STAR-RIS, which ameliorate 7%7\% of the energy efficiency of the STAR-RIS assisted networks; 4) A tile-based low complexity beamforming approach is proposed for STAR-RISs, and the proposed tile-based beamforming approach is capable of achieving homogeneous data rate performance with element-based beamforming with appreciable lower complexity. By designing and operating the computer simulation, this thesis demonstrated 1) the performance gain in terms of sum data rate or energy efficiency by invoking the proposed RIS in the wireless communication networks; 2) the data rate or energy efficient performance gain of the proposed STAR-RIS compared to the existing reflecting-only RIS; 3) the effect of the proposed machine learning algorithms in terms of convergence rate, optimality, and complexity compared to the benchmarks of existing algorithms

    A Study on Three Dimensional Spatial Scattering Modulation Systems

    Get PDF
    With an explosive growth of data traffic demand, the researchers of the mobile communication era forecast that the traffic volume will have a 1000x increase in the forthcoming beyond fifth generation (B5G) network. To satisfy the growing traffic demand, the three-dimensional (3-D) multiple-input-and-multiple-output (MIMO) system is considered as a key technology to enhance spectrum efficiency (SE), which explores degrees of freedom in both the vertical and the horizontal dimensions. Combined with 3-D MIMO technology, index modulation (IM) is proposed to improve both energy efficiency (EE) and SE in the B5G era. Existing IM technologies can be categorized according to the domain in which the additional IM bits are modulated, e.g., the spatial-domain IM, the frequency-domain IM and the beamspace-domain IM etc. As one of the mainstream IM techniques, spatial scattering modulation (SSM) is proposed, which works in the beamspace-domain. For SSM systems, the information bits are denoted by the distinguishable signal scattering paths and the modulated symbols. Therein, two information bit streams are transmitted simultaneously by selections of modulated symbols and scattering paths. However, the existing papers only discuss two-dimensional (2-D) SSM systems. The 2-D SSM system applies linear antenna arrays, which only take the azimuth angles to recognise the direction of scattering paths. Therefore, to take the full advantage of the beamspace-domain resources, this thesis mainly focuses on the 3-D SSM system design and the performance evaluation. Firstly, a novel 3-D SSM system is designed. For the 3-D SSM system, besides the azimuth angles of arrival (AoA) and angles of departure (AoD), the elevation AoA and AoD are considered. Then the optimum detection algorithm is obtained, and the closed-form union upper bound expression on average bit error probability (ABEP) is derived. Moreover, the system performance is evaluated under a typical indoor environment. Numerical results indicate that the novel 3-D SSM system outperforms the conventional 2-D SSM system, which reduces the ABEP by 10 times with the same signal-to-noise ratio (SNR) level under the typical indoor environment. Secondly, for the system equipped with large-scale antenna arrays, hybrid beamforming schemes with several RF-chains have attracted more attention. To further explore the throughput of the 3-D SSM system, a generalised 3-D SSM system is proposed, which generates several RF-chains in a transmission time slot to convey modulated symbols. A system model of generalised 3-D SSM is proposed at first. Then an optimum detection algorithm is designed. Meanwhile, a closed-form expression of the ABEP is also derived and validated by Monte-Carlo simulation. For the performance evaluation, three stochastic propagation environments with randomly distributed scatterers are adopted. The results reveal that the generalised 3-D SSM system has better ABEP performance compared with the system with a single RF-chain. Considering different propagation environments, the SSM system has better ABEP performance under the statical propagation environments than the stochastic propagation environments. Thirdly, to reduce the hardware and computational complexities, two optimisation schemes are proposed for the generalised 3-D SSM systems. The 2-D fast Fourier transform (FFT) based transceivers are designed to improve the hardware friendliness, which replace the analogue phase shift networks by the multi-bit phase shifter networks. To reduce the computational complexity of the optimum detection algorithm, a low-complexity detection scheme is designed based on the linear minimum mean square error (MMSE) algorithm. Meanwhile, to quickly evaluate, the asymptotic ABEP performance and the diversity gain of the generalised 3-D SSM system are obtained

    The Interplay between Computation and Communication

    Get PDF
    In this thesis, a comprehensive exploration into the integration of communication and learning within the massive Internet of Things (mIoT) is undertaken. Addressing one of the fundamental challenges of mIoT, where traditional channel estimation methods prove inefficient due to high device density and short packets; initially, a novel approach leveraging unsupervised machine learning for joint channel estimation and signal detection is proposed. This technique utilizes the Gaussian mixture model (GMM) clustering of received signals, thereby reducing the necessity for exhaustive channel estimation, decreasing the number of required pilot symbols, and enhancing symbol error rate (SER) performance. Building on this foundation, an innovative method is proposed that eliminates the need for pilot symbols entirely. By coupling GMM clustering with rotational invariant (RI) coding, the model maintains robust performance against the effects of channel rotation, thereby improving the efficiency of mIoT systems. This research delves further into integrating communication and learning in mIoT, specifically focusing on federated learning (FL) convergence under error-prone conditions. It carefully analyzes the impact of factors like block length, coding rate, and signal-to-noise ratio on FL's accuracy and convergence. A novel approach is proposed to address communication error challenges, where the base station (BS) uses memory to cache key parameters. Closing the thesis, an extensive simulation of a real-world mIoT system, integrating previously developed techniques, such as the innovative channel estimation method, RI coding, and the introduced FL model. It notably demonstrates that optimal learning outcomes can be achieved even without stringent communication reliability. Thus, this work not only achieves comparable or superior performance to traditional methods with fewer pilot symbols but also provides valuable insights for optimizing mIoT systems within the FL framework

    Security-Reliability Tradeoffs for Satellite-Terrestrial Relay Networks with a Friendly Jammer and Imperfect CSI

    Get PDF
    peer reviewedThis article proposes and analyzes the reliability and security tradeoff for a satellite-terrestrial (SatTer) relay system. Herein, a satellite sends confidential information to multiple ground users with the help of a relay base station (BS) in the presence of multiple eavesdroppers trying to wiretap the information. In particular, a friendly jammer is deployed near the relay BS to improve secure transmissions. Moreover, the nonidentical Rayleigh fading channels and imperfect channel state information are adopted for a general system model. Then, we consider both amplify-and-forward (AF) and decode-and-forward (DF) relaying strategies to give a full picture of the benefits of each method. In this context, we derive the closed-form expressions of the outage probability and intercept probability corresponding to AF- and DF-based relaying schemes, which is a high challenge and has not been investigated before. Then, Monte-Carlo simulations are conducted to evaluate the correctness of the mathematical analysis and the effectiveness of the proposed methods. Furthermore, the security and reliability trade-off of the SatTer system and the influences of various system parameters (e.g., satellite's transmit power, channel estimation errors, relay's transmit power, fading severity parameter, the average power of light-of-sight, and satellite's multipath components) on the system performance are shown
    corecore