Secure Optimal Precoding for User-Centric Cell-Free Massive MIMO System

Xiang Gao; Yong Li; Wei Cheng; Limeng Dong; Penglu Liu

doi:10.1109/LWC.2022.3216050

Secure Optimal Precoding for User-Centric Cell-Free Massive MIMO System

Xiang Gao
, Yong Li
, Wei Cheng
, Limeng Dong
, Penglu Liu

School of Electronics and Information

Northwestern Polytechnical University Xian

Research output: Contribution to journal › Article › peer-review

22 Scopus citations

Abstract

The security of user-centric cell-free massive multiple-input multiple-output (UC-CF mMIMO) system in the presence of multiple collusive eavesdroppers (Eves) is investigated in this letter. The access points (APs) share the estimated channel state informations (CSIs) of serving users to central processing unit (CPU). Utilizing the received partial CSIs, the CPU optimizes precoding via formulating a secrecy rate maximization problem under minimum rate requirements of users and power constraints of APs. The formulated problem is non-convex, and the optimum solution is acquired by iteratively solving a sequence of second-order cone programming problems. The numerical simulations present the comparison of secrecy performance achieved in different AP selection methods of UC-CF system, and CF system.

Original language	English
Pages (from-to)	31-35
Number of pages	5
Journal	IEEE Wireless Communications Letters
Volume	12
Issue number	1
DOIs	https://doi.org/10.1109/LWC.2022.3216050
State	Published - 1 Jan 2023

Keywords

User-centric cell-free massive MIMO
optimal precoding
second-order cone programming
secrecy rate

Access to Document

10.1109/LWC.2022.3216050

Cite this

@article{2ffea61544b14c6abf6afef5f9b0a779,

title = "Secure Optimal Precoding for User-Centric Cell-Free Massive MIMO System",

abstract = "The security of user-centric cell-free massive multiple-input multiple-output (UC-CF mMIMO) system in the presence of multiple collusive eavesdroppers (Eves) is investigated in this letter. The access points (APs) share the estimated channel state informations (CSIs) of serving users to central processing unit (CPU). Utilizing the received partial CSIs, the CPU optimizes precoding via formulating a secrecy rate maximization problem under minimum rate requirements of users and power constraints of APs. The formulated problem is non-convex, and the optimum solution is acquired by iteratively solving a sequence of second-order cone programming problems. The numerical simulations present the comparison of secrecy performance achieved in different AP selection methods of UC-CF system, and CF system.",

keywords = "User-centric cell-free massive MIMO, optimal precoding, second-order cone programming, secrecy rate",

author = "Xiang Gao and Yong Li and Wei Cheng and Limeng Dong and Penglu Liu",

note = "Publisher Copyright: {\textcopyright} 2012 IEEE.",

year = "2023",

month = jan,

day = "1",

doi = "10.1109/LWC.2022.3216050",

language = "英语",

volume = "12",

pages = "31--35",

journal = "IEEE Wireless Communications Letters",

issn = "2162-2337",

publisher = "IEEE Communications Society",

number = "1",

}

TY - JOUR

T1 - Secure Optimal Precoding for User-Centric Cell-Free Massive MIMO System

AU - Gao, Xiang

AU - Li, Yong

AU - Cheng, Wei

AU - Dong, Limeng

AU - Liu, Penglu

PY - 2023/1/1

Y1 - 2023/1/1

N2 - The security of user-centric cell-free massive multiple-input multiple-output (UC-CF mMIMO) system in the presence of multiple collusive eavesdroppers (Eves) is investigated in this letter. The access points (APs) share the estimated channel state informations (CSIs) of serving users to central processing unit (CPU). Utilizing the received partial CSIs, the CPU optimizes precoding via formulating a secrecy rate maximization problem under minimum rate requirements of users and power constraints of APs. The formulated problem is non-convex, and the optimum solution is acquired by iteratively solving a sequence of second-order cone programming problems. The numerical simulations present the comparison of secrecy performance achieved in different AP selection methods of UC-CF system, and CF system.

AB - The security of user-centric cell-free massive multiple-input multiple-output (UC-CF mMIMO) system in the presence of multiple collusive eavesdroppers (Eves) is investigated in this letter. The access points (APs) share the estimated channel state informations (CSIs) of serving users to central processing unit (CPU). Utilizing the received partial CSIs, the CPU optimizes precoding via formulating a secrecy rate maximization problem under minimum rate requirements of users and power constraints of APs. The formulated problem is non-convex, and the optimum solution is acquired by iteratively solving a sequence of second-order cone programming problems. The numerical simulations present the comparison of secrecy performance achieved in different AP selection methods of UC-CF system, and CF system.

KW - User-centric cell-free massive MIMO

KW - optimal precoding

KW - second-order cone programming

KW - secrecy rate

UR - https://www.scopus.com/pages/publications/85140800301

U2 - 10.1109/LWC.2022.3216050

DO - 10.1109/LWC.2022.3216050

M3 - 文章

AN - SCOPUS:85140800301

SN - 2162-2337

VL - 12

SP - 31

EP - 35

JO - IEEE Wireless Communications Letters

JF - IEEE Wireless Communications Letters

IS - 1

ER -

Secure Optimal Precoding for User-Centric Cell-Free Massive MIMO System

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this