Massive Connectivity: Non-Orthogonal Multiple Access to High Performance Random Access

ISBN-13: 9781119772774 / Angielski / Twarda / 2022 / 192 str.

Jun-Bae Seo

Spis treści

Preface xiii1 Introduction 11.1 Machine-Type Communication 11.2 Non-Orthogonal Multiple Access 31.3 NOMA for MTC 41.4 An Overview of Probability and Random Processes 61.4.1 Review of Probability 61.4.2 Random Variables 71.4.3 Random Processes 141.4.4 Markov Chains 152 Single-User and Multiuser Systems 192.1 A Single-User System 192.1.1 Signal Representation 202.1.2 Transmission of Signal Sequences 212.1.3 ML Decoding 232.1.4 ML Decoding over Fading Channels 262.1.5 Achievable Rate 282.2 Multiuser Systems 332.2.1 Broadcast Channels 342.2.2 Multiple Access Channels 372.3 Further Reading 413 OMA and NOMA 433.1 Orthogonal Multiple Access 433.1.1 Time Division Multiple Access 433.1.2 Frequency Division Multiple Access 463.1.3 Orthogonal Frequency Division Multiple Access 473.2 Non-Orthogonal Multiple Access 513.2.1 Downlink NOMA 523.2.2 Uplink NOMA 573.3 Power and Rate Allocation 603.3.1 System with Known Instantaneous CSI 603.3.2 System with Unknown Instantaneous CSI 673.4 Code Division Multiple Access 733.4.1 DS-CDMA 743.4.2 Multiuser Detection Approaches 783.5 Further Reading 844 Random Access Systems 874.1 ALOHA Systems 884.1.1 Single Channel Random Access 884.1.2 Multi-Channel S-ALOHA 904.2 Throughput Analysis 914.2.1 Pure ALOHA 914.2.2 Slotted ALOHA 924.2.3 Multichannel ALOHA 944.3 Analysis with a Finite Number of Users 984.3.1 A Markov Chain 984.3.2 Drift Analysis 1004.4 Analysis with an Infinite Number of Users 1024.4.1 Constant Re-transmission Probability 1024.4.2 Adaptive Re-transmission Probability 1044.5 Fast Retrial 1074.6 Multiuser Detection 1084.6.1 Compressive Random Access 1084.6.2 Throughput Analysis 1104.7 Further Reading 1145 NOMA-based Random Access 1175.1 NOMA to Random Access 1175.1.1 S-ALOHA with NOMA 1185.1.2 More Power Levels 1225.2 Multichannel ALOHA with NOMA 1275.2.1 Multichannel ALOHA with NOMA and Throughput Analysis 1285.2.2 Channel-Dependent Selection 1325.3 Opportunistic NOMA 1375.3.1 System Model 1375.3.2 Throughput Analysis 1405.3.3 Opportunistic NOMA for Channel Selection 1475.4 NOMA-based Random Access with Multiuser Detection 1525.4.1 Compressive Random Access 1525.4.2 Layered CRA 1545.4.3 Performance under Realistic Conditions 1595.5 Further Reading 1616 Application of NOMA to MTC in 5G 1636.1 Machine-Type Communication 1636.1.1 IoT Connectivity 1636.1.2 Random Access Schemes for MTC 1646.2 A Model with Massive MIMO 1686.2.1 Massive MIMO 1686.2.2 Two-step Random Access with Massive MIMO 1736.2.3 Throughput Analysis 1746.3 NOMA for High-Throughput MTC 1776.3.1 Co-existing Preambles and Data Packets 1786.3.2 Maximum Throughput Comparison 1806.3.3 Limitations 1846.4 Layered Preambles for Heterogeneous Devices 1856.4.1 Heterogeneous Devices in MTC 1856.4.2 Design of Layered Preambles 1876.4.3 Performance Analysis 1896.5 Further Reading 1957 Game-Theoretic Perspective of NOMA-based Random Access 1977.1 Background of Game Theory 1977.1.1 Normal-Form Games 1987.1.2 Nash Equilibrium 2007.1.3 Mixed Strategies 2007.2 Random Access Game 2027.2.1 Normal-Form and NE 2037.2.2 Mixed Strategies 2047.3 NOMA-ALOHA Game 2047.3.1 Single-Channel NOMA-ALOHA Game 2057.3.2 Multichannel NOMA-ALOHA Game 2167.4 Fictitious Play 2217.4.1 A Model for Fictitious Play 2217.4.2 Convergence 2237.5 Evolutionary Game Theory and Its Application 2277.5.1 Population Games 2277.5.2 Replicator Dynamics and Evolutionary Stable State 2287.5.3 Stability of the Replicator Dynamics 2317.5.4 Application to NOMA 2327.6 Further Reading 234Index 247

O autorze

Jinho Choi, PhD, is a Professor with the School of Information Technology at Deakin University, Australia.