pith. sign in

arxiv: 1605.04487 · v1 · pith:5SCFTDEEnew · submitted 2016-05-15 · 💻 cs.IT · math.IT

Study of Relay Selection for Physical-Layer Security in Buffer-Aided Relay Networks Based on the Secrecy Rate Criterion

classification 💻 cs.IT math.IT
keywords relayratesecrecyselectioncriterioneavesdropperspoliciesalgorithm
0
0 comments X p. Extension
pith:5SCFTDEE Add to your LaTeX paper What is a Pith Number?
\usepackage{pith}
\pithnumber{5SCFTDEE}

Prints a linked pith:5SCFTDEE badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more

read the original abstract

In this paper, we investigate an opportunistic relay and jammer scheme along with relay selection algorithms based on the secrecy rate criterion in multiple-input multiple-output buffer-aided down link relay networks, which consist of one source, a number of relay nodes, legitimate users and eavesdroppers, with the constraints of physical layer security. The opportunistic relay and jammer scheme is employed to improve the transmission rate and different relay selection policies are performed to achieve better secrecy rate with the consideration of eavesdroppers. Among all the investigated relay selection policies, a relay selection policy which is developed to maximize the secrecy rate based on exhaustive searches outperforms other relay selection policies in terms of secrecy rate. Based on the secrecy rate criterion, we develop a relay selection algorithm without knowledge of the channels of the eavesdroppers. We also devise a greedy search algorithm based on the secrecy rate criterion to reduce the computational complexity of the exhaustive search technique. Simulations show the superiority of the secrecy rate criterion over competing approaches.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.