• DocumentCode
    2042262
  • Title

    Joint transmit design and node selection for one-way and two-way untrusted relay channels

  • Author

    Jing Huang ; Swindlehurst, A.L.

  • Author_Institution
    Center for Pervasive Commun. & Comput., Univ. of California, Irvine, Irvine, CA, USA
  • fYear
    2013
  • fDate
    3-6 Nov. 2013
  • Firstpage
    1555
  • Lastpage
    1559
  • Abstract
    We investigate a relay network where the source and destination select one relay out of a group of untrusted relay nodes to establish a reliable and confidential connection. We assume there is no direct link between them, and the users have to employ an untrusted relay while simultaneously protecting the confidential data from it. We study joint transmit design and node selection strategies for both one-way relaying with the help of cooperative jamming from the destination, and two-way relaying. We first derive optimal algorithms through numerical methods for secrecy rate maximization, and then we propose closed-form suboptimal solutions with reduced complexity. Simulation results show that unlike the conventional relay channels, when untrusted relays are used, one-way relaying with cooperative jamming is more efficient than the two-way relaying scheme in terms of secrecy rate.
  • Keywords
    jamming; optimisation; radio transmitters; relay networks (telecommunication); telecommunication network reliability; telecommunication security; closed form suboptimal solutions; confidential connection; confidential data protection; cooperative jamming; node selection; one-way relaying; optimal algorithms; relay network; relay selection; reliable connection; secrecy rate maximization; transmit design; two-way relaying; untrusted relay channel; untrusted relay nodes; Algorithm design and analysis; Antennas; Decoding; Jamming; Joints; Niobium; Relays;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Signals, Systems and Computers, 2013 Asilomar Conference on
  • Conference_Location
    Pacific Grove, CA
  • Print_ISBN
    978-1-4799-2388-5
  • Type

    conf

  • DOI
    10.1109/ACSSC.2013.6810558
  • Filename
    6810558