.png){kind=icon}
.png){kind=icon}
Return
A mixed-integer programming approach for locating jamming devices in a flow-jamming attack
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2018.02.020.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The ubiquitous nature of wireless networks makes them increasingly prone to jamming attacks as such attacks become more sophisticated. In this paper, we seek to gain understanding about a particular type of jamming attack: the flow-jamming attack. Toward this end, we provide a mixed-integer programming model for optimizing the location of jamming devices for flow-jamming attacks. An accelerated Benders' decomposition approach was used to solve the model. We solved the problem for two realistic networks and 18 randomly generated networks and found that the Benders' approach was computationally faster than CPLEX for nearly all the problem instances, particularly for larger problems with 1440 binary variables. The experimental results show that optimally locating jamming devices can increase the impact of flow-jamming attacks. Specifically, as the number of possible locations increases the jammers' efficacy increases as well, but there is a clear point of diminishing returns. Also, adding lower-powered jammers to work in conjunction with higher powered jammers significantly increases overall efficacy in spite of the power difference. (C) 2018 Elsevier Ltd. All rights reserved.
Keywords:
OR In telecommunications
OR In defense
Flow-jamming attacks
Jamming device placement problem
Benders' decomposition
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W