06746659.pdf (1.85 MB)
Max-ratio relay selection in secure buffer-aided cooperative wireless networks
journal contributionposted on 2014-04-24, 09:33 authored by Gaojie Chen, Zhao Tian, Yu GongYu Gong, Zhi Chen, Jonathon Chambers
This paper considers the security of transmission in buffer-aided decode-and-forward cooperative wireless networks. An eavesdropper which can intercept the data transmission from both the source and relay nodes is considered to threaten the security of transmission. Finite size data buffers are assumed to be available at every relay in order to avoid having to select concurrently the best source-to-relay and relay-to-destination links. A new max-ratio relay selection policy is proposed to optimize the secrecy transmission by considering all the possible source-to-relay and relay-to-destination links and selecting the relay having the link which maximizes the signal to eavesdropper channel gain ratio. Two cases are considered in terms of knowledge of the eavesdropper channel strengths: exact and average gains, respectively. Closed-form expressions for the secrecy outage probability for both cases are obtained, which are verified by simulations. The proposed max-ratio relay selection scheme is shown to outperform one based on a max-min-ratio relay scheme.
This work was supported in part by the Engineering and Physical Sciences Research Council (EPSRC) [grant number EP/K014307/1] and in part by the MOD University Defence Research Collaboration in Signal Processing.
- Mechanical, Electrical and Manufacturing Engineering
Published inIEEE Transactions on Information Forensics and Security
Pages719 - 729
CitationCHEN, G. ... et al., 2014. Max-ratio relay selection in secure buffer-aided cooperative wireless networks. IEEE Transactions on Information Forensics and Security, 9 (4), pp. 719 - 729.
Publisher© the authors. Published by IEEE
- VoR (Version of Record)
NotesThis is an Open Access Article. It is published by the IEEE under the Creative Commons Attribution 3.0 Unported Licence (CC BY). Full details of this licence are available at: http://creativecommons.org/licenses/by/3.0/ Research data for this paper is available on request from the authors.