Jammer Placement Algorithm Based on Particle Swarm Optimization

Authors

Fang Fang, 1. Anhui University of Chinese Medicine, Hefei 230037, China;;
Chunming Ye, 2. School of Electronic Countermeasure, National University of Defense Technology, Hefei 230037, China;;
Haibo Liu, 3. 31108th Unit, Nanjing 210016, China;

Abstract

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.

Recommended Citation

Fang, Fang; Ye, Chunming; and Liu, Haibo (2019) "Jammer Placement Algorithm Based on Particle Swarm Optimization," Journal of System Simulation: Vol. 31: Iss. 6, Article 9.
DOI: 10.16182/j.issn1004731x.joss.18-0730
Available at: https://dc-china-simulation.researchcommons.org/journal/vol31/iss6/9

First Page

1101

Revised Date

2019-01-04

DOI Link

https://doi.org/10.16182/j.issn1004731x.joss.18-0730

Last Page

1110

CLC

TP393

Recommended Citation

Fang Fang, Ye Chunming, Liu Haibo. Jammer Placement Algorithm Based on Particle Swarm Optimization[J]. Journal of System Simulation, 2019, 31(6): 1101-1110.

DOI

10.16182/j.issn1004731x.joss.18-0730