Source number estimation plays an important role in successful blind signal separation. At present, the application of machine learning allows the processing of signals without the time-consuming and complex work of manual feature extraction. However, the convolutional neural network (CNN) for processing complex signals has some problems, such as incomplete feature extraction and high resource consumption. In this paper, a lightweight source number estimation network (LSNEN), which can achieve a robust estimation of the number of mixed complex signals at low SNR (signal-to-noise ratio), is studied. Compared with other estimation methods, which require manual feature extraction, our network can realize the extraction of the depth feature of the original signal data. The convolutional neural network realizes complex mapping of modulated signals through the cascade of multiple three-dimensional convolutional modules. By using a three-dimensional convolution module, the mapping of complex signal convolution is realized. In order to deploy the network in the mobile terminal with limited resources, we further propose a compression method for the network. Firstly, the sparse structure network is obtained by the weight pruning method to accelerate the speed of network reasoning. Then, the weights and activation values of the network are quantified at a fixed point with the method of parameter quantization. Finally, a lightweight network for source number estimation was obtained, which was compressed from 12.92 MB to 3.78 MB with a compression rate of 70.74%, while achieving an accuracy of 94.4%. Compared with other estimation methods, the lightweight source number estimation network method proposed in this paper has higher accuracy, less model space occupation, and can realize the deployment of the mobile terminal.
The rapid proliferation of low-altitude drones has led to increasingly congested and heterogeneous electromagnetic environments, posing significant challenges to fine-grained spectrum awareness and reliable drone management. Specific emitter identification (SEI), which exploits inherent hardware-dependent radio frequency fingerprints, provides an effective physical-layer solution for emitter-level discrimination. However, practical SEI systems often suffer from two critical issues: extremely limited labeled samples for newly emerging emitters and heterogeneous data distributions collected by geographically distributed receivers with mismatched label spaces. To address these challenges, this paper proposes a heterogeneous federated learning (HFL)-based framework for few-shot specific emitter identification (FS-SEI). The proposed framework decouples feature embedding learning from task-specific classification and enables collaborative representation learning across distributed receivers without sharing raw signal data. A metric learning-based training strategy is adopted, where only the feature embedding models are aggregated in the federated process, effectively alleviating the impact of label space mismatch by utilizing center loss and an improved triplet loss. Moreover, two federated optimization schemes, namely gradient averaging (GA) and model averaging (MA), are systematically investigated to analyze their effectiveness under fully heterogeneous settings. Extensive experiments conducted on a real-world dataset demonstrate that the proposed HFL framework significantly outperforms isolated local training. In particular, the GA-based scheme achieves a few-shot identification performance that closely approaches centralized learning while preserving data privacy and robustness against data heterogeneity. The results validate the effectiveness of the proposed approach for practical FS-SEI in low-altitude drone management scenarios.
Network protocol analysis can help security personnel analyze network vulnerabilities. However, the network protocol analysis is confronted with more and more kinds of protocols and more and more complex issues. Firstly, based on the basis function of the network protocol structure representation method, the improved k-means clustering algorithm based on the basis function is presented. Finally, a network protocol analysis process based on basis function is presented. Performance analysis shows that the proposed method is superior to traditional matching methods and statistical methods.
Deep neural networks have been widely deployed in numerous real-world applications, making trained models valuable intellectual property. However, embedded watermarks remain vulnerable to removal attacks, particularly when an adversary has only limited clean unlabeled data and the original watermark information is unavailable. To address this problem, this paper proposes a feature-decoupled contrastive self-distillation method for watermark removal against black-box-verifiable watermarks under an editable-model threat model. Given clean unlabeled data, high-confidence pseudo-labels are first generated solely from the output predictions of the watermarked model, without requiring ground-truth labels. Feature decoupling is then employed to distinguish normal and watermark-related features, based on which an inferred watermark-related perturbation is obtained without assuming exact recovery of the original secret trigger. Contrastive learning subsequently guides the editable model away from watermark-related representations, while feature- and label-level self-distillation provide layer-wise regularization across intermediate representations and predictions to preserve the model’s normal task behavior. Experiments on four datasets (MNIST, CIFAR-10, ImageNet-10, and ImageNet-100) demonstrate that the proposed method effectively reduces residual watermark behavior under the limited-data, unlabeled setting. For example, the verification success rate of the BadNets watermark is reduced to 4.0% and 5.67% on CIFAR-10 and ImageNet-100, respectively. For the complete method, the largest reported mean main-task accuracy drop relative to the pre-removal watermarked model is 3.95 percentage points in the main comparison and 4.98 percentage points when the data-proportion sensitivity experiments are included. Visualization and ablation results further demonstrate the effectiveness of the feature-decoupling and self-distillation components for watermark removal.
To address the sorting challenge of multiple stations and multiple networking modes (networks with inconsistent features and networks with similar features but asynchrony) in complex electromagnetic environments, this paper proposes a full-network station sorting algorithm that integrates Hop Describe Word (HDW), hierarchical clustering, and temporal sorting. First, from the perspectives of hardware differences, channel interference, and networking strategies, it is demonstrated that “there theoretically exist no multiple frequency-hopping networks that are completely synchronized and have consistent features”, thereby defining the sorting boundary of the algorithm. Second, “preliminary clustering sorting” is used to separate networks with significant differences in HDW static features, and then the “temporal sorting algorithm” designed in this paper is applied to overcome the sorting bottleneck of networks with similar features but asynchrony. Finally, based on the feature rules of the sorted networks, ARIMA temporal prediction and K-nearest neighbor (KNN) feature completion are adopted to achieve accurate recovery of missing signals. Experimental results show that in scenarios with a signal-to-noise ratio (SNR) of −8 dB to 5 dB and a signal loss rate of 0% to 15%, the proposed algorithm achieves an average sorting accuracy of 96.7%, a sorting completeness of 94.3%, and a robustness fluctuation range of only ±4.2% for 10 mixed networks. It significantly outperforms the traditional K-means algorithm and the single HDW clustering algorithm, and can effectively meet the needs of military and civilian spectrum reconnaissance and station sorting.
The existing anonymous region construction schemes based on continuous Location-based service (LBS) queries do not solve the temporal and spatial relationship of common user sets in adjacent anonymous regions. The attacker can reduce the anonymous region and reduce the common user set by the Maximum movement boundary attack, and reduce the privacy protection level of the user. Aiming at the above problems, considering the time accessibility of adjacent anonymous region and common user set, this paper proposes a location privacy enhancement scheme based on historical footprint for k-anonymity. The security analysis shows that the scheme does not increase the computational cost and communication cost of the system while guaranteeing the privacy queries of the users, and does not affect the user's quality of service. It has good validity and practicability.