z-logo
open-access-imgOpen Access
Cooperative secrecy transmission in multi‐hop relay networks with interference alignment
Author(s) -
Chen Zhuo,
Hadley Lucinda,
Ding Zhiguo,
Dai Xuchu
Publication year - 2019
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2018.5170
Subject(s) - relay , computer science , wishart distribution , node (physics) , computer network , transmission (telecommunications) , independent and identically distributed random variables , hop (telecommunications) , wireless network , fading , topology (electrical circuits) , wireless , probability density function , interference (communication) , cooperative diversity , gaussian , telecommunications , mathematics , random variable , statistics , combinatorics , engineering , power (physics) , physics , channel (broadcasting) , multivariate statistics , quantum mechanics , machine learning , structural engineering
In this study, the authors consider the secrecy communication of one source–destination pair in a wireless multi‐hop relay network, where each node is equipped with multiple antennas. They use the method of interference alignment for secrecy transmission in the presence of an eavesdropper. Firstly, they propose a decode‐and‐forward (DF) relaying protocol and give a new result on the joint probability density function of the first, second, …, k th ( k = 1 , 2 , … ) largest eigenvalues of the complex Wishart matrices H H H , where H is an matrix whose elements are independent identically distributed complex Gaussian variables with zero mean and unit variance. They then utilise this result to characterise the legitimate outage probability and the diversity order of the proposed DF protocol. The case where the relay works in the amplify‐and‐forward (AF) mode is considered at last, and the diversity order of the proposed AF protocol is given.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here