Pith. sign in

REVIEW 2 major objections 4 minor 1 cited by

Active RIS-Empowered Covert Satellite-Terrestrial Communications

T0 review · 2 major / 4 minor · reviewed 2026-08-16 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read This paper claims that a mobile aerial platform carrying an active STAR-RIS, whose trajectory and beamforming are jointly optimized by a generative diffusion-model deep reinforcement learning algorithm, can provide fair covert…

desk verdict A competent systems-engineering paper with a real new combination and a standard covert-constraint derivation, but the headline gains rest on simulations that lack seeds, error bars, and a couple of load-bearing parameters. read the letter →

arxiv 2504.16146 v4 pith:AZ65BEZ4 submitted 2025-04-22 eess.SP cs.ITcs.NImath.IT

Chuang Zhang , Geng Sun , Jiahui Li , Shiwen Mao , Abbas Jamalipour This is my paper · ORCID
classification eess.SPcs.ITcs.NImath.IT
keywords ActiveSTAR-RISCovertcommunicationsSatellite-terrestrialnetworksFairnessDeepreinforcementlearningGenerativediffusionmodelTrajectoryoptimization
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper tries to establish that a mobile aerial relay equipped with an active simultaneous transmitting and reflecting reconfigurable intelligent surface (STAR-RIS) can make satellite-to-ground communication both faster and undetectable in dense urban environments where direct satellite links fail. It derives a closed-form covert constraint from the Warden's minimal detection error probability under perfect CSI and environmental noise uncertainty, then formulates an optimization problem (ASCCOP) that maximizes the sum of Jain's-index-weighted channel capacities subject to that constraint. Because the problem is non-convex, long-horizon, and high-dimensional, the paper proposes the GDPG algorithm, which uses a generative diffusion model as the policy and an action-gradient step for improvement. Simulations show the approach outperforms trajectory-only, beamforming-only, passive-RIS, and standard DRL baselines in sum capacity, fairness, and covertness, and runs in tens of milliseconds on a Raspberry Pi.

What carries the argument

The load-bearing object is the AASTAR-RIS: an aerial platform whose active STAR-RIS transmission coefficient matrix is $\Phi[n] = \mathrm{diag}(\beta_m[n] e^{j\phi_m[n]})$, with amplification gains $\beta_m[n] > 1$ and phase shifts $\phi_m[n] \in [0, 2\pi]$, letting the relay amplify and steer the GEO satellite's signal. The covert constraint comes from the Warden's minimal detection error probability $\xi^*[n]$ under perfect CSI and bounded environmental noise uncertainty $\rho$; it reduces to an upper bound on the power $\iota[n]$ reaching the Warden. The algorithm that carries the optimization is GDPG: a generative diffusion model acts as the policy, producing the action $a[n]$ by $T$ denoising steps conditioned on the state, while an action-gradient step $a \leftarrow a + \eta_a \nabla_a Q(s, a)$ refines state-action pairs for policy improvement, stabilized by double critics and target networks. The diffusion policy is what makes exploration of the high-dimensional, frequently-penalized action space effective compared with unimodal Gaussian policies.

What would settle it

Run the trained GDPG policy in an outdoor testbed with a UAV-mounted active STAR-RIS, a GEO-like source, and a passive Warden radiometer; measure the empirical detection error probability and per-user capacity. The central claim fails if the empirical DEP drops below $1-\varepsilon$ at the claimed transmit settings or if the fairness index falls substantially below the simulated value. A cheaper simulation check: set the Warden's noise uncertainty $\rho$ to 0 dB and test whether any trajectory and beamforming satisfying the Eq. (16) constraint admits positive capacity; if none exists, the covert-feasible operating region rests entirely on the assumed noise uncertainty.

Watch

Extended reading notes

Core claim

The central claim is that covertness in a satellite-terrestrial downlink can be actively engineered rather than merely tolerated. By mounting an active STAR-RIS on a moving aerial platform and jointly optimizing its trajectory, per-element amplification gains, and phase shifts, the system satisfies a strict covert constraint derived from the Warden's minimum detection error probability while maximizing the sum of fair channel capacities across ground users. The paper proves the resulting optimization problem is non-convex and long-term, then supplies the generative deterministic policy gradient (GDPG) algorithm, in which a diffusion model produces actions through iterative denoising and a gradient-ascent refinement of state-action pairs performs policy improvement. In the reported simulations, this approach attains higher mean sum channel capacity, a higher fairness index, and fewer covert-constraint violations than DDPG, TD3, SAC, a VAE-enabled DPG, and ablations optimizing only trajectory or only beamforming.

Load-bearing premise

The load-bearing premise is that the simulation environment—Rician factors, path-loss exponents, noise levels, Warden noise uncertainty, and user geometry—matches a real dense-urban deployment closely enough that the policy trained in simulation delivers the reported covert capacity, fairness, and detection-error performance in practice; a large sim-to-real gap would invalidate the claimed gains.

