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.
The full version of the paper is available as a technical report, see [5].
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aad, I., Hubaux, J.-P., Knightly, E.W.: Denial of Service Resilience in Ad Hoc Networks. In: Mobicom 2004, Philadelphia (September 2004)
Avramopoulos, I., Kobayashi, H., Wang, R., Krishnamurthy, A.: Highly Secure and Efficient Routing. In: INFOCOM 2004 (March 2004)
Awerbuch, B.R., Holmer, D., Nita-Rotaru, C., Rubens, H.: An on-demand secure routing protocol resilient to byzantine failures. In: ACM Workshop on Wireless Security (WiSe) (September 2002)
Awerbuch, B., Curtmola, R., Holmer, D., Nita-Rotaru, C., Rubens, H.: On the Survivability of Routing Protocols in Ad Hoc Wireless Networks. In: SecureCom 2005 (September 2005)
Awerbuch, B., Cole, R.G., Curtmola, R., Holmer, D., Nita-Rotaru, C., Rubens, H.: Dynamics of Learning Algorithms for the On-Demand Secure Byzantine Routing Protocol, JHU Applied Physics Laboratory Technical Report No. VIC-05-088 (November 2005)
Boneh, D., Gentry, C., Shacham, H., Lynn, B.: Aggregate and verifiable encrypted signatures from bilinear maps. In: Proceedings of Eurocrypt 2003 (2003)
Buttyan, L., Hubaux, J.P.: Enforcing Service Availability in Mobile Ad-Hoc WANs. In: Proceeding of IEEE/ACM Workshop on Mobile Ad Hoc Networking and Computing (MobiHoc), Boston, MA, USA (August 2000)
Hu, Y.-C., Perrig, A., Johnson, D.B.: Ariadne: A secure on-demand routing protocol for ad hoc networks. In: Proceedings of the Eighth ACM International Conference on Mobile Computing and Networking (MobiCom 2002) (September 2002)
Lamport, L., Shostak, R., Pease, M.: The Byzantine Generals Problem. ACM Transactions on Programming Languages and Systems 4(3) (July 1982)
Marti, S., Giuli, T.J., Lai, K., Baker, M.: Mitigating routing misbehavior in mobile ad hoc networks. In: Mobile Computing and Networking (MobiCom 2000) (September 2000)
Murphy, S., Badger, M., Wellington, B.: OSPF with Digital Signatures, IETF RFC 2154 (June 1997)
The Network Simulator - ns2 (2005), http://www.isi.edu/nsnam/ns/
Papadimitratos, P., Haas, Z.: Secure routing for mobile ad hoc networks. In: SCS Communication Networks and Distributed Systems Modeling and Simulation Conference (2002)
Papadimitratos, P., Haas, Z.: Secure data transmission in mobile ad hoc networks. In: ACM Workshop on Wireless Security (WiSe) (2003)
Perlman, R.: Network Layer Protocols with Byzantine Robustness, MIT Thesis (August 1988)
Rappaport, T.: Wireless Communications Principles and Practice, 2nd edn. Pearson Education Press, Singapore (2002)
Yoon, J., Liu, M., Noble, B.D.: Random waypoint considered harmful. In: INFOCOM 2003 (April 2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Awerbuch, B., Cole, R.G., Curtmola, R., Holmer, D., Rubens, H. (2006). Dynamics of Learning Algorithms for the On-Demand Secure Byzantine Routing Protocol. In: Buttyán, L., Gligor, V.D., Westhoff, D. (eds) Security and Privacy in Ad-Hoc and Sensor Networks. ESAS 2006. Lecture Notes in Computer Science, vol 4357. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11964254_10
Download citation
DOI: https://doi.org/10.1007/11964254_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69172-3
Online ISBN: 978-3-540-69173-0
eBook Packages: Computer ScienceComputer Science (R0)