Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2510.05247v1

Help | Advanced Search

Computer Science > Information Theory

arXiv:2510.05247v1 (cs)
[Submitted on 6 Oct 2025 ]

Title: Encoded Jamming Secure Communication for RIS-Assisted and ISAC Systems

Title: 编码干扰安全通信用于RIS辅助和ISAC系统

Authors:Hao Yang, Hao Xu, Kai Wan, Sijie Zhao, Robert Caiming Qiu
Abstract: This paper considers a cooperative jamming (CJ)-aided secure wireless communication system. Conventionally, the jammer transmits Gaussian noise (GN) to enhance security; however, the GN scheme also degrades the legitimate receiver's performance. Encoded jamming (EJ) mitigates this interference but does not always outperform GN under varying channel conditions. To address this limitation, we propose a joint optimization framework that integrates reconfigurable intelligent surface (RIS) with EJ to maximize the secrecy rate. In the multiple-input single-output (MISO) case, we adopt a semidefinite relaxation (SDR)-based alternating optimization method, while in the multiple-input multiple-output (MIMO) case, we develop an alternating optimization algorithm based on the weighted sum mean-square-error minimization (WMMSE) scheme. Furthermore, we are the first to incorporate EJ into an integrated sensing and communication (ISAC) system, characterizing the Pareto boundary between secrecy rate and sensing mutual information (MI) by solving the resulting joint optimization problem using a modified WMMSE-based algorithm. Simulation results show that the proposed schemes significantly outperform benchmark methods in secrecy rate across diverse channel conditions and clearly reveal the trade-off between security and sensing.
Abstract: 本文考虑了一个协作干扰(CJ)辅助的保密无线通信系统。传统上,干扰器发送高斯噪声(GN)以增强安全性;然而,GN方案也会降低合法接收机的性能。编码干扰(EJ)可以缓解这种干扰,但在不同的信道条件下并不总能优于GN。为了解决这一限制,我们提出了一种联合优化框架,将可重构智能表面(RIS)与EJ结合,以最大化保密速率。在多输入单输出(MISO)情况下,我们采用基于半定松弛(SDR)的交替优化方法,而在多输入多输出(MIMO)情况下,我们开发了一种基于加权和均方误差最小化(WMMSE)方案的交替优化算法。此外,我们首次将EJ引入集成感知与通信(ISAC)系统,通过使用改进的基于WMMSE的算法求解所得的联合优化问题,表征了保密速率与感知互信息(MI)之间的帕累托边界。仿真结果表明,所提出的方案在各种信道条件下显著优于基准方法,并清楚地揭示了安全性和感知之间的权衡。
Subjects: Information Theory (cs.IT)
Cite as: arXiv:2510.05247 [cs.IT]
  (or arXiv:2510.05247v1 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.2510.05247
arXiv-issued DOI via DataCite

Submission history

From: Yang Hao [view email]
[v1] Mon, 6 Oct 2025 18:10:57 UTC (565 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
license icon view license
Current browse context:
cs.IT
< prev   |   next >
new | recent | 2025-10
Change to browse by:
cs
math
math.IT

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号