• DocumentCode
    1977959
  • Title

    Coordinated relay beamforming for amplify-and-forward two-hop interference networks

  • Author

    Yuanming Shi ; Jun Zhang ; Letaief, Khaled

  • Author_Institution
    Dept. of ECE, Hong Kong Univ. of Sci. & Technol., Hong Kong, China
  • fYear
    2012
  • fDate
    3-7 Dec. 2012
  • Firstpage
    2408
  • Lastpage
    2413
  • Abstract
    Relaying is a promising technique to extend coverage and improve throughput in wireless networks, but its performance is degraded in the presence of co-channel interference. In this paper, we consider coordinated relay beamforming to suppress interference and improve the date rates of two-hop interference networks. We first propose optimal coordinated relay beamforming algorithms to characterize the achievable rate region and maximize the sum-rate. By imposing a constraint on the desired signals, a low-complexity iterative algorithm is then proposed to maximize the sum-rate. Through performance comparison, we show that the proposed relaying strategy provides a promising tradeoff between complexity and performance. To further reduce design complexity, we propose a new interference management scheme, interference neutralization, to cancel the interferences over the air at the second hop. We show that this scheme yields a closed-form solution for the beamforming design and provides good performance especially at high signal-to-noise ratio (SNR).
  • Keywords
    amplify and forward communication; array signal processing; cochannel interference; interference suppression; iterative methods; relay networks (telecommunication); SNR; amplify-and-forward two-hop interference networks; cochannel interference suppression; coordinated relay beamforming; interference management scheme; low-complexity iterative algorithm; relaying strategy; signal-to-noise ratio; wireless networks;
  • 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.6503477
  • Filename
    6503477