Searcharxiv⌕ Search

arXiv · 2610.16770

Digital-Twin-Referenced Belief-Guided Q-Learning for Jammer Identification and Beam-Power Control in a mmWave Model

Abstract

Digital Twin (DT) combined with reinforcement learning (RL) can support adaptive resource allocation and security-aware decision-making by comparing expected and observed network behavior. This paper presents a simulation-based DT reference and a belief-guided Q-learning (BGQL) for joint jammer identification and beam-power control in a site-specific 28-GHz network. For each action, the same channel simulator is evaluated under an attack-free and an attacked configuration. Receiver-level residuals are combined with spatial jamming footprints and accumulated to form a normalized suspicion vector. BGQL incorporates this vector into an aggregated state, a belief-concentration reward, and exploratory beam-selection rule. The BGQL scheme is compared with SARSA, Greedy, and Random under matched attacker sets. Across 30 paired Monte Carlo runs in four configurations, with the number of active jammers supplied to every method, BGQL achieves mean aggregate full-band link-rate scores of approximately 437.4--564.2~Mbit/s and rate-to-device-power scores of 60.37--76.79~Mbit/J. Its detection accuracy is 100\% in one-jammer configurations and approximately 78\%--81\% in two-jammer configurations. BGQL requires approximately 80--130~s per run, compared with 5--14~s for SARSA, reflecting evaluation of 625 beam pairs during exploratory steps. These findings provide a matched-model simulation proof of concept for DT-referenced belief-guided learning for security-aware beam-power control in 6G networks.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Parmida Geranmayeh, Onur Günlü. 2026-10-12. Digital-Twin-Referenced Belief-Guided Q-Learning for Jammer Identification and Beam-Power Control in a mmWave Model. https://arxiv.org/abs/2610.16770

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

KEEP EXPLORING

Related papers

Quasi-twisted codes and their connection with additive constacyclic codes over finite fields

In this paper, we study quasi-twisted codes and their relationship with additive constacyclic codes through a polynomial-based approach. We first present a polynomial characterization of quasi-twisted codes over finite fields analogous to quasi-cyclic codes and determine Euclidean, Hermitian, and symplectic duals of quasi-twisted codes with index $2$. Additionally, we provide necessary and sufficient conditions for the self-orthogonality of appropriate quasi-twisted codes. Next, we explore a one-to-one correspondence between quasi-twisted codes of length $lm$ with index $l$ over $\mathbb{F}_q$ and additive constacyclic codes of length $m$ over $\mathbb{F}_{q^l}$. We establish relationships between trace inner products in the additive setting and Euclidean, symplectic inner products in the quasi-twisted setting. Using these relations and the correspondence, we determine the dual of additive constacyclic codes with respect to the trace inner products. As a consequence, we conclude that determining the trace Euclidean dual and trace Hermitian dual of an additive constacyclic code is equivalent to determining the Euclidean and symplectic dual of the corresponding quasi-twisted code.

cs.IT↗

Performance Analysis of Pinching Antenna Systems Enabled NOMA Communications

Pinching antenna systems (PASS) have the advantages in the perspective of flexible antenna reconfiguration, line-of-sight (LoS) creation, and scalability features. To highlight the ascendancy of PASS, we survey the integration of PASS into non-orthogonal multiple access (NOMA) networks. The locations of nodes are randomly distributed within a circular coverage region. The influencing factors of line-of-sight (LoS) and non-line-of-sight (NLoS) propagation links from PASS to non-orthogonal nodes are taken into considered. To characterize performance of PASS-NOMA, we deduce the blockage probability and ergodic data rates expressions of two nodes over LoS/NLoS fading channels. In light of these theoretical results, the infinite diversity gain are also analyzed with near node n under non-ideal successive interference cancellation (NISIC) and far node f over LoS links. The slopes of ergodic data rate for node n with NISIC and node f were equal to zeros. In addition, the PASS-NOMA system throughput are evaluated in different transmission modes. It is shown from the numerical results that: 1) The blockage outage behaviors of PASS-NOMA networks with LoS/NLoS conditions outperform that of PASS aided traditional orthogonal multiple access (OMA); 2)The employment of PASS enables the larger ergodic data rates relative to PASS-OMA networks; and 3) As the quantity of pinching antennas rises, the performance of PASS-NOMA networks are enhanced over LoS/NLoS propagation links.

cs.IT↗

Deriving Approximate Message Passing from the Convex Gaussian Min-Max Theorem

Approximate message passing (AMP) provides fast iterative algorithms for high-dimensional signal recovery with Gaussian design matrices, while the Convex Gaussian Min--max Theorem (CGMT) gives a static optimization framework for obtaining sharp asymptotic characterizations of convex estimators. Although these two frameworks often lead to the same scalar state-evolution equations, their connection is usually indirect. In this paper, we establish a direct connection between the two for regularized linear regression in the proportional high-dimensional regime. When the CGMT Auxiliary Optimization (AO) and Primary Optimization (PO) give the same primal-dual solution, we show that the CGMT framework recovers the AMP fixed-point equations, including the Onsager correction. We further identify the AO Gaussian vectors with the Gaussian perturbations in the primal and residual AMP channels. For regularized $M$-estimation, the same viewpoint recovers the fixed point of scalar-variance max-sum Generalized AMP (GAMP). These results show that the AMP (and GAMP) fixed-point equations can be recovered from the CGMT framework and may suggest AMP-like algorithms in settings where standard derivations are unavailable.

cs.IT↗