作者: Zhen-hua Yuan , Chen Chen , Xiang Cheng , Guo-cheng Lv , Liu-qing Yang
关键词: Computer science 、 Relay 、 Algorithm 、 Relay channel 、 Channel state information 、 Telecommunications 、 Telecommunications network 、 Conditional probability distribution 、 Upper and lower bounds 、 Eavesdropping 、 Communication channel
摘要: This article is focused on secure relay beamformer design with a correlated channel model in the relay-eavesdropper network. In this network, single-antenna source-destination pair transmits information help of an amplify-and-forward (AF) equipped multiple antennas, and legitimate eavesdropping channels are correlated. The cannot obtain instantaneous state (CSI) eavesdropper, has only knowledge correlation between channels. Depending information, we derive conditional distribution channel. Two beamformers at studied for approximate ergodic secrecy rate: (1) generalized match-and-forward (GMF) to maximize rate, (2) general-rank (GRBF). addition, one lower-bound-maximizing (LBM) discussed maximizing lower bound rate. We find that GMF optimal rank-one beamformer, GRBF iteratively performance LBM rate gets close It can also be observed when power or gain second hop low, surpasses GRBF. Numerical results presented illustrate beamformers’ performance.