Papers for
military communication teams
Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.
Movable antennas improve wireless signals and fight jamming attacks
Movable Antenna Enabled Anti-Jamming: From Local Optimality Guaranteed Design to a Unified Antenna Position Optimization Framework
Abstract: Anti-jamming capability is of paramount importance in modern wireless communications, yet conventional receivers are severely constrained by their fixed array geometries, which limit the available spatial degrees of freedom and leave performance highly susceptible to strong interference. By contrast, movable antennas (MAs) provide additional spatial degrees of freedom through antenna-position optimization. This paper investigates MA-enabled anti-jamming by jointly optimizing the antenna-position vector (APV) and receive beamformer to maximize the output signal-to-interference-plus-noise ratio (SINR). For the canonical setting with a single jammer and a single line-of-sight (LoS) propagation path on the legitimate link, we develop a damped projected-gradient descent (DPGD) algorithm with low computational complexity, which scales linearly with the number of receive MAs. We establish a generic active strict-saddle landscape for the resulting steering-coherence minimization problem and prove that DPGD converges almost surely to a local minimizer rather than merely to a Karush-Kuhn-Tucker (KKT) point. For the general setting with multiple channel paths on the legitimate link and/or multiple jammers, we derive an equivalent ridge least-squares formulation and develop a low-complexity soft-active projected-gradient (SAPG) algorithm, which also scales linearly with the number of receive MAs. We further show that the proposed antenna position optimization framework applies to both minimum variance distortionless response (MVDR) and zero-forcing (ZF) reception. Numerical results validate the proposed algorithms, demonstrating substantial gains in both anti-jamming performance and computational efficiency.
Digital semantic communication achieves covert transmission with movable antennas
Covert Digital Semantic Communication With Movable Antennas: Constellation Shaping, Spatial Optimization, and Semantic Mapping
Abstract: Digital semantic communication (SemCom) is emerging as a bandwidth-efficient paradigm for next-generation wireless networks by delivering the meaning of a source over finite constellations. However, the broadcast nature of wireless channels exposes transmissions to adversarial wardens, while discrete symbols deviate from the Gaussian signaling assumed by conventional covert communication. In this paper, we propose a covert digital SemCom system assisted by movable antennas (MAs), where the constellation, the antenna positions, and the semantic transceiver are jointly designed to conceal the transmission while preserving the semantic fidelity. Specifically, the maximum covert rate against the optimal detector with unknown noise level is derived in closed-form, which reveals that the legitimate signal-to-noise ratio (SNR) scales with the moment-matching order of the constellation and the spatial gain provided by the MA array. A Gauss-Laguerre ring constellation is then designed to raise the moment-matching order under the peak power constraints, and a covert symbol mapping with rank-to-ring assignment and scrambling is developed to carry the semantics in the ordering of the latent magnitudes. Guided by the derived semantic distortion bound, the semantic encoder and decoder are trained end-to-end through an invertible flow over the designed constellation and MA array. Simulation results demonstrate that the proposed scheme supports a higher achievable covert rate and improves the reconstruction quality by 24% compared to state-of-the-art SemCom schemes.
Polarization control improves hidden wireless communication rates
Polarforming for MIMO Covert Communications
Abstract: Covert communication conceals wireless transmission activity, but conventional multi-antenna designs rely mainly on spatial beamforming and can be constrained by limited spatial degrees of freedom. This paper investigates polarization-reconfigurable antenna (PRA)-aided multiple-input multiple-output (MIMO) covert communication, where Alice and Bob perform transmit and receive polarforming, respectively, and Willie uses a vertically polarized antenna for radiometric detection. We jointly optimize the transmit covariance matrix and the transmit and receive phase shift vectors to maximize Bob's achievable rate under the covertness and transmit power constraints. Under Gaussian signaling, perfect polarized channel state information, and known noise power at Willie, we derive his optimal radiometric threshold and exact minimum detection error probability (DEP) for a finite observation length, and convert the DEP requirement into a deterministic constraint on his received signal power. We further prove that, for a fixed transmission design, positive signal leakage becomes detectable as the observation length tends to infinity. To solve the design problem for a finite observation length, we develop an alternating optimization (AO) algorithm with a generalized water-filling covariance update and closed-form phase updates. Numerical results validate the exact DEP analysis and the rapid convergence of the proposed algorithm. Compared with the sufficient divergence-based condition, the exact covertness constraint permits a $0.99$--$1.12$~dB higher received signal-to-noise ratio (SNR) at Willie, while joint transmit and receive polarforming provides a rate gain of up to $53.8\%$ over the considered benchmark schemes.
Learned decentralized power allocation boosts communication in multi channel wireless ad hoc networks
MANET-GNN: Learned Decentralized Optimization of Power Allocation in Multi-Channel MANETs
Abstract: MANETs enable flexible infrastructure-less wireless connectivity in dynamic and resource-constrained environments. As modern MANETs exploit multiple frequency channels and support heterogeneous traffic patterns, decentralized transmit-power allocation becomes increasingly challenging. We develop a unified learned optimization framework for decentralized power allocation in dynamic multi-hop, multi-channel MANETs. We formulate a constrained end-to-end throughput maximization problem covering unicast, multicast, multicommodity, convergecast, and many-to-many communication. Although centralized and non-convex, this problem serves as an unsupervised training objective for MANET-GNN, a message-passing GNN that operates as a distributed learned optimizer. MANET-GNN uses only local, possibly noisy, CSI and a prescribed number of neighbor message exchanges, enabling low-latency decentralized inference while generalizing across topologies and network sizes. Numerical results show that MANET-GNN achieves centralized-competitive performance across communication frameworks, remains robust to channel uncertainty, and scales effectively across MANET configurations.