Searcharxiv⌕ Search

arXiv subjects

Daniel J. Jakubisin

Publications and source records attributed to Daniel J. Jakubisin.

11 recordsLinked to original sources

Hierarchical Federated Learning for Unsupervised Waveform Classification over Tactical MANETs

Distributed radio frequency sensing in contested tactical environments demands collaborative learning across mobile nodes. In ad-hoc networks, learning must occur without persistent backhaul, ground truth labels, or reliable communication links. Traditional federated learning approaches assume either ideal link conditions or supervised training objectives, neither of which holds in practice for deployed MANET platforms. This paper presents a hierarchical federated learning framework for unsupervised waveform classification over tactical MANETs subject to Rayleigh fading, random waypoint mobility, and multi-hop routing loss. Each node trains a local denoising convolutional autoencoder on raw IQ observations without label exchange, learning compact representations through a self-supervised reconstruction objective. A two-stage aggregation protocol elects connectivity-based relay aggregators consistent with OLSR multipoint relay selection, compressing cluster-level model updates before forwarding to a mobile server proxy. Across five random seeds, in-network aggregation reduces attempted transmission bits by 16% on average relative to relay-forward federated averaging at comparable classification performance. Despite mean per-round update drop rates of 21% (hierarchical) and 34% (flat), hierarchical MANET FL attains the highest mean unsupervised representation quality of the three federated conditions tested while also showing substantially lower run-to-run variance than either flat MANET FedAvg or ideal FedAvg; flat routing itself shows no consistent benefit or penalty relative to ideal FedAvg. Performance is assessed using KMeans normalized mutual information and linear probe accuracy on the learned latent embeddings.

eess.SP↗

Federated Parameter-Efficient Adaptation for Interference Mitigation at the Wireless Edge

Dense wireless deployments face co-channel interference from heterogeneous sources that vary across base stations (gNBs in 5G). While centralized DNN-based approaches to interference mitigation have shown strong performance, deploying and adapting these models across distributed gNBs via federated learning (FL) requires transmitting full model updates each round, resulting in a cost that scales poorly with network density. Parameter-efficient fine-tuning (PEFT) reduces this burden by training and communicating only a small fraction of parameters. While traditionally applied to large foundation models, we adapt Low-Rank Adaptation (LoRA) to temporal convolutional neural network architectures for interference suppression, placing low-rank adapters on the dilated convolutional layers. This placement enables LoRA to learn local interference-specific temporal patterns, while the frozen backbone retains the shared signal extraction capability. These lightweight adapters (5.1\% of backbone parameters) are federated via FedAvg, reducing per-round communication by up to 20$\times$ compared to federating full model updates. We evaluate various PEFT strategies across simulated distributed gNBs with non-IID interference environments. Results show that local LoRA achieves 12.8\% average BER improvement over the frozen backbone, while Fed-LoRA achieves comparable performance (12.6\%). Fed-LoRA outperforms local adaptation on data-starved nodes where federated knowledge transfer compensates for limited samples, all while avoiding the catastrophic degradation observed with full-model FedAvg under heterogeneous conditions.

cs.NI↗

Multistatic Radar Performance in the Presence of Distributed Wireless Synchronization

This paper proposes a multistatic radar (MSR) system utilizing a distributed wireless synchronization protocol. The wireless synchronization protocol uses a two-tone waveform exchange for frequency synchronization and a bi-directional waveform exchange for time synchronization, independent of GPS. A Bayesian Cramer-Rao lower bound (BCRLB) framework is developed to quantify the impact of synchronization offsets on joint delay and Doppler estimation, and consequently, on target localization and velocity estimation accuracy. Simulation results derived from the analytical expressions establish the extent to which the residual synchronization offsets degrade the MSR's performance. The performance of the synchronization links primarily depends on the synchronization-link channel and transmit parameters; optimizing these parameters enables the MSR configuration to surpass the monostatic performance and approach the ideal case. Furthermore, the simulated synchronization-link parameters suggest that practical implementation is feasible.

eess.SP↗

Experimental Demonstration of Robust Distributed Wireless Clock Synchronization

Distributed wireless clock synchronization is essential for aligning the clocks of distributed transceivers in support of joint transmission and reception techniques. One recently explored method involves synchronizing distributed transceivers using a two-tone waveform, where the tones are separated in frequency by a clock (frequency) reference signal. Prior research has demonstrated frequency accuracy better than 1 Hz; however, this approach remains vulnerable to both intentional and unintentional interference. In this demonstration, we present a robust, frequency-hopped two-tone waveform that enables transceivers to extract the reference signal without prior knowledge of the exact frequency at which the tones are transmitted.

eess.SP↗

Distributed Uplink Joint Transmission for 6G Communication

This paper investigates the spectral efficiency achieved through uplink joint transmission, where a serving user and the network users (UEs) collaborate by jointly transmitting to the base station (BS). The analysis incorporates the resource requirements for information sharing among UEs as a critical factor in the capacity evaluation. Furthermore, coherent and non-coherent joint transmission schemes are compared under various transmission power scenarios, providing insights into spectral and energy efficiency. A selection algorithm identifying the optimal UEs for joint transmission, achieving maximum capacity, is discussed. The results indicate that uplink joint transmission is one of the promising techniques for enabling 6G, achieving greater spectral efficiency even when accounting for the resource requirements for information sharing.

eess.SP↗

Linear Jamming Bandits: Learning to Jam 5G-based Coded Communications Systems

