Advertisement

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

  • Baruch Awerbuch
  • Robert G. Cole
  • Reza Curtmola
  • David Holmer
  • Herbert Rubens
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4357)

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.

Keywords

MANET Routing Security Byzantine Attacks 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 2.
    Avramopoulos, I., Kobayashi, H., Wang, R., Krishnamurthy, A.: Highly Secure and Efficient Routing. In: INFOCOM 2004 (March 2004)Google Scholar
  3. 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. 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. 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. 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. 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. 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. 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. 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. 11.
    Murphy, S., Badger, M., Wellington, B.: OSPF with Digital Signatures, IETF RFC 2154 (June 1997)Google Scholar
  12. 12.
    The Network Simulator - ns2 (2005), http://www.isi.edu/nsnam/ns/
  13. 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. 14.
    Papadimitratos, P., Haas, Z.: Secure data transmission in mobile ad hoc networks. In: ACM Workshop on Wireless Security (WiSe) (2003)Google Scholar
  15. 15.
    Perlman, R.: Network Layer Protocols with Byzantine Robustness, MIT Thesis (August 1988)Google Scholar
  16. 16.
    Rappaport, T.: Wireless Communications Principles and Practice, 2nd edn. Pearson Education Press, Singapore (2002)Google Scholar
  17. 17.
    Yoon, J., Liu, M., Noble, B.D.: Random waypoint considered harmful. In: INFOCOM 2003 (April 2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Baruch Awerbuch
    • 1
  • Robert G. Cole
    • 2
  • Reza Curtmola
    • 1
  • David Holmer
    • 1
  • Herbert Rubens
    • 1
  1. 1.Department of Computer ScienceJohns Hopkins UniversityBaltimoreUSA
  2. 2.The JHU Applied Physics LaboratoryLaurelUSA

Personalised recommendations