Skip to main content

Dynamics of Learning Algorithms for the On-Demand Secure Byzantine Routing Protocol

  • Conference paper
Book cover Security and Privacy in Ad-Hoc and Sensor Networks (ESAS 2006)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 4357))

Included in the following conference series:

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].

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aad, I., Hubaux, J.-P., Knightly, E.W.: Denial of Service Resilience in Ad Hoc Networks. In: Mobicom 2004, Philadelphia (September 2004)

    Google Scholar 

  2. Avramopoulos, I., Kobayashi, H., Wang, R., Krishnamurthy, A.: Highly Secure and Efficient Routing. In: INFOCOM 2004 (March 2004)

    Google Scholar 

  3. 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)

    Google Scholar 

  4. 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)

    Google Scholar 

  5. 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)

    Google Scholar 

  6. Boneh, D., Gentry, C., Shacham, H., Lynn, B.: Aggregate and verifiable encrypted signatures from bilinear maps. In: Proceedings of Eurocrypt 2003 (2003)

    Google Scholar 

  7. 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)

    Google Scholar 

  8. 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)

    Google Scholar 

  9. Lamport, L., Shostak, R., Pease, M.: The Byzantine Generals Problem. ACM Transactions on Programming Languages and Systems 4(3) (July 1982)

    Google Scholar 

  10. 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)

    Google Scholar 

  11. Murphy, S., Badger, M., Wellington, B.: OSPF with Digital Signatures, IETF RFC 2154 (June 1997)

    Google Scholar 

  12. The Network Simulator - ns2 (2005), http://www.isi.edu/nsnam/ns/

  13. Papadimitratos, P., Haas, Z.: Secure routing for mobile ad hoc networks. In: SCS Communication Networks and Distributed Systems Modeling and Simulation Conference (2002)

    Google Scholar 

  14. Papadimitratos, P., Haas, Z.: Secure data transmission in mobile ad hoc networks. In: ACM Workshop on Wireless Security (WiSe) (2003)

    Google Scholar 

  15. Perlman, R.: Network Layer Protocols with Byzantine Robustness, MIT Thesis (August 1988)

    Google Scholar 

  16. Rappaport, T.: Wireless Communications Principles and Practice, 2nd edn. Pearson Education Press, Singapore (2002)

    Google Scholar 

  17. Yoon, J., Liu, M., Noble, B.D.: Random waypoint considered harmful. In: INFOCOM 2003 (April 2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics