Abstract

Abstract This paper investigates security-oriented beamforming designs in a relay network composed of a source-destination pair, multiple relays, and a passive eavesdropper. Unlike most of the earlier works, we assume that only statistical information of the relay-eavesdropper channels is known to the relays. We propose beamforming solutions for amplify-and-forward (AF) and decode-and-forward (DF) relay networks to improve secrecy capacity. In an AF network, the beamforming design is obtained by approximating a product of two correlated Rayleigh quotients to a single Rayleigh quotient using the Taylor series expansion. Our study reveals that in an AF network, the secrecy capacity does not always grow as the eavesdropper moves away from the relays or as total relay transmit power increases. Moreover, if the destination is nearer to the relays than the eavesdropper is, a suboptimal power is derived in closed form through monotonicity analysis of secrecy capacity. While in a DF network, secrecy capacity is a single Rayleigh quotient problem which can be easily solved. We also found that if the relay-eavesdropper distances are about the same, it is unnecessary to consider the eavesdropper in a DF network. Numerical results show that for either AF or DF relaying protocol, the proposed beamforming scheme provides higher secrecy capacity than traditional approaches.

Highlights

  • Cooperative communications, in which multiple nodes help each other transmit messages, has been widely acknowledged as an effective way to improve system performance [1,2,3]

  • We address the traditional design for AF (T-AF)

  • If the destination is much nearer to the relays than the eavesdropper is in an AF network, CS does not always grow as the total relay transmit power increases, and a suboptimal value of the total relay transmit power is found as wH λminðΦÞ≤

Read more

Summary

Introduction

Cooperative communications, in which multiple nodes help each other transmit messages, has been widely acknowledged as an effective way to improve system performance [1,2,3]. The traditional secure communication schemes rely on encryption techniques where secret keys are used. It was first proved by Wyner that it is possible to communicate perfectly at a non-zero rate without a secret key if the eavesdropper has a worse channel than the destination [4]. This protocols based on the minimization of intercept probability were proposed

Objectives
Discussion
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.