# Outage Performance in Secure Cooperative NOMA

## TL;DR

This paper analyzes the outage performance of a secure cooperative NOMA system with randomly distributed users and eavesdroppers, deriving exact and bound secrecy outage probabilities and demonstrating the advantages over non-cooperative schemes.

## Contribution

It provides the first analytical derivation of secrecy outage probabilities in a cooperative NOMA system with random user and eavesdropper distributions, including bounds for different security scenarios.

## Key findings

- Cooperative NOMA outperforms non-cooperative in secrecy performance.
- Exact and bounded secrecy outage probabilities are derived for various scenarios.
- Numerical results confirm the benefits of cooperation in secure NOMA systems.

## Abstract

Enabling cooperation in a NOMA system is a promising approach to improve its performance. In this paper, we study the cooperation in a secure NOMA system, where the legitimate users are distributed uniformly in the network and the eavesdroppers are distributed according to a homogeneous Poisson point process. We consider a cooperative NOMA scheme (two users are paired as strong and weak users) in two phases: 1) Direct transmission phase, in which the base station broadcasts a superposition of the messages, 2) Cooperation phase, in which the strong user acts as a relay to help in forwarding the messages of the weak user. We study the secrecy outage performance in two cases: (i) security of the strong user, (ii) security of both users, are guaranteed. In the first case, we derive the exact secrecy outage probability of the system for some regions of power allocation coefficients and a lower bound on the secrecy outage probability is derived for the other regions. In the second case, the strong user is a relay or a friendly jammer (as well as a relay), where an upper bound on the secrecy outage probability is derived at high signal-to-noise-ratio regimes. For both cases, the cooperation in a two-user paired NOMA system necessitate to utilize the joint distribution of the distance between two random users. Numerical results shows the superiority of the secure cooperative NOMA for a range of the cooperation power compared to secure non-cooperative NOMA systems.