Meta Distribution and Secrecy of Partial Non-Orthogonal Multiple Access (NOMA) in Poisson Networks

<div>This work studies the meta distribution in a partial-NOMA network to obtain fine-grained information about the network performance. As the meta distribution is approximated using the beta distribution via moment matching of the first two moments, reduced integral expressions are derived for the first two moments of the meta distribution. Accurate approximate moments are also proposed to further simplify the calculation. Security is an issue in partial-NOMA because the strong user may decode the weak user’s message in the process of decoding its own message using flexible successive interference cancellation (FSIC). Therefore, a measure of secrecy is defined in this context and the secrecy probability is derived for the case of: 1) a malicious strong user that prioritizes eavesdropping, 2) an innocent strong user that decodes the weak user’s message only when it is required to do so. The obtained results highlight the superiority of partial-NOMA over traditional NOMA in terms of secrecy. They also show that receive filtering and FSIC have a significant positive impact on the secrecy of partial- OMA. Furthermore, partial-NOMA with a small overlap of the resource-block can secure the network from the additional deterioration a malicious eavesdropper may cause.</div>

Meta Distribution and Secrecy of Partial Non-Orthogonal Multiple Access (NOMA) in Poisson Networks

<div>This work studies the meta distribution in a partial-NOMA network to obtain fine-grained information about the network performance. As the meta distribution is approximated using the beta distribution via moment matching of the first two moments, reduced integral expressions are derived for the first two moments of the meta distribution. Accurate approximate moments are also proposed to further simplify the calculation. Security is an issue in partial-NOMA because the strong user may decode the weak user’s message in the process of decoding its own message using flexible successive interference cancellation (FSIC). Therefore, a measure of secrecy is defined in this context and the secrecy probability is derived for the case of: 1) a malicious strong user that prioritizes eavesdropping, 2) an innocent strong user that decodes the weak user’s message only when it is required to do so. The obtained results highlight the superiority of partial-NOMA over traditional NOMA in terms of secrecy. They also show that receive filtering and FSIC have a significant positive impact on the secrecy of partial- OMA. Furthermore, partial-NOMA with a small overlap of the resource-block can secure the network from the additional deterioration a malicious eavesdropper may cause.</div>