Optimal Covert Age of Information for ARIS-Assisted Covert Communication System

In this letter, we investigate the problem of the covert age of information (CAoI) in short-packet covert communication assisted by aerial reconfigurable intelligent surfaces (ARIS). We analyze the detection performance at warden Willie and provide the expression for the system’s average CAoI. Then, through joint optimization of the three-dimensional (3D) hovering position of uncrewed aerial vehicle (UAV) and phase-shift matrix of reconfigurable intelligent surfaces (RIS), we propose the problem of minimizing average CAoI under covert constraints. To address this non-convex optimization problem, we decouple it into two sub-problems and introduce an iterative optimization algorithm to find suboptimal solutions. Simulation results demonstrate the superior performance of the proposed algorithm, showing that it achieves a smaller average CAoI compared to baseline schemes.

Authors

Institutions

Publication Details

Journal
IEEE Wireless Communications Letters
Published
2025-03-06
DOI
https://doi.org/10.1109/lwc.2025.3548902
Citations
3
Primary Topic
Age of Information Optimization
Type
article
Field-Weighted Citation Impact
4.46

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Optimal Covert Age of Information for ARIS-Assisted Covert Communication System

Boya Di, Shu Fu, Wen Zeng
3 citations
IEEE Wireless Communications Letters
Age of Information Optimization
4.46
article

Optimal Covert Age of Information for ARIS-Assisted Covert Communication System

Boya Di, Shu Fu, Wen Zeng
article en
3 citations

Abstract

In this letter, we investigate the problem of the covert age of information (CAoI) in short-packet covert communication assisted by aerial reconfigurable intelligent surfaces (ARIS). We analyze the detection performance at warden Willie and provide the expression for the system’s average CAoI. Then, through joint optimization of the three-dimensional (3D) hovering position of uncrewed aerial vehicle (UAV) and phase-shift matrix of reconfigurable intelligent surfaces (RIS), we propose the problem of minimizing average CAoI under covert constraints. To address this non-convex optimization problem, we decouple it into two sub-problems and introduce an iterative optimization algorithm to find suboptimal solutions. Simulation results demonstrate the superior performance of the proposed algorithm, showing that it achieves a smaller average CAoI compared to baseline schemes.

IEEE Wireless Communications LettersVol. 14(8)
Chongqing University (CN), Peking University (CN)
National Natural Science Foundation of China, Natural Science Foundation of Chongqing
Openalex Percentile: Top 6%
Age of Information Optimization
4.46
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.

Optimal Covert Age of Information for ARIS-Assisted Covert Communication System — Boya Di, Shu Fu, et al. · IEEE Wireless Communications Letters (2025) | TGRS Research Map | TGRS