• DocumentCode
    1982388
  • Title

    Secure resource allocation for OFDMA two-way relay networks

  • Author

    Haijun Zhang ; Hong Xing ; Xiaoli Chu ; Nallanathan, Arumugam ; Wei Zheng ; Xiangming Wen

  • Author_Institution
    Beijing Key Lab. of Network Syst. Archit. & Convergence, Beijing Univ. of Posts & Telecommun., Beijing, China
  • fYear
    2012
  • fDate
    3-7 Dec. 2012
  • Firstpage
    3649
  • Lastpage
    3654
  • Abstract
    In this paper, we consider the problem of secure resource allocation in orthogonal frequency division multiple access (OFDMA) two-way relay networks. Multiple sources exchange information with the assistance of an amplify-and-forward (AF) relay node in the presence of an eavesdropper. The joint subcarrier allocation, subcarrier pairing and power allocation problem aims to maximize the secrecy capacity for legitimate sources subject to limited power budget and orthogonal subcarrier allocation constraints. The optimization problem is modeled as a mixed integer programming problem, and then solved in an asymptotically optimal manner based on the dual method. Moreover, a suboptimal algorithm is proposed to reduce the complexity. Simulations are conducted to evaluate the effectiveness of the proposed near optimal and suboptimal algorithms.
  • Keywords
    OFDM modulation; amplify and forward communication; frequency division multiple access; integer programming; relay networks (telecommunication); telecommunication security; AF relay node; OFDMA two-way relay network; amplify-and-forward relay node; dual method; mixed integer programming problem; multiple sources exchange information; optimization problem; orthogonal frequency division multiple access; orthogonal subcarrier allocation constraint; power allocation problem; secure resource allocation; subcarrier pairing; suboptimal algorithm;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Global Communications Conference (GLOBECOM), 2012 IEEE
  • Conference_Location
    Anaheim, CA
  • ISSN
    1930-529X
  • Print_ISBN
    978-1-4673-0920-2
  • Electronic_ISBN
    1930-529X
  • Type

    conf

  • DOI
    10.1109/GLOCOM.2012.6503683
  • Filename
    6503683