Skip to main content

BeeHiveGuard: A Step Towards Secure Nature Inspired Routing Algorithms

  • Conference paper
Applications of Evolutionary Computing (EvoWorkshops 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3907))

Included in the following conference series:

Abstract

Nature inspired routing protocols for fixed and mobile networks are becoming an active area of research. However, analyzing their security threats and countering them have received little attention. In this paper we discuss the security threats of a state-of-the-art routing protocol, BeeHive, and then extend the algorithm with our security model to counter them. We further conclude from our extensive experiments that standard cryptography techniques can not be utilized due to their large processing and communication costs, if Nature inspired routing protocols are to be deployed in real world networks.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Di Caro, G., Dorigo, M.: AntNet: Distributed stigmergetic control for communication networks. Journal of Artificial Intelligence Research 9, 317–365 (1998)

    MATH  Google Scholar 

  2. Cox, M., Engelschall, R., Henson, S., Laurie, B.: The openssl project. http://www.openssl.org

  3. Dasgupta, D. (ed.): Artificial Immune Systems and their Applications. Springer, Heidelberg (1998)

    Google Scholar 

  4. Hauser, R., Przygienda, T., Tsudik, G.: Reducing the cost of security in linkstate routing. In: SNDSS 1997: Proceedings of the 1997 Symposium on Network and Distributed System Security, Washington, DC, p. 93. IEEE Computer Society, Los Alamitos

    Google Scholar 

  5. Hu, Y.-C., Perrig, A., Johnson, D.B.: Efficient security mechanisms for routing protocolsa. In: Proceedings of the Network and Distributed System Security Symposium, NDSS 2003, California, USA, The Internet Society, San Diego (2003)

    Google Scholar 

  6. Hu, Y.-C., Perrig, A., Johnson, D.B.: Ariadne: A secure on-demand routing protocol for ad hoc networks. Wireless Networks 11(1-2), 21–38 (2005)

    Article  Google Scholar 

  7. Liang, S., Zincir-Heywood, A.N., Heywood, M.I.: Intelligent packets for dynamic network routing using distributed genetic algorithm. In: Proceedings of Genetic and Evolutionary Computation Conference. GECCO July(2002)

    Google Scholar 

  8. Murphy, S.L., Badger, M.R.: Digital signature protection of the ospf routing protocol. In: SNDSS 1996: Proceedings of the 1996 Symposium on Network and Distributed System Security (SNDSS 1996), DC, USA, p. 93. IEEE Computer Society, Washington (1996)

    Google Scholar 

  9. Perlman, R.: Network layer protocols with byzantine robustness. phd thesis. In: Technical report, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technolog (1998)

    Google Scholar 

  10. Rivest, R.L., Shamir, A., Adleman, L.M.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120–126 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  11. Smith, B.R., Murthy, S., Garcia-Luna-Aceves, J.J.: Securing distancevector routing protocols. In: Proceedings of the Network and Distributed System Security Symposium, NDSS 1997, California, USA, San Diego. IEEE Computer Society, Los Alamitos (1997)

    Google Scholar 

  12. Varga, A.: OMNeT++: Discrete event simulation system: User manual. http://www.omnetpp.org

  13. Vetter, B., Wang, F., Wu, S.F.: An experimental study of insider attacks for ospf routing protocol. In: ICNP 1997: Proceedings of the 1997 International Conference on Network Protocols (ICNP 1997), Washington, DC, USA, p. 293. IEEE Computer Society, Los Alamitos (1997)

    Google Scholar 

  14. Wedde, H.F., Farooq, M.: A performance evaluation framework for nature inspired routing algorithms. In: Rothlauf, F., Branke, J., Cagnoni, S., Corne, D.W., Drechsler, R., Jin, Y., Machado, P., Marchiori, E., Romero, J., Smith, G.D., Squillero, G. (eds.) EvoWorkshops 2005. LNCS, vol. 3449, pp. 136–146. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  15. Wedde, H.F., Farooq, M., Zhang, Y.: BeeHive: An efficient fault-tolerant routing algorithm inspired by honey bee behavior. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., Stützle, T. (eds.) ANTS 2004. LNCS, vol. 3172, pp. 83–94. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  16. Zhong, W., Evans, D.: When ants attack: Security issues for stigmergic systems. Technical report, Department of Computer Science, University of Virginina, CS- 2002-3 (2002)

    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

Wedde, H.F., Timm, C., Farooq, M. (2006). BeeHiveGuard: A Step Towards Secure Nature Inspired Routing Algorithms. In: Rothlauf, F., et al. Applications of Evolutionary Computing. EvoWorkshops 2006. Lecture Notes in Computer Science, vol 3907. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11732242_22

Download citation

  • DOI: https://doi.org/10.1007/11732242_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-33237-4

  • Online ISBN: 978-3-540-33238-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics