Home > Research > Publications & Outputs > Distributed Robust Artificial-Noise-Aided Secur...

Associated organisational unit

Electronic data

  • DistributedRobust

    Accepted author manuscript, 1.44 MB, PDF document

    Available under license: CC BY: Creative Commons Attribution 4.0 International License

Links

Text available via DOI:

View graph of relations

Distributed Robust Artificial-Noise-Aided Secure Precoding for Wiretap MIMO Interference Channels

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published

Standard

Distributed Robust Artificial-Noise-Aided Secure Precoding for Wiretap MIMO Interference Channels. / Kong, Zhengmin; Song, Jing; Yang, Shaoshi et al.
In: IEEE Transactions on Information Forensics and Security, Vol. 19, 07.11.2024, p. 10130-10140.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

Kong, Z, Song, J, Yang, S, Gan, L, Meng, W, Huang, T & Chen, S 2024, 'Distributed Robust Artificial-Noise-Aided Secure Precoding for Wiretap MIMO Interference Channels', IEEE Transactions on Information Forensics and Security, vol. 19, pp. 10130-10140. https://doi.org/10.1109/tifs.2024.3486548

APA

Kong, Z., Song, J., Yang, S., Gan, L., Meng, W., Huang, T., & Chen, S. (2024). Distributed Robust Artificial-Noise-Aided Secure Precoding for Wiretap MIMO Interference Channels. IEEE Transactions on Information Forensics and Security, 19, 10130-10140. https://doi.org/10.1109/tifs.2024.3486548

Vancouver

Kong Z, Song J, Yang S, Gan L, Meng W, Huang T et al. Distributed Robust Artificial-Noise-Aided Secure Precoding for Wiretap MIMO Interference Channels. IEEE Transactions on Information Forensics and Security. 2024 Nov 7;19:10130-10140. Epub 2024 Oct 25. doi: 10.1109/tifs.2024.3486548

Author

Kong, Zhengmin ; Song, Jing ; Yang, Shaoshi et al. / Distributed Robust Artificial-Noise-Aided Secure Precoding for Wiretap MIMO Interference Channels. In: IEEE Transactions on Information Forensics and Security. 2024 ; Vol. 19. pp. 10130-10140.

Bibtex

@article{098735921fab48c8a9a12c7d6cc55f55,
title = "Distributed Robust Artificial-Noise-Aided Secure Precoding for Wiretap MIMO Interference Channels",
abstract = "We propose a distributed artificial noise-assisted precoding scheme for secure communications over wiretap multi-input multi-output (MIMO) interference channels, where K legitimate transmitter-receiver pairs communicate in the presence of a sophisticated eavesdropper having more receive-antennas than the legitimate user. Realistic constraints are considered by imposing statistical error bounds for the channel state information of both the eavesdropping and interference channels. Based on the asynchronous distributed pricing model, the proposed scheme maximizes the total utility of all the users, where each user{\textquoteright}s utility function is defined as the secrecy rate minus the interference cost imposed on other users. Using the weighted minimum mean square error, Schur complement and sign-definiteness techniques, the original non-concave optimization problem is approximated with high accuracy as a quasi-concave problem, which can be solved by the alternating convex search method. Simulation results consolidate our theoretical analysis and show that the proposed scheme outperforms the artificial noise-assisted interference alignment and minimum total mean-square error-based schemes.",
author = "Zhengmin Kong and Jing Song and Shaoshi Yang and Li Gan and Weizhi Meng and Tao Huang and Sheng Chen",
year = "2024",
month = nov,
day = "7",
doi = "10.1109/tifs.2024.3486548",
language = "English",
volume = "19",
pages = "10130--10140",
journal = "IEEE Transactions on Information Forensics and Security",
issn = "1556-6013",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

RIS

TY - JOUR

T1 - Distributed Robust Artificial-Noise-Aided Secure Precoding for Wiretap MIMO Interference Channels

AU - Kong, Zhengmin

AU - Song, Jing

AU - Yang, Shaoshi

AU - Gan, Li

AU - Meng, Weizhi

AU - Huang, Tao

AU - Chen, Sheng

PY - 2024/11/7

Y1 - 2024/11/7

N2 - We propose a distributed artificial noise-assisted precoding scheme for secure communications over wiretap multi-input multi-output (MIMO) interference channels, where K legitimate transmitter-receiver pairs communicate in the presence of a sophisticated eavesdropper having more receive-antennas than the legitimate user. Realistic constraints are considered by imposing statistical error bounds for the channel state information of both the eavesdropping and interference channels. Based on the asynchronous distributed pricing model, the proposed scheme maximizes the total utility of all the users, where each user’s utility function is defined as the secrecy rate minus the interference cost imposed on other users. Using the weighted minimum mean square error, Schur complement and sign-definiteness techniques, the original non-concave optimization problem is approximated with high accuracy as a quasi-concave problem, which can be solved by the alternating convex search method. Simulation results consolidate our theoretical analysis and show that the proposed scheme outperforms the artificial noise-assisted interference alignment and minimum total mean-square error-based schemes.

AB - We propose a distributed artificial noise-assisted precoding scheme for secure communications over wiretap multi-input multi-output (MIMO) interference channels, where K legitimate transmitter-receiver pairs communicate in the presence of a sophisticated eavesdropper having more receive-antennas than the legitimate user. Realistic constraints are considered by imposing statistical error bounds for the channel state information of both the eavesdropping and interference channels. Based on the asynchronous distributed pricing model, the proposed scheme maximizes the total utility of all the users, where each user’s utility function is defined as the secrecy rate minus the interference cost imposed on other users. Using the weighted minimum mean square error, Schur complement and sign-definiteness techniques, the original non-concave optimization problem is approximated with high accuracy as a quasi-concave problem, which can be solved by the alternating convex search method. Simulation results consolidate our theoretical analysis and show that the proposed scheme outperforms the artificial noise-assisted interference alignment and minimum total mean-square error-based schemes.

U2 - 10.1109/tifs.2024.3486548

DO - 10.1109/tifs.2024.3486548

M3 - Journal article

VL - 19

SP - 10130

EP - 10140

JO - IEEE Transactions on Information Forensics and Security

JF - IEEE Transactions on Information Forensics and Security

SN - 1556-6013

ER -