Editorial extensions

If this is right

  • If the central claim holds, a single aerial platform with an active STAR-RIS can act as a covert relay for GEO satellite links in dense urban environments without any dedicated jamming device, since covertness is achieved through the relay's own power and phase control under environmental noise uncertainty.
  • The closed-form covert constraint gives a per-slot, checkable bound on the power arriving at the Warden, so any candidate trajectory and beamforming policy can be tested for covertness before deployment.
  • The GDPG algorithm's design—diffusion-model policy plus action gradient—provides a general template for other high-dimensional resource-allocation problems where strict constraints make most actions illegal and rewards are sparse.
  • The reported inference times (tens of milliseconds, below the GEO propagation delay) indicate the controller could run online on an embedded board, making the scheme deployable in real time if the simulation environment is representative.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Extension: The covertness guarantee hinges on the assumed Warden noise uncertainty ($\rho = 3$ dB in the simulations); a Warden with a calibrated low-uncertainty radiometer would shrink the feasible region, so the practical margin of the scheme is set by how conservative that uncertainty budget is.
  • Extension: The same GDPG machinery could be transferred to LEO satellite handover or terrestrial UAV relay problems with eavesdroppers, replacing the STAR-RIS phase/amplitude model with the relevant channel model and retaining the diffusion-policy exploration benefit.
  • Extension: Since the reward penalty coefficients for covert, power, and position violations are not numerically specified, a direct ablation sweeping those coefficients would clarify whether the covert constraint is enforced by the penalties or by the action-gradient refinement, a test the paper does not report.
  • Extension: A field experiment with a real Warden radiometer measuring empirical detection error probability under the trained policy would be the direct validation of the covertness claim and would expose any sim-to-real gap.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 4 minor

Summary. This paper proposes an aerial active STAR-RIS (AASTAR-RIS) mounted on a low-altitude platform to relay covert GEO satellite signals to multiple ground users in a dense urban environment. The authors derive the minimal detection error probability under Warden noise uncertainty with perfect Warden CSI, convert the covert requirement into a per-slot constraint, and formulate an optimization problem (ASCCOP) that maximizes the sum of Jain-fair channel capacities by jointly optimizing the platform trajectory and the RIS transmission coefficients. Because the problem is non-convex and long-term, the authors reformulate it as an MDP and propose GDPG, a diffusion-model-based deterministic policy gradient algorithm with an action-gradient improvement mechanism. Simulations compare GDPG with DRL benchmarks and ablation baselines, and a Raspberry Pi test reports inference latency.

Significance. The covert-constraint derivation is careful and parameter-free: the minimal DEP expression in Eq. (15) and the resulting inequality in Eq. (16) follow from standard noise-uncertainty modeling, and the capacity expression in Eq. (7) correctly accounts for active-RIS amplification noise. If the optimization problem were correctly constrained, the AASTAR-RIS concept combined with GDPG would be a useful design for covert satellite-terrestrial downlinks, and the use of diffusion policies for constrained continuous control is of interest to the DRL-for-wireless community. The practicality test on Raspberry Pi is a useful addition. However, the central performance claims rest entirely on single-run simulator results, and one load-bearing constraint in the problem formulation is dimensionally inconsistent, so the reported capacity and covertness gains are not yet established.

major comments (2)
  1. [Section 3.2, Eq. (18f)] The active-RIS power budget omits the incident satellite signal power. With the received signal at the RIS equal to sqrt(p_a g_a) h_ar[n] s_i[n] + z_r[n] as in Eq. (6), the expected output power of the RIS is p_a g_a ||Phi[n] h_ar[n]||^2 + sigma_r^2 ||Phi[n]||^2, not ||Phi[n] h_ar[n]||^2 + sigma_r^2 ||Phi[n]||^2. Table 2 sets p_a = 59 dBW/MHz and g_a = 51 dBi, so the omitted factor is about 10^11 in linear units; the constraint as written is also dimensionally inconsistent because ||Phi h_ar||^2 is dimensionless while sigma_r^2 ||Phi||^2 is a power. Since P_active_max is never reported, the feasible set used in training cannot be checked, and the optimized beamforming may violate the true power budget. Correcting this requires reformulating Eq. (18f) and the corresponding penalty term in Eq. (21), and re-running the simulations; the performance claims in Section 5 are not established as achievable under the current formulation.
  2. [Section 5.2, Figs. 5-10] All performance comparisons are single-curve training results with no averaging over random seeds and no error bars or confidence intervals. DRL training is stochastic, and the reported gaps between GDPG and TD3/SAC/VAE-DPG may be within run-to-run variance; reporting at least five seeds with shaded interquartile ranges or confidence bands is necessary to support the claim that GDPG "significantly outperforms" the benchmarks. In addition, the penalty coefficients r_pc, r_pr, and r_pp in Eq. (21) are never given in Table 2, and P_active_max is not specified; these parameters determine how strictly the covert and power constraints are enforced during training, so the current results are not reproducible or verifiable.
