---
格式版本: 2
标题: "Covert Communication with Spatially Heterogeneous User Cooperation Against a Geometry-Aware Warden"
原文链接: "https://arxiv.org/abs/2608.10446"
发布日期: "2026-08-11"
发布时间校准状态: "found"
发布时间需复核: "否"
发布时间来源: "rule:local:strict_original_body"
发布时间证据: "**\\[v1\\]** Tue, 11 Aug 2026 04:00:58 UTC (1,455 KB)"
发布时间校准原因: "规则确认唯一严格发布时间，来源 local:strict_original_body"
发布时间校准置信度: "high"
发布时间候选数量: 18
发布时间严格候选数量: 6
发布时间原页读取状态: "source template page reused from URL open"
发布时间未找到原因: ""
发布时间校准时间: "2026-08-12T11:18:05+08:00"
发布时间仲裁状态: "skipped"
发布时间仲裁尝试次数: 0
发布时间仲裁耗时毫秒: 0
发现时间: "2026-08-12T11:13:54+08:00"
入库时间: "2026-08-12T03:18:05.389Z"
来源平台: "arXiv 学术论文搜索"
搜索渠道: "source_template"
搜索词: "https://arxiv.org/search/?query=deployment&searchtype=all"
匹配关键词:
  - "deployment"
相关厂家:
  []
相关专家:
  []
内容类型: "网页"
抓取工具: "Free Fetch + Defuddle"
清洗工具: "Defuddle Markdown + Defuddle/Readability 正文提取"
原始附件:
  []
AI优质: "否"
AI打分: 0
AI分档: "非优质"
AI质检状态: "不通过"
AI打分理由: "论文内容为隐蔽通信的信号处理，与超节点/AI Rack等主题完全无关。"
AI质检模型: "ali-deepseek-v4-flash"
AI质检时间: "2026-08-12T11:18:16+08:00"
AI主题相关性: 0
AI来源权威性: 0
AI新颖性: 0
AI技术细节: 0
AI商业部署信号: 0
AI完整性: 0
采集批次: "2026年8月12日2点04分20秒"
采集批次ID: "20260812-020420-289"
去重键: "https://arxiv.org/abs/2608.10446"
---

## Electrical Engineering and Systems Science > Signal Processing

## Title:Covert Communication with Spatially Heterogeneous User Cooperation Against a Geometry-Aware Warden

Authors:[Hyeonsik Yeom](https://arxiv.org/search/eess?searchtype=author&query=Yeom,+H), [Jinyoung Lee](https://arxiv.org/search/eess?searchtype=author&query=Lee,+J)

[View PDF](https://arxiv.org/pdf/2608.10446) [HTML (experimental)](https://arxiv.org/html/2608.10446v1)

> Abstract:This paper investigates covert communication in which a single covert user is assisted by multiple spatially distributed non-covert users against a geometry-aware warden. Unlike prior works based on receiver-centric activation, homogeneous channels, or averaged geometry, the proposed framework retains the individual user-to-warden large-scale fading coefficients in both cooperative user activation and the warden's detection analysis. Under the adopted analytical formulation for large-scale user deployments, we establish an on--off activation structure that balances the interference caused at Bob and the interference effectiveness at warden. Based on the resulting aggregate-interference statistics, we derive a closed-form approximation of the detection error probability, the detection threshold that minimizes it, and the minimum number of cooperative users required to satisfy the covert constraint. Then, we reduce the original high-dimensional power-control problem to a one-dimensional piecewise search and develop a low-complexity algorithm that avoids resolution-dependent grid search. The analysis shows that greater warden-side spatial dispersion can reduce the required cooperative users, whereas a larger average user-to-warden distance increases it. Numerical results validate the analysis and show that finite-sample detection approaches the large-sample benchmark, while imperfect user-to-Bob channel estimation mainly reduces the achievable rate through activation errors.

| Comments: |  |
| --- | --- |
| Subjects: | Signal Processing (eess.SP) |
| Cite as: | [arXiv:2608.10446](https://arxiv.org/abs/2608.10446) \[eess.SP\] |
|  | (or [arXiv:2608.10446v1](https://arxiv.org/abs/2608.10446v1) \[eess.SP\] for this version) |
|  | [https://doi.org/10.48550/arXiv.2608.10446](https://doi.org/10.48550/arXiv.2608.10446) |

## Submission history

From: Jinyoung Lee \[[view email](https://arxiv.org/show-email/3de68330/2608.10446)\]  
**\[v1\]** Tue, 11 Aug 2026 04:00:58 UTC (1,455 KB)

[Which authors of this paper are endorsers?](https://arxiv.org/auth/show-endorsers/2608.10446) | Disable MathJax ([What is MathJax?](https://info.arxiv.org/help/mathjax.html))
