Skip to main content

Terrorist Network Monitoring with Identifying Code

  • Conference paper
  • First Online:
Social, Cultural, and Behavioral Modeling (SBP-BRiMS 2018)

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Wikipedia Article: List of Terrorist Incidents in France. Accessed 26 Dec 2017

    Google Scholar 

  2. Cooper, H.: 15,000 on French terror watchlist: report. Politico (2016)

    Google Scholar 

  3. Bernstein, L.: From France to the U.S. terrorists ’known to authorities’ carry out deadly attacks. WJLA (2017)

    Google Scholar 

  4. 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)

    Article  MathSciNet  Google Scholar 

  5. Laifenfeld, M., Trachtenburg, A.: Identifying codes and covering problems. IEEE Trans. Inf. Theory 54, 3929–3950 (2008)

    Article  MathSciNet  Google Scholar 

  6. 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)

    Article  Google Scholar 

  7. 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)

    Article  MathSciNet  Google Scholar 

  8. 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)

    Article  MathSciNet  Google Scholar 

  9. Auger, D.: Minimal identifying codes in trees and planar graphs with large girth. Eur. J. Comb. 31, 1372–1384 (2010)

    Article  MathSciNet  Google Scholar 

  10. 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

    Chapter  MATH  Google Scholar 

  11. Suomela, J.: Approximability of identifying codes and locating-dominating codes. Inf. Process. Lett. 103, 28–33 (2007)

    Article  MathSciNet  Google Scholar 

  12. Ray, S., Starobinski, D., Trachtenburg, A., Ungrangsi, R.: Robust location detection in emergency sensor networks. IEEE J. Sel. Areas Commun. 22, 1016–1025 (2004)

    Article  Google Scholar 

  13. Honkala, I., Karpovsky, M.G., Levitin, L.B.: On robust and dynamic identifying codes. IEEE Trans. Inf. Theory 52(2), 599–612 (2006)

    Article  MathSciNet  Google Scholar 

  14. Baer, J.-L.: Computer Systems Architecture. Computer Science Press, Rockville (1980)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kaustav Basu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

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)

Publish with us

Policies and ethics