Creating and maintaining a good intrusion detection hierarchy in dynamic ad hoc networks

Authors:
Anthony McAuley;Kyriakos Manousakis;Dan Sterne;Richard Gopaul;Peter Kruus
Affiliations:
Telcordia Technologies, Piscataway, NJ;Telcordia Technologies, Piscataway, NJ;SPARTA, Inc., Columbia, MD;U.S. Army Research Laboratory, Adelphi, MD;SPARTA, Inc., Columbia, MD
Venue:
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Year:
2006

Citing 4
Cited 4

Mitigating routing misbehavior in mobile ad hoc networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Effective Intrusion Detection Using Multiple Sensors in Wireless Ad Hoc Networks

HICSS '03 Proceedings of the 36th Annual Hawaii International Conference on System Sciences (HICSS'03) - Track 2 - Volume 2
A General Cooperative Intrusion Detection Architecture for MANETs

IWIA '05 Proceedings of the Third IEEE International Workshop on Information Assurance
Fast and flexible tool for the generation, maintenance and evaluation of hierarchical structures in diverse networks

REALMAN '06 Proceedings of the 2nd international workshop on Multi-hop ad hoc networks: from theory to reality

A dynamic intrusion detection hierarchy for MANETs

SARNOFF'09 Proceedings of the 32nd international conference on Sarnoff symposium
Routing through an integrated communication and social network

MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Quantifying resiliency and detection latency of intrusion detection structures

MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Integrating intrusion detection and fault localization in MANETs

MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many insider attacks, such as certain forms of packet dropping, malicious routing updates, and wormholes, can only be detected using distributed and cooperative algorithms. One promising approach for applying these algorithms is using an intrusion detection (ID) hierarchy enabling data aggregation and local decision making whenever possible. A key challenge to this problem is the selection and maintenance of a scalable and robust hierarchy optimizing detection performance (e.g., latency, coverage, and false alarm rate) while incurring minimal cost (e.g., bandwidth and processing). Existing approaches (i.e. flooding for forming a Breadth First Search Tree) to constructing such a hierarchy are simple and distributed; however, their performance and cost can be undesirable. Moreover, mobility can produce constant large scale changes in the hierarchy that degrade performance and increase cost. The main contributions of this paper are to: a) model the performance and costs of ID hierarchies and represent them in formal objective functions and constraints, b) modify an existing versatile, multi-objective hierarchy generation and maintenance tool to create trees, c) give simulation results on the quality and stability of ID hierarchies in a 100-node mobile network.