Wireless LAN transmitter location under the threat of jamming attacks

被引:3
作者
Schweitzer, David [1 ]
Medal, Hugh [2 ]
机构
[1] Mississippi State Univ 1, Dept Ind & Syst Engn, POB 9542, Mississippi State, MS 39762 USA
[2] Univ Tennessee, Dept Ind & Syst Engn, 851 Neyland Dr, Knoxville, TN 37996 USA
关键词
Networks; Mixed-integer programming; Tri-level programming; Security; Location analysis; CRITICAL INFRASTRUCTURE; INTERDICTION; NETWORKS; RESILIENCE; ALGORITHM;
D O I
10.1016/j.cor.2019.01.014
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This paper studies the optimal placement of wireless access points in a network under the threat of jamming. We addressed this problem with a tri-level mixed-integer program. In the top level, the defender seeks to optimally place a set of capacity-limited access points to maximize total connectivity. In the middle level, an attacker seeks to optimally place a set of jammers that may be relocated between time periods to minimize total connectivity. In the bottom level, demand points seek to connect to capacitated access points such that their connections maximize their network utility. This model was examined from two viewpoints: a non-additive model in which connections were jammed if they fell within a jammer's radius, and an additive model in which connections were jammed if enough jamming power was interfering with the connection. We proposed a solution methodology which solved a modified bi-level program efficiently via implicit enumeration and dynamic constraint generation. We showed that the addition of just one access point provided a significant increase to network connectivity, different topologies had different robustness when different utility functions were considered, and optimal jammer placement varied significantly across different topologies. Through our experiments on five topologies, we found the Spacious and Median topologies were closest to the optimal access point placement. (C) 2019 Elsevier Ltd. All rights reserved.
引用
收藏
页码:14 / 27
页数:14
相关论文
共 40 条
[1]   A bilevel partial interdiction problem with capacitated facilities and demand outsourcing [J].
Aksen, Deniz ;
Akca, Sema Sengul ;
Aras, Necati .
COMPUTERS & OPERATIONS RESEARCH, 2014, 41 :346-358
[2]   Detecting critical nodes in sparse graphs [J].
Arulselvan, Ashwin ;
Commander, Clayton W. ;
Elefteriadou, Lily ;
Pardalos, Panos M. .
COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (07) :2193-2200
[3]   A BRANCH AND BOUND ALGORITHM FOR THE BILEVEL PROGRAMMING PROBLEM [J].
BARD, JF ;
MOORE, JT .
SIAM JOURNAL ON SCIENTIFIC AND STATISTICAL COMPUTING, 1990, 11 (02) :281-292
[4]   Stochastic Measures of Network Resilience: Applications to Waterway Commodity Flows [J].
Baroud, Hiba ;
Ramirez-Marquez, Jose E. ;
Barker, Kash ;
Rocco, Claudio M. .
RISK ANALYSIS, 2014, 34 (07) :1317-1335
[5]   A New Computational Approach for Maximum Link Activation in Wireless Networks under the SINR Model [J].
Capone, Antonio ;
Chen, Lei ;
Gualandi, Stefano ;
Yuan, Di .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2011, 10 (05) :1368-1372
[6]   Optimal Allocation of Protective Resources in Shortest-Path Networks [J].
Cappanera, Paola ;
Scaparra, Maria Paola .
TRANSPORTATION SCIENCE, 2011, 45 (01) :64-80
[7]   Identifying critical infrastructure: The median and covering facility interdiction problems [J].
Church, RL ;
Scaparra, MP ;
Middleton, RS .
ANNALS OF THE ASSOCIATION OF AMERICAN GEOGRAPHERS, 2004, 94 (03) :491-502
[8]   Jamming communication networks under complete uncertainty [J].
Commander, Clayton W. ;
Pardalos, Panos M. ;
Ryabchenko, Valeriy ;
Shylo, Oleg ;
Uryasev, Stan ;
Zrazhevsky, Grigoriy .
OPTIMIZATION LETTERS, 2008, 2 (01) :53-70
[9]   The wireless network jamming problem [J].
Commander, ClaytonW. ;
Pardalos, Panos M. ;
Ryabchenko, Valeriy ;
Uryasev, Stan ;
Zrazhevsky, Grigoriy .
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2007, 14 (04) :481-498
[10]  
Dallaire A., 2004, Computer-Aided Scheduling of Public Transport (CASPT), P73