Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD'06) A Graph Alorithm Based Approach to Recovery and Failover in Tactical Manets Las Vegas, Nevada June 19-June 20 ISBN: 0-7695-2611-X
The objective of the attack recognition effort is to develop inference and correlation technologies that can detect complex multi-stage attacks in Mobile Adhoc Networks (MANET) environments where the reliance on centralized mechanisms or fixed relationships is unattainable. This work is supported by the Army Research Laboratory (ARL) Collaborative Technology Alliance (CTA). Technical Area 4 encompasses tactical information protection involving attack recognition and event dissemination where attack recognition is the focus of this study. Previous work has shown the ability to recognize malicious activity using a variety of statistical or fuzzy inference techniques. This research focuses on the next course of action after an attack takes place. This paper reports on an ongoing research effort to add the capability of a network to recover from an attack. This capability is based on the use of modified algorithms traditionally found in graph theory by an intelligent agent based framework. The agent-based framework is a collection of cooperative agents capable of raw packet data collection, comparison of metadata to a knowledge base, and the production of a decision.
Index Terms:
Intelligent Agents, Graph Theory, Clique Set Algorithm, Cut Set Algorithm, Network Security, Mobile Adhoc Networks.
Citation:
Damian Watkins, Craig Scott, Darryn Randle, "A Graph Alorithm Based Approach to Recovery and Failover in Tactical Manets," snpd-sawn, pp.253-260, Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD'06), 2006 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||