Abstract
On multiple incidences of terrorist attacks in recent times across Europe, it has been observed that the perpetrators of the attack were in the suspect databases of the law enforcement authorities, but weren’t under active surveillance at the time of the attack due to resource limitations on the part of the authorities. As the suspect databases in various European countries are very large, and it takes significant amount of technical and human resources to monitor a suspect in the database, monitoring all the suspects in the database may be an impossible task. In this paper, we propose a scheme utilizing Identifying Codes that will significantly reduce the resource requirement of law enforcement authorities, and will have the capability of uniquely identifying a suspect in case the suspect becomes active in planning a terrorist attack. The scheme relies on the assumption that, when an individual becomes active in planning a terrorist attack, his/her friends/associates will have some inkling of the individuals plan. Accordingly, even if the individual is not under active surveillance by the authorities, but the individual’s friends/associates are, the individual planning the attack can be uniquely identified. We applied our technique on two terrorist networks, one involved in an attack in Paris and the other involved in the 9/11 attack. We show that, in the Paris network, if 5 of the 10 individuals were monitored, the attackers most likely would have been exposed. If only 15 out of the 37 individuals involved in the 9/11 attack were under surveillance, specific individuals involved in the planning of the 9/11 attack would have been exposed.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Wikipedia Article: List of Terrorist Incidents in France. Accessed 26 Dec 2017
Cooper, H.: 15,000 on French terror watchlist: report. Politico (2016)
Bernstein, L.: From France to the U.S. terrorists ’known to authorities’ carry out deadly attacks. WJLA (2017)
Karpovsky, G.M., Chakraborty, K., Levitin, L.B.: On a new class of codes for identifying vertices in graphs. IEEE Trans. Inf. Theory 44(2), 599–611 (1998)
Laifenfeld, M., Trachtenburg, A.: Identifying codes and covering problems. IEEE Trans. Inf. Theory 54, 3929–3950 (2008)
Laifenfeld, M., Trachtenburg, A., Cohen, R., Starobinski, D.: Joint monitoring and routing in wireless sensor networks using robust identifying codes. Mob. Netw. Appl. 14, 415–432 (2009)
Charon, I., Hudry, O., Lobstein, A.: Identifying and locating-dominating codes: NP-completeness results for directed graphs. IEEE Trans. Inf. Theory 48, 2192–2200 (2002)
Charon, I., Hudry, O., Lobstein, A.: Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard. Theor. Comput. Sci. 290, 2109–2120 (2003)
Auger, D.: Minimal identifying codes in trees and planar graphs with large girth. Eur. J. Comb. 31, 1372–1384 (2010)
Xiao, Y., Hadjicostis, C., Thulasiraman, K.: The d-identifying codes problem for vertex identification in graphs: probabilistic analysis and an approximation algorithm. In: Chen, D.Z., Lee, D.T. (eds.) COCOON 2006. LNCS, vol. 4112, pp. 284–298. Springer, Heidelberg (2006). https://doi.org/10.1007/11809678_31
Suomela, J.: Approximability of identifying codes and locating-dominating codes. Inf. Process. Lett. 103, 28–33 (2007)
Ray, S., Starobinski, D., Trachtenburg, A., Ungrangsi, R.: Robust location detection in emergency sensor networks. IEEE J. Sel. Areas Commun. 22, 1016–1025 (2004)
Honkala, I., Karpovsky, M.G., Levitin, L.B.: On robust and dynamic identifying codes. IEEE Trans. Inf. Theory 52(2), 599–612 (2006)
Baer, J.-L.: Computer Systems Architecture. Computer Science Press, Rockville (1980)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Sen, A., Goliber, V.H., Zhou, C., Basu, K. (2018). Terrorist Network Monitoring with Identifying Code. In: Thomson, R., Dancy, C., Hyder, A., Bisgin, H. (eds) Social, Cultural, and Behavioral Modeling. SBP-BRiMS 2018. Lecture Notes in Computer Science(), vol 10899. Springer, Cham. https://doi.org/10.1007/978-3-319-93372-6_36
Download citation
DOI: https://doi.org/10.1007/978-3-319-93372-6_36
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-93371-9
Online ISBN: 978-3-319-93372-6
eBook Packages: Computer ScienceComputer Science (R0)