Quantized RIS-Aided Multi-User Secure Beamforming Against Multiple Eavesdroppers

Tuan, HD; Nasir, AA; Chen, Y; Dutkiewicz, E; Poor, HV

Quantized RIS-Aided Multi-User Secure Beamforming Against Multiple Eavesdroppers

Tuan, HD Nasir, AA Chen, Y Dutkiewicz, E

Poor, HV

Permalink

Publisher:: IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Publication Type:: Journal Article
Citation:: IEEE Transactions on Information Forensics and Security, 2023, 18, pp. 4695-4706
Issue Date:: 2023-01-01

Closed Access

	Filename	Description	Size
	Quantized_RIS-Aided_Multi-User_Secure_Beamforming_Against_Multiple_Eavesdroppers.pdf	Published version	4.07 MB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Tuan, HD
dc.contributor.author	Nasir, AA
dc.contributor.author	Chen, Y
dc.contributor.author	Dutkiewicz, E https://orcid.org/0000-0002-4268-9286
dc.contributor.author	Poor, HV
dc.date.accessioned	2024-03-25T07:39:26Z
dc.date.available	2024-03-25T07:39:26Z
dc.date.issued	2023-01-01
dc.identifier.citation	IEEE Transactions on Information Forensics and Security, 2023, 18, pp. 4695-4706
dc.identifier.issn	1556-6013
dc.identifier.issn	1556-6021
dc.identifier.uri	http://hdl.handle.net/10453/177118
dc.description.abstract	This paper focuses on a network scenario where a multi-antenna access point serves multiple single-antenna users in the presence of multiple eavesdroppers, with the aid of a reconfigurable intelligent surface (RIS). The RIS employs low-resolution programmable reflecting elements (PREs) for cost-effective implementation. In order to establish secure links for all users, we consider the joint design of the transmit beamformers and PREs to maximize either the geometric mean of secrecy rates or the worst user's secrecy rate. Novel computational algorithms of low computational complexity are developed for the solution of these mixed discrete continuous optimization problems. Simulations show the merit of the proposed designs in in achieving fair secrecy rate distributions and ensuring secure links for all users.
dc.language	English
dc.publisher	IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
dc.relation	http://purl.org/au-research/grants/arc/DP190102501
dc.relation.ispartof	IEEE Transactions on Information Forensics and Security
dc.relation.isbasedon	10.1109/TIFS.2023.3298517
dc.rights	info:eu-repo/semantics/closedAccess
dc.subject	08 Information and Computing Sciences, 09 Engineering
dc.subject.classification	Strategic, Defence & Security Studies
dc.subject.classification	40 Engineering
dc.subject.classification	46 Information and computing sciences
dc.title	Quantized RIS-Aided Multi-User Secure Beamforming Against Multiple Eavesdroppers
dc.type	Journal Article
utslib.citation.volume	18
utslib.for	08 Information and Computing Sciences
utslib.for	09 Engineering
pubs.organisational-group	University of Technology Sydney
pubs.organisational-group	University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	University of Technology Sydney/Strength - GBDTC - Global Big Data Technologies
pubs.organisational-group	University of Technology Sydney/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
utslib.copyright.status	closed_access	*
dc.date.updated	2024-03-25T07:39:25Z
pubs.publication-status	Published
pubs.volume	18

Abstract:

This paper focuses on a network scenario where a multi-antenna access point serves multiple single-antenna users in the presence of multiple eavesdroppers, with the aid of a reconfigurable intelligent surface (RIS). The RIS employs low-resolution programmable reflecting elements (PREs) for cost-effective implementation. In order to establish secure links for all users, we consider the joint design of the transmit beamformers and PREs to maximize either the geometric mean of secrecy rates or the worst user's secrecy rate. Novel computational algorithms of low computational complexity are developed for the solution of these mixed discrete continuous optimization problems. Simulations show the merit of the proposed designs in in achieving fair secrecy rate distributions and ensuring secure links for all users.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/177118