minor comments (4)
  1. [Abstract and Section 1] The acronym is inconsistent: the abstract of the provided manuscript uses "AAT-RIS" and "aerial active transmissive reconfigurable intelligent surface," while the body and contributions consistently use "AASTAR-RIS" and "aerial active simultaneously transmitting and reflecting reconfigurable intelligent surface." Please unify the terminology.
  2. [Section 4.1.2, Eq. (20)] The stated state-space dimension 2M(K+1)+3K+9 does not match the listed state components. Counting the 2D positions (2), user coordinates (2K), Warden coordinates (2), the real/imaginary decompositions of the Mx1 complex channels h_ar and h_r1,...,h_rK (2M(K+1)), the previous action of dimension 2+2M, the previous K capacities, and the previous reward gives 2MK+4M+3K+7; this mismatch propagates to the space-complexity expressions in Section 4.4.1 and should be corrected.
  3. [Section 4.4.1] The training-complexity expressions are internally inconsistent: the opening sentence gives O(GN(B+C+(4+T)|theta|+6|phi|)), while the bullet summary concludes O(GN(B+2|theta|+4|phi|)) and drops the T|theta| term from the diffusion updates. These formulas should be reconciled.
  4. [Throughout] There are several minor typos and grammatical issues, including "fails to exceed" in Eq. (18f), "AASATR-RIS" in Section 3.3, and the ungrammatical sentence beginning "Let h_ar[n] and h_rk[n] stand for the channel gains from ..." in Section 2.3. A careful proofread is recommended.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the covert-constraint derivation is self-contained and parameter-free, and the self-cited GDM/action-gradient components are validated by the paper's own simulations against independent benchmarks.

full rationale

The paper's derivation chain is self-contained. The minimal DEP in Eq. (15) is obtained from the modeled radiometer test (Eqs. 8-12) and the noise-uncertainty distribution (Eq. 11) by direct integration and optimization of the Warden's threshold, with no fitted constants; the covert requirement (16) is an algebraic reformulation of ξ* ≥ 1−ε. The ASCCOP (18) is then the stated objective subject to that derived constraint, and the DRL reward (21) is the standard Lagrangian-style penalty version of the same objective and constraints. No equation in this chain reduces to another by construction: the Warden-channel term ι[n] is computed from the physical communication model (6)-(8), not from the optimization objective, and the penalty coefficients r_pc, r_pr, r_pp are hyperparameters, not fitted predictions renamed as results. The GDM policy representation and action-gradient update borrow from the authors' prior work Ref. [38], but that reference is a cited algorithm component and the paper's performance claims are generated by its own simulations against DDPG, TD3, SAC, and ablation baselines; the self-citation therefore does not serve as an unverified premise that forces the reported gains. The simulation measures covertness with the same analytical constraint used in the reward, which is a validation-loop limitation, but because that metric is the true modeled DEP and the comparison across algorithms is independent, this is not a derivation-level circularity. I also note the apparent omission of p_a g_a in the active-RIS power budget (18f) relative to Eq. (6), but that is a physical modeling/correctness concern, not a circularity. No specific equation was found to be equivalent to its input by construction.

Assumptions & free parameters 2 free parameters · 5 assumptions · 0 invented entities

The central derivation is built from standard covert-communication assumptions (noise uncertainty, radiometer testing). The only hand-chosen quantities that materially affect the reported performance are the DRL reward penalties (unreported) and the noise uncertainty parameter. No new physical entities are introduced; the AASTAR-RIS is an assembly of existing components.

free parameters (2)
  • Reward penalty coefficients r_pc, r_pr, r_pp
    Hand-chosen weights in Eq. (21) that balance hidden-transmission, power, and trajectory violations; values are never reported, yet they shape the trained policy and final performance.
  • Warden noise uncertainty rho = 3 dB
    Chosen simulation parameter that sets the covert constraint in Eq. (16); results are specific to this uncertainty level.
