Dynamics of learning algorithms for the on-demand secure byzantine routing protocol

Authors:
Baruch Awerbuch;Robert G. Cole;Reza Curtmola;David Holmer;Herbert Rubens
Affiliations:
Department of Computer Science, Johns Hopkins University, Baltimore, MD;The JHU Applied Physics Laboratory, Laurel, MD;Department of Computer Science, Johns Hopkins University, Baltimore, MD;Department of Computer Science, Johns Hopkins University, Baltimore, MD;Department of Computer Science, Johns Hopkins University, Baltimore, MD
Venue:
ESAS'06 Proceedings of the Third European conference on Security and Privacy in Ad-Hoc and Sensor Networks
Year:
2006

Citing 10
Cited 0

Mitigating routing misbehavior in mobile ad hoc networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
The Byzantine Generals Problem

ACM Transactions on Programming Languages and Systems (TOPLAS)
Enforcing service availability in mobile ad-hoc WANs

MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Wireless Communications: Principles and Practice

Wireless Communications: Principles and Practice
Ariadne: a secure on-demand routing protocol for ad hoc networks

Proceedings of the 8th annual international conference on Mobile computing and networking
An on-demand secure routing protocol resilient to byzantine failures

WiSE '02 Proceedings of the 1st ACM workshop on Wireless security
Secure data transmission in mobile ad hoc networks

WiSe '03 Proceedings of the 2nd ACM workshop on Wireless security
Denial of service resilience in ad hoc networks

Proceedings of the 10th annual international conference on Mobile computing and networking
On the Survivability of Routing Protocols in Ad Hoc Wireless Networks

SECURECOMM '05 Proceedings of the First International Conference on Security and Privacy for Emerging Areas in Communications Networks
Aggregate and verifiably encrypted signatures from bilinear maps

EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the performance of of several protocol enhancements to the On-Demand Secure Byzantine Routing (ODSBR) [3] protocol in the presence of various Byzantine Attack models. These enhancements include a) modifications to the packet flow rates, b) a network layer retransmission capability and c) Nodal Weighting (in addition to Link Weighting) in the reputation database. These enhancements are meant to improve the learning rate of the protocol. The attack models investigated include previously investigated models [4] and a new and effective attack model, termed the MAC-Level Attack. We investigate the protocol enhancements through analytic models and simulation studies. We find that the protocol enhancements improve the learning times of the ODSBR protocol. The Nodal Weighting enhancement specifically helps in the presence of the various colluding Byzantine Attack models investigated.