File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
Related Researcher

최진석

Choi, Jinseok
Intelligent Wireless Communications Lab.
Read More

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Sum Secrecy Spectral Efficiency Maximization in Downlink MU-MIMO: Colluding Eavesdroppers

Author(s)
Choi, JinseokPark, Jeonghun
Issued Date
2021-01
DOI
10.1109/TVT.2020.3048736
URI
https://scholarworks.unist.ac.kr/handle/201301/52568
Fulltext
https://ieeexplore.ieee.org/document/9312431
Citation
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, v.70, no.1, pp.1051 - 1056
Abstract
In this paper, we consider a single-cell downlink multi-user multi-input multi-output (MU-MIMO) system in which multiple eavesdroppers coexist. The eavesdroppers overhear confidential information sent from a base station (BS). In particular, we assume a scenario of colluding eavesdroppers in which they cooperate with each other to decode the information. We develop a secure linear precoding method that maximizes the sum secrecy spectral efficiency. To this end, we formulate an optimization problem and propose a computationally-efficient algorithm that achieves a sub-optimal stationary point of the problem. Simulation results validate the proposed algorithm. The proposed method possesses several benefits: i) it is applicable in general systems, for example, an arbitrary number of eavesdroppers and confidential information set, ii) the associated complexity is relatively low, and iii) it is also applicable when only channel covariance of the eavesdroppers is available.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
ISSN
0018-9545
Keyword (Author)
PrecodingDownlinkAntennasOptimizationLinear programmingTransformsPhysical layer securityColluding eavesdroppersgeneralized power iterationMU-MIMOsecrecy ratestationary point

qrcode

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.