Search arXivSearch

arXiv · 2502.13699

Secure and Green RSMA-Assisted Heterogeneous ISAC

Abstract

This paper investigates sensing, communication, security, and energy efficiency of the heterogeneous integrated sensing and communication networks under challenging operational conditions. We focus on scenarios in which communication performance, security, and sensing accuracy are degraded by interference, eavesdropping, and imperfect channel state information. To this end, we analyze communication and sensing signals within ISAC framework as well as the communication signals of a multicast network based on \emph{rate-splitting multiple access} (RSMA). Then, sensing signal-to-cluster-plus-noise ratio, communication rate, security rate, and \emph{security energy efficiency} (SEE) are evaluated. To simultaneously enhance these system performances, we propose a targeted optimization framework aimed at maximizing SEE. This framework characterizes the sensing-security trade-off by jointly optimizing the transmit \emph{beamforming} (BF) vectors and the echo BF vector to construct green interference using the echo signal, as well as common and private streams generated by RSMA. Particularly, the joint design improves the security rate and reduces power consumption, thereby enabling a higher SEE. Given the non-convex nature of the optimization problem, we present an alternative approach that leverages Taylor series expansion, majorization-minimization, semi-definite programming, and successive convex approximation techniques. Specifically, we decompose the original non-convex and intractable optimization problem into three simplified sub-optimization problems, which are iteratively solved using an alternating optimization strategy. Simulations provide comparisons with state-of-the-art schemes, highlighting the superior efficiency, robustness, and scalability of the proposed joint multi-BF optimization scheme based on RSMA and green interference in improving system performances.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xudong Li, Rugui Yao, Theodoros A. Tsiftsis, Alexandros-Apostolos A. Boulogeorgos. 2026-02-28. Secure and Green RSMA-Assisted Heterogeneous ISAC. https://arxiv.org/abs/2502.13699

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT