NOMA Versus OMA: Scheduling to Minimize the Age of Information

Abstract

<p>An uplink internet-of-things (IoT) scenario is considered, wherein, multiple IoT devices (IoTDs) report their timely status updates to a central node (CN). We analytically compare the performance of orthogonal multiple access (OMA) and non-orthogonal multiple access (NOMA) scheduling schemes for the expected system age of information and throughput.</p>

NOMA Versus OMA: Scheduling to Minimize the Age of Information

“…5 presents the variation of E[ 𝐴] for the IID OMA scheme and Case A of the adaptive pairing scheme against different values of 𝜌 and 𝜖. The analytical expression for E[ 𝐴] for imperfect SIC is given in Appendix C of [7]. It can be observed from Fig.…”

“…Thus, the proposed pairing scheme is adaptive to imperfection in SIC. A discussion of imperfect CSI is provided in Appendix C of [7].…”

“…PROOF OUTLINES Due to space constraints, we present an outline of the proofs. Please refer to Appendix B of [7] for the detailed proofs. For Theorem 1, using (2), the expected system AoI for IID OMA and (N)OMA schemes are given by E[…”

“…(2) A detailed derivation for (2) is provided in Appendix B of [7]. The basic assumptions which underlie the utility of this manuscript are as follows.…”

NOMA Versus OMA: Scheduling to Minimize the Age of Information

“…Due to space constraints, we present an outline of the proofs. Please refer to the appendix of [10] for the detailed proofs. For Theorem 1, using (2), the expected system AoI for IID OMA and (N)OMA schemes are given by E[…”