Papers
Topics
Authors
Recent
Search
2000 character limit reached

OFDMA-based DF Secure Cooperative Communication with Untrusted Users

Published 11 Jan 2019 in cs.IT and math.IT | (1901.03585v1)

Abstract: In this letter we consider resource allocation for OFDMA-based secure cooperative communication by employing a trusted Decode and Forward (DF) relay among the untrusted users. We formulate two optimization problems, namely, (i) sum rate maximization subject to individual power constraints on source and relay, and (ii) sum power minimization subject to a fairness constraint in terms of per-user minimum support secure rate requirement. The optimization problems are solved utilizing the optimality of KKT conditions for pseudolinear functions.

Citations (16)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.