This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Dempster-Shafer Theory for Intrusion Detection in Ad Hoc Networks
November/December 2005 (vol. 9 no. 6)
pp. 35-41
Thomas M. Chen, Southern Methodist University
Varadharajan Venkataramanan, Southern Methodist University
Without a fixed security infrastructure, mobile ad hoc networks must distribute intrusion detection among their nodes. But even though a distributed intrusion detection system can combine data from multiple nodes to estimate the likelihood of an intrusion, the observing nodes might not be reliable. The Dempster-Shafer theory of evidence is well suited for this type of problem because it reflects uncertainty. Moreover, Dempster?s rule for combination gives a numerical procedure for fusing together multiple pieces of evidence from unreliable observers. The authors review the Dempster-Shafer theory in the context of distributed intrusion detection and demonstrate the theory?s usefulness.
Index Terms:
intrusion detecction, security, ad hoc networks, peer to peer
Citation:
Thomas M. Chen, Varadharajan Venkataramanan, "Dempster-Shafer Theory for Intrusion Detection in Ad Hoc Networks," IEEE Internet Computing, vol. 9, no. 6, pp. 35-41, Nov.-Dec. 2005, doi:10.1109/MIC.2005.123
Usage of this product signifies your acceptance of the Terms of Use.