DocumentCode :
609890
Title :
Shaping Operations to Attack Robust Terror Networks
Author :
Callahan, Dennis ; Shakarian, Paulo ; Nielsen, Jakob ; Johnson, A.N.
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., United States Mil. Acad., West Point, NY, USA
fYear :
2012
fDate :
14-16 Dec. 2012
Firstpage :
13
Lastpage :
18
Abstract :
Security organizations often attempt to disrupt terror or insurgent networks by targeting "high value targets" (HVT\´s). However, there have been numerous examples that illustrate how such networks are able to quickly re-generate leadership after such an operation. Here, we introduce the notion of a "shaping" operation in which the terrorist network is first targeted for the purpose of reducing its leadership re-generation ability before targeting HVT\´s. We look to conduct shaping by maximizing the network-wide degree centrality through node removal. We formally define this problem and prove solving it is NP-Complete. We introduce a mixed integer-linear program that solves this problem exactly as well as a greedy heuristic for more practical use. We implement the greedy heuristic and found in examining five real-world terrorist networks that removing only 12% of nodes can increase the network-wide centrality between 17% and 45%.
Keywords :
computational complexity; integer programming; linear programming; terrorism; HVT; NP-complete problem; greedy heuristic; high value target; insurgent network disruption; leadership regeneration ability; mixed integer linear program; network-wide centrality; network-wide degree centrality; node removal; security organization; shaping operation notion; terror network disruption; algorithms; complex networks; sociology; terrorism;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Social Informatics (SocialInformatics), 2012 International Conference on
Conference_Location :
Lausanne
Print_ISBN :
978-1-4799-0234-7
Type :
conf
DOI :
10.1109/SocialInformatics.2012.22
Filename :
6542416
Link To Document :
بازگشت