Covert Satellite Communication Over Overt Channel: A Randomized Gaussian Signalling Approach

In this article, we design a covert satellite communication scheme over an overt channel by randomizing the variance feature of the transmitted Gaussian signaling to realize a positive covert rate. The transmitter Alice sends an overt signal superimposed by a covert signal which is received by public user Carol, a covert user Bob, and a warden Willie. The received power in Willie is randomized because of the random variance. We derive the detection error probability of Willie and the covert rate of Bob in shadowed-Rician fading channel when channel state information (CSI) is perfectly known or only channel distribution information (CDI) is known. We give the closed-form optimal random range of the variance and the optimal covert rate when CSI is a known subject to the reliability and covertness constraints. When only CDI is known, we prove that there exists a unique value of the random variance to maximize the expected covert rate of Bob. Our numerical results confirm the correctness of the theoretical results and show that the optimal random distribution of the variance can be effectively adaptive to the system parameters and the covert rate when CSI is known is very close to that when only CDI is known.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Aerospace and Electronic Systems
Published
2024-10-09
DOI
https://doi.org/10.1109/taes.2024.3475994
Citations
13
Primary Topic
Wireless Communication Security Techniques
Type
article
Field-Weighted Citation Impact
2.71
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Covert Satellite Communication Over Overt Channel: A Randomized Gaussian Signalling Approach

Kai Ming Yang, Neng Ye, Jianping An, Jihong Yu et al.
13 citations
IEEE Transactions on Aerospace and Electronic Systems
Wireless Communication Security Techniques
2.71
article

Covert Satellite Communication Over Overt Channel: A Randomized Gaussian Signalling Approach

Kai Ming Yang, Neng Ye, Jianping An, Jihong Yu, Jiahao Liu, Yun Li, Hanpeng Yu
article en
13 citations

Abstract

In this article, we design a covert satellite communication scheme over an overt channel by randomizing the variance feature of the transmitted Gaussian signaling to realize a positive covert rate. The transmitter Alice sends an overt signal superimposed by a covert signal which is received by public user Carol, a covert user Bob, and a warden Willie. The received power in Willie is randomized because of the random variance. We derive the detection error probability of Willie and the covert rate of Bob in shadowed-Rician fading channel when channel state information (CSI) is perfectly known or only channel distribution information (CDI) is known. We give the closed-form optimal random range of the variance and the optimal covert rate when CSI is a known subject to the reliability and covertness constraints. When only CDI is known, we prove that there exists a unique value of the random variance to maximize the expected covert rate of Bob. Our numerical results confirm the correctness of the theoretical results and show that the optimal random distribution of the variance can be effectively adaptive to the system parameters and the covert rate when CSI is known is very close to that when only CDI is known.

IEEE Transactions on Aerospace and Electronic SystemsVol. 61(2)
Chongqing University of Posts and Telecommunications (CN), Beijing Institute of Technology (CN), China Academy of Space Technology (CN)
Openalex Percentile: Top 9%
Wireless Communication Security Techniques
2.71
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.