assumptions (5)
  • domain assumption Rician fading channel model with LoS steering vectors (Eqs. 3-5)
    The channel from GEO satellite to RIS and from RIS to users and Warden is assumed Rician with specified factors, which is standard but not validated against measurement.
  • domain assumption Warden noise power is log-uniform in [sigma^2/rho, rho*sigma^2] (Eq. 11)
    Adopted from Ref. [29]; the covert constraint depends on this uncertainty model.
  • domain assumption Warden uses a radiometer with L approaching infinity and has perfect CSI
    Section 2.5; this gives the worst-case minimal DEP, but a real Warden may use a different detector or have imperfect CSI.
  • domain assumption All STAR-RIS elements operate in full transmission mode with horizontal mounting
    Section 2.2; ignores reflection mode and 3D orientation effects.
  • ad hoc to paper Simulation environment is representative of real deployment
    Section 5; all performance claims come from the authors' own simulator with synthetic channels and fixed user and Warden placements.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Active RIS-Empowered Covert Satellite-Terrestrial Communications." pith.science (2026). https://pith.science/paper/AZ65BEZ4

@misc{pith2026250416146,
  author       = {Pith},
  title        = {Pith review of: Active RIS-Empowered Covert Satellite-Terrestrial Communications},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/AZ65BEZ4}},
  note         = {Machine review of arXiv:2504.16146}
}
read the original abstract

An integration of satellites and terrestrial networks is crucial for enhancing performance of next-generation communication systems. However, the networks are hindered by the long-distance path loss and security risks in urban canyons. In this work, we propose a satellite-terrestrial covert communication system assisted by the aerial active transmissive reconfigurable intelligent surface (AAT-RIS) to improve the channel capacity while ensuring the transmission covertness. Specifically, we first derive the minimal detection error probability (DEP) under the worst condition that the Warden has perfect channel state information. Then, we formulate an AAT-RIS-assisted satellite-terrestrial covert communication optimization problem (ASCCOP) to maximize the sum of the fair channel capacity for all ground users while meeting the strict covert constraint, by jointly optimizing the trajectory and active beamforming of the AAT-RIS. Due to the challenges posed by the complex and high-dimensional state-action spaces as well as the need for efficient exploration in dynamic environments, we propose a generative deterministic policy gradient (GDPG) algorithm, which is a generative deep reinforcement learning-based method to solve the online ASCCOP. Concretely, the generative diffusion model is utilized as the policy representation of the proposed algorithm to enhance the exploration process by generating diverse and high-quality samples through a series of denoising steps. Moreover, we incorporate an action gradient mechanism to accomplish the policy improvement of the proposed algorithm, which refines the better state-action pairs through the gradient ascent. Simulation results demonstrate that the proposed approach significantly outperforms important benchmarks, and also validate the robustness under different algorithm parameters and environment settings.

Figures

Figures reproduced from arXiv: 2504.16146 by the authors.

