系统仿真学报 ›› 2019, Vol. 31 ›› Issue (6): 1101-1110.doi: 10.16182/j.issn1004731x.joss.18-0730

• 仿真建模理论与方法 • 上一篇    下一篇

一种基于粒子群优化的干扰点部署算法

方芳1, 叶春明2, 刘海波3   

  1. 1. 安徽中医药大学,安徽 合肥 230037;
    2. 国防科技大学电子对抗学院,安徽 合肥 230037;
    3. 31108部队,江苏 南京 210016
  • 收稿日期:2018-10-31 修回日期:2019-01-04 出版日期:2019-06-08 发布日期:2019-12-12
  • 作者简介:方芳(1982-),女,安徽安庆,硕士生,讲师,研究方向为数据分析,优化算法。
  • 基金资助:
    国防科技大学基金(zk170341),安徽省教研基金(kj2016A400),安徽中医药大学自然重点项目(2018zrzd12)

Jammer Placement Algorithm Based on Particle Swarm Optimization

Fang Fang1, Ye Chunming2, Liu Haibo3   

  1. 1. Anhui University of Chinese Medicine, Hefei 230037, China;
    2. School of Electronic Countermeasure, National University of Defense Technology, Hefei 230037, China;
    3. 31108th Unit, Nanjing 210016, China
  • Received:2018-10-31 Revised:2019-01-04 Online:2019-06-08 Published:2019-12-12

摘要: 针对现有的自组网干扰点部署算法未考虑目标移动和部署区域受限的情况,提出一种基于粒子群优化的干扰点部署算法。算法主要包括目标建模、攻击建模和优化计算3部分,采用离散事件仿真方法对目标网络节点移动特性和通信过程进行建模,利用简单粒子群算法实现最佳位置的选择。实验结果表明,该算法部署的干扰点对于不同移动方式节点的目标网络具有很好的干扰效果。当干扰区域受限,或是干扰距离、网络节点密度、节点速度、干扰点数量等条件变化时,算法性能均表现出良好的稳定性。

关键词: 无线自组网, 移动节点干扰, 干扰点部署, 粒子群优化

Abstract: A novel jammer placement algorithm based on particle swarm optimization is proposed to solve the problems of nodes’ mobility and restrictions on placement areas in ad-hoc network. There are three steps in this algorithm: network simulation, jamming simulation, and optimization. The algorithm simulates the network communication process and movement of nodes with discrete simulation method. Simple particle swarm optimization is applied to compute the exact coordinates of jammers. Experiment results show that this algorithm is good at jamming network nodes moving in different ways. The algorithm has stable performance with varying conditions such as different placement areas, jamming ranges, network density, speeds of nodes and numbers of jammers.

Key words: Ad-hoc network, jamming moving target, jammer placement, particle swarm optimization

中图分类号: