IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v18y2022i6p15501329221104330.html
   My bibliography  Save this article

Deep learning–based resource allocation for secure transmission in a non-orthogonal multiple access network

Author

Listed:
  • Miao Zhang
  • Yao Zhang
  • Qian Cen
  • Shixun Wu

Abstract

Machine learning techniques, especially deep learning algorithms have been widely utilized to deal with different kinds of research problems in wireless communications. In this article, we investigate the secrecy rate maximization problem in a non-orthogonal multiple access network based on deep learning approach. In this non-orthogonal multiple access network, the base station intends to transmit two integrated information: a confidential information to user 1 (the strong user) and a broadcast information to user 1 and user 2. In addition, there exists an eavesdropper that intends to decode the confidential information due to the broadcast nature of radio waves. Hence, we formulate the optimization problem as a secrecy rate maximization problem. We first solve this problem by employing convex optimization technique, then we generate the training, validation, and test dataset. We propose a deep neural network–based approach to learn to optimize the resource allocations. The advantages of the proposed deep neural network are the capabilities to achieve low complexity and latency resource allocations. Simulation results are provided to show that the proposed deep neural network approach is capable of reaching near-optimal secrecy rate performance with significantly reduced computational time, when compared with the benchmark conventional approach.

Suggested Citation

  • Miao Zhang & Yao Zhang & Qian Cen & Shixun Wu, 2022. "Deep learning–based resource allocation for secure transmission in a non-orthogonal multiple access network," International Journal of Distributed Sensor Networks, , vol. 18(6), pages 15501329221, June.
  • Handle: RePEc:sae:intdis:v:18:y:2022:i:6:p:15501329221104330
    DOI: 10.1177/15501329221104330
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/15501329221104330
    Download Restriction: no

    File URL: https://libkey.io/10.1177/15501329221104330?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:18:y:2022:i:6:p:15501329221104330. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.