Figure 1
Figure 1. An illustration of the covert satellite-terrestrial downlink communi [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. Comparison of the policy improvement between the conventional [PITH_FULL_IMAGE:figures/full_fig_p009_2.png] view at source ↗
Figure 3
Figure 3. The overall architecture of the proposed GDPG algorithm to solve the ASCCOP, where GDM is used to execute the policy representation of the GDPG algorithm and action gradient mechanism is introduced to enable the policy improvement of the GDPG algorithm. Algorithm 2: GDPG Algorithm Training Procedure 1 Initialize GDM network parameters θ, critic network parameters ϕ1 and ϕ2 as well as their corresponding target netwo… view at source ↗
Figures from the paper (7 more)
Figure 4
Figure 4. Figure 4: Architecture of GDM network with Mish activation function [42] [PITH_FULL_IMAGE:figures/full_fig_p010_4.png]
Figure 5
Figure 5. Figure 5: Performance comparison on different approaches. (a) Mean sum [PITH_FULL_IMAGE:figures/full_fig_p011_5.png]
Figure 6
Figure 6. Figure 6: Comparison of convergence curves of the proposed GDPG algorithm and some state-of-the-art DRL algorithms. (a) Reward per episode (b) Mean sum channel capacity per step. (c) Mean fairness index per step. (d) Number of covert constraint violations per episode. lack the m…
Figure 7
Figure 7. Figure 7: Performance evaluations on different diffusion steps [PITH_FULL_IMAGE:figures/full_fig_p012_7.png]
Figure 8
Figure 8. Figure 8: Performance evaluations on different learning rates. (a) Reward [PITH_FULL_IMAGE:figures/full_fig_p013_8.png]
Figure 9
Figure 9. Figure 9: Performance evaluations on different covert requirements [PITH_FULL_IMAGE:figures/full_fig_p013_9.png]
Figure 11
Figure 11. Figure 11: Practicality test. (a) Raspberry Pi 4 Model B test platform. (b) [PITH_FULL_IMAGE:figures/full_fig_p014_11.png]

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Large Language Models for Next-Generation Wireless Network Management: A Survey and Tutorial

    cs.NI 2025-09 conditional novelty 4.0 of 10

    A survey and tutorial that organizes LLM-enabled wireless network optimization into formulation, solution, and verification stages, with case studies drawn from the authors' own prior papers.

Reference graph

Works this paper leans on

46 extracted references · 42 canonical work pages · cited by 1 Pith paper

  1. [9]

    Covert communication in ultra-dense LEO satellite systems with interference uncertainty,

    L. Zhang, Z. Chen, C. Jiang, and L. Yin, “Covert communication in ultra-dense LEO satellite systems with interference uncertainty,” inProc. IEEE Int. Conf. Commun. (ICC), Denver, CO, USA, Jun. 9-13 2024, pp. 1255–1260

    work page 2024

  2. [16]

    Covert com- munication in ultra-dense LEO satellite systems with interference uncertainty,

    P . Hui, L. Guan, Z. Li, C. Li, W. Gao, and H. Zhang, “Covert com- munication in ultra-dense LEO satellite systems with interference uncertainty,” inProc. IEEE Int. Conf. Commun. (ICC), Denver, CO, USA, Jun. 9-13 2024, pp. 1974–1979

    work page 2024

  3. [1]

    Revolutionizing future connectivity: A contemporary survey on AI-empowered satellite-based non- terrestrial networks in 6G,

    S. Mahboob and L. Liu, “Revolutionizing future connectivity: A contemporary survey on AI-empowered satellite-based non- terrestrial networks in 6G,”IEEE Commun. Surv. T utorials, vol. 26, no. 2, pp. 1279–1321, 2nd Quart., 2024

    work page 2024

  4. [2]

    On the probability of Line-of-Sight in urban environments,

    A. Al-Hourani, “On the probability of Line-of-Sight in urban environments,”IEEE Wirel. Commun. Lett., vol. 9, no. 8, pp. 1178– 1181, Aug. 2020

    work page 2020

  5. [3]

    Aerial Secure Collaborative Communications under Eavesdropper Collusion in Low-altitude Economy: A Generative Swarm Intelligent Approach

    J. Li, G. Sun, Q. Wu, S. Liang, J. Wang, D. Niyato, and D. I. Kim, “Aerial secure collaborative communications under eavesdropper collusion in low-altitude economy: A generative swarm intelli- gent approach,”arXiv preprint arXiv:2503.00721, Mar. 2025, doi: 10.48550/arXiv.2503.00721

    work page Pith review arXiv doi:10.48550/arxiv.2503.00721 2025

  6. [4]

    Joint optimiza- tion of trajectory, propulsion, and thrust powers for covert UAV- on-UAV video tracking and surveillance,

    S. Hu, W. Ni, X. Wang, A. Jamalipour, and D. Ta, “Joint optimiza- tion of trajectory, propulsion, and thrust powers for covert UAV- on-UAV video tracking and surveillance,”IEEE T rans. Inf. Forensics Secur., vol. 16, pp. 1959–1972, 2021

    work page 1959

  7. [5]

    Collaborative communication and computation for secure UAV-enabled MEC against active aerial eavesdropping,

    Y. Ding, Q. Zhang, W. Lu, N. Zhao, A. Nallanathan, X. Wang, and X. Yang, “Collaborative communication and computation for secure UAV-enabled MEC against active aerial eavesdropping,” IEEE T rans. Wirel. Commun., vol. 23, no. 11, pp. 15 915–15 929, Nov. 2024

    work page 2024

  8. [6]

    Two- way aerial secure communications via distributed collaborative beamforming under eavesdropper collusion,

    J. Li, G. Sun, Q. Wu, S. Liang, P . Wang, and D. Niyato, “Two- way aerial secure communications via distributed collaborative beamforming under eavesdropper collusion,” inProc. IEEE Conf. Comput. Commun. (INFOCOM), Vancouver, Canada, May 20-23, 2024, pp. 331–340

    work page 2024

Show all 46 references
  1. [7]

    Covert communications: A comprehensive survey,

    X. Chen, J. An, Z. Xiong, C. Xing, N. Zhao, F. R. Yu, and A. Nal- lanathan, “Covert communications: A comprehensive survey,” IEEE Commun. Surv. T utorials, vol. 25, no. 2, pp. 1173–1198, 2nd Quart., 2023

    2023

  2. [8]

    Covert communication assisted by UAV-IRS,

    C. Wang, X. Chen, J. An, Z. Xiong, C. Xing, N. Zhao, and D. Niy- ato, “Covert communication assisted by UAV-IRS,”IEEE T rans. Commun., vol. 71, no. 1, pp. 357–369, Jan. 2023

    2023

  3. [10]

    Robust transmission design for covert satellite communication systems with dual-CSI uncer- tainty,

    H. Jia, Y. Wang, W. Wu, and J. Yuan, “Robust transmission design for covert satellite communication systems with dual-CSI uncer- tainty,”IEEE Internet Things J., vol. 12, no. 12, pp. 21 892–21 903, Jun. 2025

    2025

  4. [11]

    Performance analysis of covert communication based on integrated satellite multiple terrestrial relay networks,

    Z. Wu, H. Shuai, R. Liu, K. Guo, and S. Zhu, “Performance analysis of covert communication based on integrated satellite multiple terrestrial relay networks,” inProc. 2022 IEEE 8th Int. Conf. Comput. Commun. (ICCC), Chengdu, China, Dec. 9-12 2022, pp. 380–385

    2022

  5. [12]

    RIS-assisted covert transmission in satellite-terrestrial communication systems,

    D. Song, Z. Yang, G. Pan, S. Wang, and J. An, “RIS-assisted covert transmission in satellite-terrestrial communication systems,”IEEE Internet Things J., vol. 10, no. 22, pp. 19 415–19 426, Nov. 2023

    2023

  6. [13]

    Covert communica- tion in satellite-terrestrial systems with a full-duplex receiver,

    Z. Guo, R. Sun, J. He, Y. Shen, and X. Jiang, “Covert communica- tion in satellite-terrestrial systems with a full-duplex receiver,” in Proc. 2024 Int. Conf. Satell. Internet (SAT-NET), Xi’an City, China, Oct. 25-27, 2024, pp. 72–77

    2024

  7. [14]

    Covert satel- lite communication over overt channel: A randomized gaussian signalling approach,

    H. Yu, J. Yu, J. Liu, Y. Li, N. Ye, K. Yang, and J. An, “Covert satel- lite communication over overt channel: A randomized gaussian signalling approach,”IEEE T rans. Aerosp. Electron. Syst., vol. 61, no. 2, pp. 2355–2368, Apr. 2025

    2025

  8. [15]

    Re- configurable intelligent surface-assisted multisatellite cooperative downlink beamforming,

    K. Feng, T. Zhou, T. Xu, X. Chen, H. Hu, and C. Wu, “Re- configurable intelligent surface-assisted multisatellite cooperative downlink beamforming,”IEEE Internet Things J., vol. 11, no. 13, pp. 23 222–23 235, Jul. 2024

    2024

  9. [17]

    Minimization of age of information for satellite-terrestrial covert communication with a full-duplex receiver,

    Y. Cao, Z. Guo, Q. Miao, R. Sun, J. He, and X. Li, “Minimization of age of information for satellite-terrestrial covert communication with a full-duplex receiver,” inProc. Int. Conf. Networking Network Appl. (NaNA), Yinchuan City, China, Aug. 9-12, 2024, pp. 242–246

    2024

  10. [18]

    Joint optimization of beamforming and noise injection for covert downlink transmis- sions in cell-free internet of things networks,

    J. Xing, T. Lv, W. Li, W. Ni, and A. Jamalipour, “Joint optimization of beamforming and noise injection for covert downlink transmis- sions in cell-free internet of things networks,”IEEE Internet Things J., vol. 11, no. 6, pp. 10 525–10 536, Mar. 2024

    2024

  11. [19]

    Integrated STAR-RIS and UAV for satellite IoT communications: An energy-efficient approach,

    W. D. Lukito, W. Xiang, P . Lai, P . Cheng, C. Liu, K. Yu, and X. Zhu, “Integrated STAR-RIS and UAV for satellite IoT communications: An energy-efficient approach,”IEEE Internet Things J., vol. 12, no. 9, pp. 11 356–11 371, May 2025

    2025

  12. [20]

    Intelligent reflecting surface- aided LEO satellite communication: Cooperative passive beam- forming and distributed channel estimation,

    B. Zheng, S. Lin, and R. Zhang, “Intelligent reflecting surface- aided LEO satellite communication: Cooperative passive beam- forming and distributed channel estimation,”IEEE J. Sel. Areas Commun., vol. 40, no. 10, pp. 3057–3070, Oct. 2022

    2022

  13. [21]

    Deep learning-based CSI feedback for RIS-assisted multi-user systems,

    J. Guo, X. Yang, C. Wen, S. Jin, and G. Y. Li, “Deep learning-based CSI feedback for RIS-assisted multi-user systems,”IEEE T rans. Commun., vol. 73, no. 7, pp. 4974–4989, Jul. 2025

    2025

  14. [22]

    Achieving covert wireless communications using a full-duplex receiver,

    K. Shahzad, X. Zhou, S. Yan, J. Hu, F. Shu, and J. Li, “Achieving covert wireless communications using a full-duplex receiver,” IEEE T rans. Wirel. Commun., vol. 17, no. 12, pp. 8517–8530, Dec. 2018

    2018

  15. [23]

    Joint power and beamformer optimization in multi-antenna relay covert system: Exploiting public users as shelter,

    R. He, G. Li, J. Chen, H. Wang, X. Guan, Y. Xu, W. He, and Y. Xu, “Joint power and beamformer optimization in multi-antenna relay covert system: Exploiting public users as shelter,”IEEE T rans. Wirel. Commun., vol. 24, no. 1, pp. 385–400, Jan. 2025

    2025

  16. [24]

    Simultaneously transmitting and reflecting (STAR) RIS aided wireless communi- cations,

    X. Mu, Y. Liu, L. Guo, J. Lin, and R. Schober, “Simultaneously transmitting and reflecting (STAR) RIS aided wireless communi- cations,”IEEE T rans. Wirel. Commun., vol. 21, no. 5, pp. 3083–3098, May 2022

    2022

  17. [25]

    Zheng, W

    Z. Zheng, W. Jing, Z. Lu, Q. Wu, H. Zhang, and D. Gesbert, “Co- operative multi-satellite and multi-RIS beamforming: Enhancing JOURNAL OF LATEX CLASS FILES, VOL. X, NO. X, DECEMBER 2025 15 LEO SatCom and mitigating LEO-GEO intersystem interference,” IEEE J. Sel. Areas Commun.,...

    2025

  18. [26]

    STAR-RIS aided covert communication in UAV air-ground networks,

    Q. Wang, S. Guo, C. Wu, C. Xing, N. Zhao, D. Niyato, and G. K. Karagiannidis, “STAR-RIS aided covert communication in UAV air-ground networks,”IEEE J. Sel. Areas Commun., vol. 43, no. 1, pp. 245–259, Jan. 2025

    2025

  19. [27]

    Aerial intelligent reflecting surface: Joint placement and passive beamforming design with 3D beam flattening,

    H. Lu, Y. Zeng, S. Jin, and R. Zhang, “Aerial intelligent reflecting surface: Joint placement and passive beamforming design with 3D beam flattening,”IEEE T rans. Wirel. Commun., vol. 20, no. 7, pp. 4128–4143, Jul. 2021

    2021

  20. [28]

    Joint power allocation and rate control for rate splitting multiple access networks with covert communications,

    N. Q. Hieu, D. T. Hoang, D. Niyato, D. N. Nguyen, D. I. Kim, and A. Jamalipour, “Joint power allocation and rate control for rate splitting multiple access networks with covert communications,” IEEE T rans. Commun., vol. 71, no. 4, pp. 2274–2287, Apr. 2023

    2023

  21. [29]

    Robust covert multicasting aided by STAR-RIS with hardware impairment,

    J. Zhang, W. Wang, Y. Gao, W. Lu, N. Zhao, and D. Niyato, “Robust covert multicasting aided by STAR-RIS with hardware impairment,”IEEE T rans. Wirel. Commun., vol. 23, no. 11, pp. 16 172–16 186, Nov. 2024

    2024

  22. [30]

    Optimal tradeoff between sum-rate efficiency and Jain’s fairness index in resource allocation,

    A. B. Sediq, R. H. Gohary, R. Schoenen, and H. Yanikomeroglu, “Optimal tradeoff between sum-rate efficiency and Jain’s fairness index in resource allocation,”IEEE T rans. Wirel. Commun., vol. 12, no. 7, pp. 3496–3509, Jul. 2013

    2013

  23. [31]

    Computing over the sky: Joint UAV trajectory and task offloading scheme based on optimization- embedding multi-agent deep reinforcement learning,

    X. Li, X. Du, N. Zhao, and X. Wang, “Computing over the sky: Joint UAV trajectory and task offloading scheme based on optimization- embedding multi-agent deep reinforcement learning,”IEEE T rans. Commun., vol. 72, no. 3, pp. 1355–1369, Mar. 2024

    2024

  24. [32]

    Collaborative ground-space communications via evolutionary multi-objective deep reinforcement learning,

    J. Li, G. Sun, Q. Wu, D. Niyato, J. Kang, A. Jamalipour, and V . C. M. Leung, “Collaborative ground-space communications via evolutionary multi-objective deep reinforcement learning,”IEEE J. Sel. Areas Commun., vol. 42, no. 12, pp. 3395–3411, Dec. 2024

    2024

  25. [33]

    Meta-reinforcement learning for timely and energy-efficient data collection in solar- powered UAV-assisted IoT networks,

    M. Yi, X. Wang, J. Liu, Y. Zhang, and R. Hou, “Meta-reinforcement learning for timely and energy-efficient data collection in solar- powered UAV-assisted IoT networks,”IEEE T rans. Commun., Early Access, 2025, doi: 10.1109/TCOMM.2025.3543185

    2025

  26. [34]

    Deterministic policy gradient algorithms,

    D. Silver, G. Lever, N. Heess, T. Degris, D. Wierstra, and M. A. Riedmiller, “Deterministic policy gradient algorithms,” inProc. 31th Int. Conf. Mach. Learn. (ICML), Beijing, China, Jun. 21-25 2014, pp. 387–395

    2014

  27. [35]

    Diffusion policies as an expressive policy class for offline reinforcement learning,

    Z. Wang, J. J. Hunt, and M. Zhou, “Diffusion policies as an expressive policy class for offline reinforcement learning,” inProc. 11th Int. Conf. Learn. Representations (ICLR), Kigali, Rwanda, May 1-5, 2023, pp. 1–17

    2023

  28. [36]

    Policy representation via diffu- sion probability model for reinforcement learning,

    L. Yang, Z. Huang, F. Lei, Y. Zhong, Y. Yang, C. Fang, S. Wen, B. Zhou, and Z. Lin, “Policy representation via diffu- sion probability model for reinforcement learning,”arXiv preprint arXiv:2305.13122, May 2023, doi: 10.48550/arXiv.2305.13122

    2023 doi arXiv

  29. [37]

    Decision-making with auto-encoding variational bayes,

    R. Lopez, P . Boyeau, N. Yosef, M. I. Jordan, and J. Regier, “Decision-making with auto-encoding variational bayes,” inProc. Adv. Neural Inf. Process Syst. 33, NeurIPS 2020, Dec. 6-12, 2020

    2020

  30. [38]

    Multi-objective aerial collaborative secure communication opti- mization via generative diffusion model-enabled deep reinforce- ment learning,

    C. Zhang, G. Sun, J. Li, Q. Wu, J. Wang, D. Niyato, and Y. Liu, “Multi-objective aerial collaborative secure communication opti- mization via generative diffusion model-enabled deep reinforce- ment learning,”IEEE T rans. Mob. Comput., vol. 24, no. 4, pp. 3041– 3058, Apr. 2025

    2025

  31. [39]

    Diffusion models beat GANs on image synthesis,

    P . Dhariwal and A. Q. Nichol, “Diffusion models beat GANs on image synthesis,” inProc. Adv. Neural Inf. Process. Syst. 2021 (NIPS), virtual, Dec. 6-14 2021, pp. 8780–8794

    2021

  32. [40]

    Addressing function ap- proximation error in actor-critic methods,

    S. Fujimoto, H. van Hoof, and D. Meger, “Addressing function ap- proximation error in actor-critic methods,” inProc. 35th Int. Conf. Mach. Learn. (ICML), Stockholmsm ¨assan, Stockholm, Sweden, Jul. 10-15, 2018, pp. 1582–1591

    2018

  33. [41]

    Soft actor-critic algorithms and applications,

    T. Haarnoja, A. Zhou, K. Hartikainen, G. Tucker, S. Ha, J. Tan, V . Kumar, H. Zhu, A. Gupta, P . Abbeel, and S. Levine, “Soft actor-critic algorithms and applications,”arXiv preprint arXiv:1812.05905, Dec. 2018, doi:10.48550/arXiv.1812.05905

    2018 doi arXiv

  34. [42]

    Mish: A self regularized non-monotonic neural ac- tivation function,

    D. Misra, “Mish: A self regularized non-monotonic neural ac- tivation function,”arXiv preprint arXiv:1908.08681, Aug. 2019, doi:10.48550/arXiv.1908.08681

    1908 doi arXiv

  35. [43]

    2023, https://itecspec.com/archive/ 3gpp-specification-tr-38-821/

    3GPP TR 38.821,Solutions for NR to support Non-T errestrial Net- works (NTN), V16.2.0, Mar. 2023, https://itecspec.com/archive/ 3gpp-specification-tr-38-821/

    2023

  36. [44]

    Embed- ded sensors communication technologies computing platforms and machine learning for UAVs: A review,

    A. N. Wilson, A. Kumar, A. Jha, and L. R. Cenkeramaddi, “Embed- ded sensors communication technologies computing platforms and machine learning for UAVs: A review,”IEEE Sensors J., vol. 22, no. 3, pp. 1807–1826, Feb. 2022

    2022

  37. [45]

    New multicarrier modulation for satellite-ground transmission in space information networks,

    D. Chen, W. Wang, and T. Jiang, “New multicarrier modulation for satellite-ground transmission in space information networks,” IEEE Netw., vol. 34, no. 1, pp. 101–107, Jan. 2020

    2020

  38. [46]

    Unmanned aerial vehicle abstraction layer: An abstrac- tion layer to operate unmanned aerial vehicles,

    F. Real, A. Torres-Gonz ´alez, P . Ram ´on-Soria, J. Capit ´an, and A. Ollero, “Unmanned aerial vehicle abstraction layer: An abstrac- tion layer to operate unmanned aerial vehicles,”Int. J. Adv. Robot. Syst., vol. 17, no. 4, pp. 1–13, 2020. Chuang Zhangreceived the B.S. degre...

    2020

Pith tools

Reviewed August 16, 2026 · model on record in the stance chip above.