Emergent Mind

Outage Performance in Secure Cooperative NOMA

(1902.00948)
Published Feb 3, 2019 in cs.IT and math.IT

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.

We're not able to analyze this paper right now due to high demand.

Please check back later (sorry!).

Generate a summary of this paper on our Pro plan:

We ran into a problem analyzing this paper.

Newsletter

Get summaries of trending comp sci papers delivered straight to your inbox:

Unsubscribe anytime.