Wasserstein Distributionally Robust Joint Receive Beamforming and Power Allocation for Distributed Maritime Sensing Networks Under Limited Samples and Backhaul Constraints

Distributed maritime sensing requires receive-beamforming and power-allocation decisions based on short interference-training records and subject to limited cooperative-link capacity. We formulate a design that maximizes the worst-node signal-to-interference-plus-noise ratio (SINR) with a squared 2-Wasserstein ambiguity set and a radius explicitly selected using an engineering rule. A homogeneous worst-case quadratic form yields a complete second-order cone programming (SOCP) formulation at a fixed SINR threshold. A loaded receive update is distinguished from this exact block, and both are followed by power allocation using the complete robust denominator. A power iteration with upward quantization and a mean-preserving quantized tracker provide hard-budget feasibility checks on a reliable shared broadcast channel. We derive coupled error bounds and a conditional bound on the gap to a centralized power optimum computed using the same data and fixed receive weights; joint stationarity is not established. In 200 paired simulations with known ensemble clutter covariance and a spatial jamming surrogate, certified loading achieves mean worst-node SINRs of 2.663 and 1.928 dB when evaluated using the true covariance and the robust denominator, respectively. Both certified loading and the exact-receive branch have zero observed robust violations, whereas the reduced-denominator diagnostic violates the complete constraint in every trial. A 256-bit round cap is enforced before sending, and small per-round messages do not imply lower traffic over a complete coherent processing interval (CPI): certified loading uses a mean of 20.799 kbit over the 200 core scenes, compared with 20.802 kbit for a matched centralized implementation with one binary64 Hermitian covariance upload, the same three redesign rounds, and a final return. This matched comparison demonstrates no complete-CPI traffic advantage. Independent detector counts, paired confidence intervals, solver statuses, and per-trial feasibility records are released.

Authors

Publication Details

Journal
Preprints.org
Published
2026-11-18
DOI
https://doi.org/10.20944/preprints202611.1818.v1
Primary Topic
Radar Systems and Signal Processing
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Wasserstein Distributionally Robust Joint Receive Beamforming and Power Allocation for Distributed Maritime Sensing Networks Under Limited Samples and Backhaul Constraints

Lishi Cui, Hebin Wang, Zhilu Wu, Donghao Li et al.
Preprints.org
Radar Systems and Signal Processing
preprint

Wasserstein Distributionally Robust Joint Receive Beamforming and Power Allocation for Distributed Maritime Sensing Networks Under Limited Samples and Backhaul Constraints

Lishi Cui, Hebin Wang, Zhilu Wu, Donghao Li, Yila Ma, Wei Li, You Li, Zirao Ding, Yu Wang, Kaiwei Liu, Zihao Wang, Xu Liu
preprint en

Abstract

Distributed maritime sensing requires receive-beamforming and power-allocation decisions based on short interference-training records and subject to limited cooperative-link capacity. We formulate a design that maximizes the worst-node signal-to-interference-plus-noise ratio (SINR) with a squared 2-Wasserstein ambiguity set and a radius explicitly selected using an engineering rule. A homogeneous worst-case quadratic form yields a complete second-order cone programming (SOCP) formulation at a fixed SINR threshold. A loaded receive update is distinguished from this exact block, and both are followed by power allocation using the complete robust denominator. A power iteration with upward quantization and a mean-preserving quantized tracker provide hard-budget feasibility checks on a reliable shared broadcast channel. We derive coupled error bounds and a conditional bound on the gap to a centralized power optimum computed using the same data and fixed receive weights; joint stationarity is not established. In 200 paired simulations with known ensemble clutter covariance and a spatial jamming surrogate, certified loading achieves mean worst-node SINRs of 2.663 and 1.928 dB when evaluated using the true covariance and the robust denominator, respectively. Both certified loading and the exact-receive branch have zero observed robust violations, whereas the reduced-denominator diagnostic violates the complete constraint in every trial. A 256-bit round cap is enforced before sending, and small per-round messages do not imply lower traffic over a complete coherent processing interval (CPI): certified loading uses a mean of 20.799 kbit over the 200 core scenes, compared with 20.802 kbit for a matched centralized implementation with one binary64 Hermitian covariance upload, the same three redesign rounds, and a final return. This matched comparison demonstrates no complete-CPI traffic advantage. Independent detector counts, paired confidence intervals, solver statuses, and per-trial feasibility records are released.

Preprints.org
Radar Systems and Signal Processing
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon