Search arXivSearch

arXiv · 2607.11164

Joint Communication and Sensing Design for Integrated Satellite-Terrestrial Maritime Systems

Abstract

Joint communication and sensing has been a key technology in 6G. By integrating sensing into maritime communications, ships can communicate with the base station while sensing the surrounding environment to ensure safe navigation. In this paper, we introduce an integrated satellite-terrestrial maritime system (ISTMS) with joint communication and sensing based on the same radio-frequency signals. Specifically, the terrestrial base station (TBS) and low Earth orbit (LEO) satellite provide communication services for near-shore users (NSUs) and off-shore users (OSUs), respectively, while simultaneously performing target sensing. Based on a differential evolution method (DE), we propose a sensing algorithm, which can enhance the location accuracy and reduce resource consumption. Furthermore, we derive the key performance metrics for both communication and sensing. Through joint beamforming optimization of the TBS and LEO satellite, we maximize the sum rate of maritime users while satisfying target localization accuracy requirements and transmit power constraints. Finally, extensive simulation results demonstrate the effectiveness of the proposed algorithms in terms of location accuracy and transmission rate compared with the baseline algorithms.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kaiwei Xiong, Xiaoming Chen, Ming Ying. 2026-07-13. Joint Communication and Sensing Design for Integrated Satellite-Terrestrial Maritime Systems. https://arxiv.org/abs/2607.11164

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