A probabilistic framework for distributed localization of attackers in MANETs

3Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Mobile Ad-hoc Networks (MANETs) are frequently exposed to a wide range of cyber threats due to their unique characteristics. The lack of a centralized monitoring and management infrastructure and the dynamic nature of their topology pose new and interesting challenges for the design of effective security mechanisms. While conventional methods primarily focus on detecting attacks, in this work we focus on estimating the attackers' physical location in the network, and propose a probabilistic framework for aggregating information gathered from nodes reporting malicious activity in their vicinity. In order to overcome the limitations of the decentralized nature of MANETs, we present a distributed approach to attacker localization based on dynamically partitioning the network into clusters. These self-organizing clusters can (i) independently find the approximate location of the attackers in real time, and (ii) deploy trusted resources to capture attackers. We show, through experiments in a simulated environment, that our approach is effective and efficient. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

De Benedictis, A., Koosha, B., Albanese, M., & Casola, V. (2013). A probabilistic framework for distributed localization of attackers in MANETs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8203 LNCS, pp. 49–64). https://doi.org/10.1007/978-3-642-41098-7_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free