On Secrecy Performance of Antenna Selection Aided MIMO Systems Against Eavesdropping

January 26, 2015 Β· Declared Dead Β· πŸ› IEEE Transactions on Vehicular Technology

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Jia Zhu, Yulong Zou, Gongpu Wang, Yu-Dong Yao, George K. Karagiannidis arXiv ID 1501.06407 Category cs.IT: Information Theory Citations 110 Venue IEEE Transactions on Vehicular Technology Last Checked 4 months ago
Abstract
In this paper, we consider a multiple-input multiple-output (MIMO) system consisting of one source, one destination and one eavesdropper, where each node is equipped with an arbitrary number of antennas. To improve the security of source-destination transmissions, we investigate the antenna selection at the source and propose the optimal antenna selection (OAS) and suboptimal antenna selection (SAS) schemes, depending on whether the source node has the global channel state information (CSI) of both the main link (from source to destination) and wiretap link (from source to eavesdropper). Also, the traditional space-time transmission (STT) is studied as a benchmark. We evaluate the secrecy performance of STT, SAS, and OAS schemes in terms of the probability of zero secrecy capacity. Furthermore, we examine the generalized secrecy diversity of STT, SAS, and OAS schemes through an asymptotic analysis of the probability of zero secrecy capacity, as the ratio between the average gains of the main and wiretap channels tends to infinity. This is different from the conventional secrecy diversity which assumes an infinite signal-to-noise ratio (SNR) received at the destination under the condition that the eavesdropper has a finite received SNR. It is shown that the generalized secrecy diversity orders of STT, SAS, and OAS schemes are the product of the number of antennas at source and destination. Additionally, numerical results show that the proposed OAS scheme strictly outperforms both the STT and SAS schemes in terms of the probability of zero secrecy capacity.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Theory

Died the same way β€” πŸ‘» Ghosted