We study jamming of an OFDM-modulated signal which employs forward error correction coding. We extend this to leverage reinforcement learning with a contextual bandit to jam a 5G-based system implementing some aspects of the 5G protocol. This model introduces unreliable reward feedback in the form of ACK/NACK observations to the jammer to understand the effect of how imperfect observations of errors can affect the jammer's ability to learn. We gain insights into the convergence time of the jammer and its ability to jam a victim 5G waveform, as well as insights into the vulnerabilities of wireless communications for reinforcement learning-based jamming.

eess.SP↗

Wireless Mobile Distributed-MIMO for 6G

The paper proposes a new architecture for Distributed MIMO (D-MIMO) in which the base station (BS) jointly transmits with wireless mobile nodes to serve users (UEs) within a cell for 6G communication systems. The novelty of the architecture lies in the wireless mobile nodes participating in joint D-MIMO transmission with the BS (referred to as D-MIMO nodes), which are themselves users on the network. The D-MIMO nodes establish wireless connections with the BS, are generally near the BS, and ideally benefit from higher SNR links and better connections with edge-located UEs. These D-MIMO nodes can be existing handset UEs, Unmanned Aerial Vehicles (UAVs), or Vehicular UEs. Since the D-MIMO nodes are users sharing the access channel, the proposed architecture operates in two phases. First, the BS communicates with the D-MIMO nodes to forward data for the joint transmission, and then the BS and D-MIMO nodes jointly serve the UEs through coherent D-MIMO operation. Capacity analysis of this architecture is studied based on realistic 3GPP channel models, and the paper demonstrates that despite the two-phase operation, the proposed architecture enhances the system's capacity compared to the baseline where the BS communicates directly with the UEs.

eess.SP↗

Keep It Simple: CNN Model Complexity Studies for Interference Classification Tasks

The growing number of devices using the wireless spectrum makes it important to find ways to minimize interference and optimize the use of the spectrum. Deep learning models, such as convolutional neural networks (CNNs), have been widely utilized to identify, classify, or mitigate interference due to their ability to learn from the data directly. However, there have been limited research on the complexity of such deep learning models. The major focus of deep learning-based wireless classification literature has been on improving classification accuracy, often at the expense of model complexity. This may not be practical for many wireless devices, such as, internet of things (IoT) devices, which usually have very limited computational resources and cannot handle very complex models. Thus, it becomes important to account for model complexity when designing deep learning-based models for interference classification. To address this, we conduct an analysis of CNN based wireless classification that explores the trade-off amongst dataset size, CNN model complexity, and classification accuracy under various levels of classification difficulty: namely, interference classification, heterogeneous transmitter classification, and homogeneous transmitter classification. Our study, based on three wireless datasets, shows that a simpler CNN model with fewer parameters can perform just as well as a more complex model, providing important insights into the use of CNNs in computationally constrained applications.

eess.SP↗

Probability-Reduction of Geolocation using Reconfigurable Intelligent Surface Reflections

With the recent introduction of electromagnetic meta-surfaces and reconfigurable intelligent surfaces, a paradigm shift is currently taking place in the world of wireless communications and related industries. These new technologies have enabled the inclusion of the wireless channel as part of the optimization process. This is of great interest as we transition from 5G mobile communications towards 6G. In this paper, we explore the possibility of using a reconfigurable intelligent surface in order to disrupt the ability of an unintended receiver to geolocate the source of transmitted signals in a 5G communication system. We investigate how the performance of the MUSIC algorithm at the unintended receiver is degraded by correlated reflected signals introduced by a reconfigurable intelligent surface in the wireless channel. We analyze the impact of the direction of arrival, delay, correlation, and strength of the reconfigurable intelligent surface signal with respect to the line-of-sight path from the transmitter to the unintended receiver. An effective method is introduced for defeating direction-finding efforts using dual sets of surface reflections. This novel method is called Geolocation-Probability Reduction using Dual Reconfigurable Intelligent Surfaces (GPRIS). We also show that the efficiency of this method is highly dependent on the geometry, that is, the placement of the reconfigurable intelligent surface relative to the unintended receiver and the transmitter.

eess.SP↗

Probabilistic Receiver Architecture Combining BP, MF, and EP for Multi-Signal Detection

Receiver algorithms which combine belief propagation (BP) with the mean field (MF) approximation are well-suited for inference of both continuous and discrete random variables. In wireless scenarios involving detection of multiple signals, the standard construction of the combined BP-MF framework includes the equalization or multi-user detection functions within the MF subgraph. In this paper, we show that the MF approximation is not particularly effective for multi-signal detection. We develop a new factor graph construction for application of the BP-MF framework to problems involving the detection of multiple signals. We then develop a low-complexity variant to the proposed construction in which Gaussian BP is applied to the equalization factors. In this case, the factor graph of the joint probability distribution is divided into three subgraphs: (i) a MF subgraph comprised of the observation factors and channel estimation, (ii) a Gaussian BP subgraph which is applied to multi-signal detection, and (iii) a discrete BP subgraph which is applied to demodulation and decoding. Expectation propagation is used to approximate discrete distributions with a Gaussian distribution and links the discrete BP and Gaussian BP subgraphs. The result is a probabilistic receiver architecture with strong theoretical justification which can be applied to multi-signal detection.

cs.IT↗

Approximate Joint MAP Detection of Co-Channel Signals

We consider joint detection of co-channel signals---specifically, signals which do not possess a natural separability due to, for example, the multiple access technique or the use of multiple antennas. Iterative joint detection and decoding is a well known approach for utilizing the error correction code to improve detection performance. However, the joint maximum a posteriori probability (MAP) detector may be prohibitively complex, especially in a multipath channel. In this paper, we present an approximation to the joint MAP detector motivated by a factor graph model of the received signal. The proposed algorithm is designed to approximate the joint MAP detector as closely as possible within the computational capability of the receiver.

cs.IT↗