Policies for sharing distributed probabilistic beliefs

Authors:
Christopher Leckie;Ramamohanarao Kotagiri
Affiliations:
ARC Special Research Centre for Ultra-Broadband Information Networks, Department of Electrical and Electronic Engineering, The University of Melbourne, Victoria 3010, Australia;ARC Special Research Centre for Ultra-Broadband Information Networks, Department of Computer Science and Software Engineering, The University of Melbourne, Victoria 3010, Australia
Venue:
ACSC '03 Proceedings of the 26th Australasian computer science conference - Volume 16
Year:
2003

Citing 5
Cited 2

Adaptive protocols for information dissemination in wireless sensor networks

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Network Intrusion Detection: An Analyst's Handbook

Network Intrusion Detection: An Analyst's Handbook
Some Practical Issues in Modeling Diagnostic Systems with Multiply Sectioned Bayesian Networks

Proceedings of the Twelfth International Florida Artificial Intelligence Research Society Conference
Nearly monotonic problems: a key to effective FA/C distributed sensor interpretation?

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Representing aggregate belief through the competitive equilibrium of a securities market

UAI'97 Proceedings of the Thirteenth conference on Uncertainty in artificial intelligence

On the benefits of cheating by self-interested agents in vehicular networks

Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Trust Management for VANETs: Challenges, Desired Properties and Future Directions

International Journal of Distributed Systems and Technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present several general policies for deciding when to share probabilistic beliefs between agents for distributed monitoring. In order to evaluate these policies, we have formulated an application in network intrusion detection as a multi-agent monitoring problem. We have evaluated our policies based on packet trace data from a real network. Based on this evaluation, we have demonstrated that our policies can reduce both the delay and communication overhead required to detect network intrusions. Although we have focused on network intrusion detection as an application, we contend that our policies can generally be applied to domains that use a probabilistic model for evaluating hypotheses, and have a method for combining beliefs from multiple agents.