Localizing jammers in wireless networks
PERCOM '09 Proceedings of the 2009 IEEE International Conference on Pervasive Computing and Communications
The fable of the bees: incentivizing robust revocation decision making in ad hoc networks
Proceedings of the 16th ACM conference on Computer and communications security
Approximation algorithms for combinatorial problems
Journal of Computer and System Sciences
Lightweight jammer localization in wireless networks: system design and implementation
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Principles of Spread-Spectrum Communication Systems, 2nd Edition
Principles of Spread-Spectrum Communication Systems, 2nd Edition
Wireless jamming localization by exploiting nodes’ hearing ranges
DCOSS'10 Proceedings of the 6th IEEE international conference on Distributed Computing in Sensor Systems
An Algorithm for Jammer Localization in Wireless Sensor Networks
AINA '12 Proceedings of the 2012 IEEE 26th International Conference on Advanced Information Networking and Applications
Moving Target Defense II: Application of Game Theory and Adversarial Modeling
Moving Target Defense II: Application of Game Theory and Adversarial Modeling
| Hi-index | 0.00 |
Cyber maneuver is envisioned as a way of increasing the robustness of imperfect systems by creating and deploying mechanisms that continually change a system's attack surface. A particularly useful strategy against jamming attacks in Mobile Ad Hoc Networks (MANETs) entails using cyber-maneuver keys to supplement higher-level cryptographic keys. Such keys can be periodically changed either in a proactive fashion - to defeat cryptanalytic efforts by external attackers - or in a reactive fashion - to exclude compromised internal nodes. In order to enable effective reactive rekeying, it is critical to correctly identify compromised nodes. In this paper, we propose a probabilistic framework for identifying jammers, based on the location of both jammed and non-jammed nodes. We are interested in finding the smallest set of nodes that need to be excluded to stop the attacks in a multi-jammer scenario. We show that this problem is NP-hard, and propose a polynomial-time heuristic algorithm to find approximate solutions. Experiments show that our approach works well in practice, and that the algorithm is efficient and achieves good precision and recall.