Securing IRS-SWIPT Deployment in O-RAN

The Open Radio Access Network (O-RAN) revolutionizes the telecom domain to attain open, interoperable, and software-driven network architecture. This fosters innovation, increases flexibility, and enhances cost-efficiency in next-generation networks (NGN). In NGN, two of the proposed technologies are the Intelligent Reflecting Surface (IRS) and Simultaneous Wireless Information and Power Transfer (SWIPT), which combines data transmission and energy harvesting (EH). In this study, we investigate the scenario of securing the IRS-SWIPT communication downlink scheme in O-RAN through the physical layer. We aim to maximize the secrecy sum rate for legitimate users and efficiently allocate energy to them while adhering to energy harvesting and O-RAN’s computational resource constraints. Further, we develop a deep reinforcement learning (DRL) method, specifically, deep deterministic policy gradient (DDPG) named SecureLink-DDPG, to determine the optimal optimization parameters that maximize the secure sum rate. Simulation results validate the effectiveness of the proposed DRL solution in ensuring secure communication for legitimate users while meeting the specified constraints. The SecureLink-DDPG approximates the optimum in small-scale scenarios and substantially outperforms a discretized grid-based search (GBS) technique, while operating with a fraction of the computational resources required by the GBS.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Cognitive Communications and Networking
Published
2025-02-21
DOI
https://doi.org/10.1109/tccn.2025.3544834
Primary Topic
Distributed systems and fault tolerance
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Securing IRS-SWIPT Deployment in O-RAN

Ahmed Badawy, Muhammad Shehab
IEEE Transactions on Cognitive Communications and Networking
Distributed systems and fault tolerance
article

Securing IRS-SWIPT Deployment in O-RAN

Ahmed Badawy, Muhammad Shehab
article en

Abstract

The Open Radio Access Network (O-RAN) revolutionizes the telecom domain to attain open, interoperable, and software-driven network architecture. This fosters innovation, increases flexibility, and enhances cost-efficiency in next-generation networks (NGN). In NGN, two of the proposed technologies are the Intelligent Reflecting Surface (IRS) and Simultaneous Wireless Information and Power Transfer (SWIPT), which combines data transmission and energy harvesting (EH). In this study, we investigate the scenario of securing the IRS-SWIPT communication downlink scheme in O-RAN through the physical layer. We aim to maximize the secrecy sum rate for legitimate users and efficiently allocate energy to them while adhering to energy harvesting and O-RAN’s computational resource constraints. Further, we develop a deep reinforcement learning (DRL) method, specifically, deep deterministic policy gradient (DDPG) named SecureLink-DDPG, to determine the optimal optimization parameters that maximize the secure sum rate. Simulation results validate the effectiveness of the proposed DRL solution in ensuring secure communication for legitimate users while meeting the specified constraints. The SecureLink-DDPG approximates the optimum in small-scale scenarios and substantially outperforms a discretized grid-based search (GBS) technique, while operating with a fraction of the computational resources required by the GBS.

IEEE Transactions on Cognitive Communications and NetworkingVol. 11(6)
Qatar University (QA)
Openalex Percentile: Top 97%
Distributed systems and fault tolerance
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.