系统工程与电子技术 ›› 2026, Vol. 48 ›› Issue (7): 2492-2500.doi: 10.12305/j.issn.1001-506X.2026.07.32

• 通信与网络 • 上一篇    

基于改进DBSCAN算法的跳频网台分选方法

周伟1,2, 郭浩南3(), 侯长波3, 孟昊3, 万凯3   

  1. 1. 海军航空大学信息融合研究所,山东 烟台 264001
    2. 山东省海空信息感知与处理技术重点实验室,山东 烟台 264001
    3. 哈尔滨工程大学信息与通信工程学院,黑龙江 哈尔滨 150001
  • 收稿日期:2025-07-07 修回日期:2025-10-10 出版日期:2026-01-24 发布日期:2026-01-24
  • 通讯作者: 侯长波 E-mail:2855677794@qq.com
  • 基金资助:
    中央高校基本科研业务费专项资金(3072024XX0808);中国国家自然科学基金(62271499)资助课题

Method for sorting frequency-hopping network stations based on the improved DBSCAN algorithm

Wei ZHOU1,2, Haonan GUO3(), Changbo HOU3, Hao MENG3, Kai WAN3   

  1. 1. Institute of Information Fusion,Naval Aviation University,Yantai 264001,China
    2. Key Laboratory of Sea-Air Information Perception and Processing Technology of Shandong Province,Yantai 264001,China
    3. College of Information and Communication Engineering,Harbin Engineering University,Harbin 150001,China
  • Received:2025-07-07 Revised:2025-10-10 Online:2026-01-24 Published:2026-01-24
  • Contact: Changbo HOU E-mail:2855677794@qq.com

摘要:

针对复杂电磁环境下跳频网台分选面临的强噪声和干扰抑制难题,提出了一种基于联合特征的改进基于密度的带噪声应用空间聚类(density-based spatial clustering of applications with noise,DBSCAN)算法。借鉴点云建模的思想,以参数估计得到的各跳段跳频周期、跳变时刻与平均能量为特征,构建联合特征向量,将跳频信号的特征抽象为结构化的点云分布,在此基础上,计算联合特征的距离矩阵以确定参数k,并结合直方图密度划分生成对应的邻域半径和邻域内最小点数,遍历每组序列进行迭代聚类,实现对多跳频信号簇结构的自动提取与融合,解决了传统DBSCAN方法对密度分布敏感的问题。仿真实验表明,所提方法在信噪比为?2 dB条件下分选准确率达98.5%,显著优于K-Means、K均值层次方法及传统DBSCAN算法的准确率。该方法无需依赖跳频参数先验信息,具备良好的抗干扰能力与泛化性能,为复杂电磁环境下的跳频信号分选提供了思路。

关键词: 跳频通信, 基于密度的带噪声应用空间聚类, 时频分析, 参数估计, 跳频网台分选

Abstract:

Addressing the challenge of strong noise and interference suppression in frequency-hopping network station sorting under complex electromagnetic environments, an improved density-based spatial clustering of applications with noise (DBSCAN) algorithm based on joint features is proposed. Inspired by point cloud modeling, a joint feature vector is constructed using the estimated hop segment parameters—namely, hop period, hopping instant, and average energy—abstracting the frequency hopping signal features into a structured point cloud distribution. On this basis, a joint feature distance matrix is computed to determine the parameter k, while a histogram-based density partitioning method is employed to generate the corresponding neighborhood radius and minimum number of points within the neighborhood. An iterative clustering process is then performed by traversing each sequence, enabling automatic extraction and fusion of multiple frequency hopping signal clusters. This approach effectively overcomes the sensitivity of traditional DBSCAN to density distribution. Simulation results demonstrate that the proposed method achieves a sorting accuracy of 98.5% at a signal to noise ratio of ?2 dB, significantly outperforming K-Means, K-means hierarchical method, and conventional DBSCAN algorithms. The method does not require prior knowledge of frequency hopping parameters and exhibits strong anti-interference capability and generalization performance, offering a solution for frequency hopping signal sorting in complex electromagnetic environments.

Key words: frequency-hopping communication, density-based spatial clustering of applications with noise clustering (DBSCAN), time-frequency analysis, parameter estimation, frequency-hopping network station selection

中图分类号: