Secrecy-Rate Optimization of Double RIS-Aided Space-Ground Networks

Hoang, TM; Xu, C; Vahid, A; Tuan, HD; Duong, TQ; Hanzo, L

Secrecy-Rate Optimization of Double RIS-Aided Space-Ground Networks

Hoang, TM Xu, C Vahid, A Tuan, HD Duong, TQ Hanzo, L

Permalink

Publisher:: IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Publication Type:: Journal Article
Citation:: IEEE Internet of Things Journal, 2023, 10, (15), pp. 13221-13234
Issue Date:: 2023-08-01

Closed Access

	Filename	Description	Size
	Secrecy-Rate_Optimization_of_Double_RIS-Aided_SpaceGround_Networks.pdf	Published version	3.89 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	Hoang, TM
dc.contributor.author	Xu, C
dc.contributor.author	Vahid, A
dc.contributor.author	Tuan, HD
dc.contributor.author	Duong, TQ
dc.contributor.author	Hanzo, L
dc.date.accessioned	2024-04-19T04:40:37Z
dc.date.available	2024-04-19T04:40:37Z
dc.date.issued	2023-08-01
dc.identifier.citation	IEEE Internet of Things Journal, 2023, 10, (15), pp. 13221-13234
dc.identifier.issn	2327-4662
dc.identifier.issn	2327-4662
dc.identifier.uri	http://hdl.handle.net/10453/178082
dc.description.abstract	The physical-layer security (PLS) of a space-ground communication system is examined. To improve the security performance, a pair of reconfigurable intelligent surfaces (RISs) is integrated into the system and benchmarked against a scheme, where there is only a single RIS close to the ground station. As for the double-RIS scenario, we formulate a secrecy rate maximization problem, and then propose an alternating optimization (AO) algorithm for jointly optimizing three vectors, namely, the beamformer of the ground station and the reflecting vectors of two different RISs. Similarly, as for the single-RIS case, we also propose another AO algorithm for optimizing a pair of vectors, namely, the beamformer of the ground station and the reflecting vector of the single RIS. Both the double-RIS and the single-RIS AO algorithms are developed on the basis of the first-order Taylor expansion and Dinkelbach's method, which allow us to approximate nonconvex optimization problems by convex ones. Our results demonstrate that the proposed double-RIS scheme outperforms the single-RIS benchmark scheme in terms of its security.
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 Internet of Things Journal
dc.relation.isbasedon	10.1109/JIOT.2023.3262481
dc.rights	info:eu-repo/semantics/closedAccess
dc.subject	0805 Distributed Computing, 1005 Communications Technologies
dc.subject.classification	40 Engineering
dc.subject.classification	46 Information and computing sciences
dc.title	Secrecy-Rate Optimization of Double RIS-Aided Space-Ground Networks
dc.type	Journal Article
utslib.citation.volume	10
utslib.for	0805 Distributed Computing
utslib.for	1005 Communications Technologies
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/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
utslib.copyright.status	closed_access	*
dc.date.updated	2024-04-19T04:40:35Z
pubs.issue	15
pubs.publication-status	Published
pubs.volume	10
utslib.citation.issue	15

Abstract:

The physical-layer security (PLS) of a space-ground communication system is examined. To improve the security performance, a pair of reconfigurable intelligent surfaces (RISs) is integrated into the system and benchmarked against a scheme, where there is only a single RIS close to the ground station. As for the double-RIS scenario, we formulate a secrecy rate maximization problem, and then propose an alternating optimization (AO) algorithm for jointly optimizing three vectors, namely, the beamformer of the ground station and the reflecting vectors of two different RISs. Similarly, as for the single-RIS case, we also propose another AO algorithm for optimizing a pair of vectors, namely, the beamformer of the ground station and the reflecting vector of the single RIS. Both the double-RIS and the single-RIS AO algorithms are developed on the basis of the first-order Taylor expansion and Dinkelbach's method, which allow us to approximate nonconvex optimization problems by convex ones. Our results demonstrate that the proposed double-RIS scheme outperforms the single-RIS benchmark scheme in terms of its security.

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

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